/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix026_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-c7e336b [2020-10-05 22:40:28,153 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-05 22:40:28,155 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-05 22:40:28,178 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-05 22:40:28,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-05 22:40:28,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-05 22:40:28,180 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-05 22:40:28,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-05 22:40:28,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-05 22:40:28,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-05 22:40:28,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-05 22:40:28,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-05 22:40:28,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-05 22:40:28,187 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-05 22:40:28,188 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-05 22:40:28,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-05 22:40:28,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-05 22:40:28,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-05 22:40:28,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-05 22:40:28,199 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-05 22:40:28,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-05 22:40:28,201 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-05 22:40:28,202 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-05 22:40:28,203 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-05 22:40:28,206 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-05 22:40:28,206 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-05 22:40:28,206 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-05 22:40:28,207 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-05 22:40:28,207 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-05 22:40:28,208 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-05 22:40:28,209 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-05 22:40:28,209 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-05 22:40:28,210 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-05 22:40:28,211 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-05 22:40:28,212 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-05 22:40:28,212 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-05 22:40:28,213 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-05 22:40:28,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-05 22:40:28,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-05 22:40:28,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-05 22:40:28,214 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-05 22:40:28,215 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-10-05 22:40:28,237 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-05 22:40:28,238 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-05 22:40:28,239 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-05 22:40:28,239 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-05 22:40:28,239 INFO L138 SettingsManager]: * Use SBE=true [2020-10-05 22:40:28,239 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-05 22:40:28,240 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-05 22:40:28,240 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-05 22:40:28,240 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-05 22:40:28,240 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-05 22:40:28,240 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-05 22:40:28,241 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-05 22:40:28,241 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-05 22:40:28,241 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-05 22:40:28,241 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-05 22:40:28,241 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-05 22:40:28,242 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-05 22:40:28,242 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-05 22:40:28,242 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-05 22:40:28,242 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-05 22:40:28,242 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-05 22:40:28,243 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:40:28,243 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-05 22:40:28,243 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-10-05 22:40:28,243 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-05 22:40:28,243 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-05 22:40:28,244 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-05 22:40:28,244 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-05 22:40:28,244 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-05 22:40:28,244 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-10-05 22:40:28,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-05 22:40:28,535 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-05 22:40:28,540 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-05 22:40:28,541 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-05 22:40:28,543 INFO L275 PluginConnector]: CDTParser initialized [2020-10-05 22:40:28,544 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix026_tso.opt.i [2020-10-05 22:40:28,602 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5986a1f86/89490b9c522742d994b6c95034c09621/FLAG404244fe5 [2020-10-05 22:40:29,067 INFO L306 CDTParser]: Found 1 translation units. [2020-10-05 22:40:29,067 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix026_tso.opt.i [2020-10-05 22:40:29,089 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5986a1f86/89490b9c522742d994b6c95034c09621/FLAG404244fe5 [2020-10-05 22:40:29,346 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5986a1f86/89490b9c522742d994b6c95034c09621 [2020-10-05 22:40:29,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-05 22:40:29,355 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-05 22:40:29,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-05 22:40:29,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-05 22:40:29,362 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-05 22:40:29,363 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:40:29" (1/1) ... [2020-10-05 22:40:29,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@438122df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:29, skipping insertion in model container [2020-10-05 22:40:29,366 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 10:40:29" (1/1) ... [2020-10-05 22:40:29,376 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-05 22:40:29,444 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-05 22:40:29,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:40:29,979 INFO L203 MainTranslator]: Completed pre-run [2020-10-05 22:40:30,037 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-05 22:40:30,110 INFO L208 MainTranslator]: Completed translation [2020-10-05 22:40:30,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30 WrapperNode [2020-10-05 22:40:30,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-05 22:40:30,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-05 22:40:30,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-05 22:40:30,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-05 22:40:30,121 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-05 22:40:30,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-05 22:40:30,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-05 22:40:30,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-05 22:40:30,182 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,182 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,188 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,200 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,205 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... [2020-10-05 22:40:30,215 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-05 22:40:30,215 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-05 22:40:30,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-05 22:40:30,216 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-05 22:40:30,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-05 22:40:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-05 22:40:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-05 22:40:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-05 22:40:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-05 22:40:30,289 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-05 22:40:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-05 22:40:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-05 22:40:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-05 22:40:30,290 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-05 22:40:30,290 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-05 22:40:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2020-10-05 22:40:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2020-10-05 22:40:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-05 22:40:30,291 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-05 22:40:30,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-05 22:40:30,293 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-05 22:40:32,375 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-05 22:40:32,375 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-05 22:40:32,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:32 BoogieIcfgContainer [2020-10-05 22:40:32,377 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-05 22:40:32,379 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-05 22:40:32,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-05 22:40:32,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-05 22:40:32,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 10:40:29" (1/3) ... [2020-10-05 22:40:32,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afca529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:40:32, skipping insertion in model container [2020-10-05 22:40:32,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 10:40:30" (2/3) ... [2020-10-05 22:40:32,384 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6afca529 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 10:40:32, skipping insertion in model container [2020-10-05 22:40:32,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 10:40:32" (3/3) ... [2020-10-05 22:40:32,385 INFO L109 eAbstractionObserver]: Analyzing ICFG mix026_tso.opt.i [2020-10-05 22:40:32,396 WARN L146 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-05 22:40:32,396 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-10-05 22:40:32,403 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-05 22:40:32,404 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-05 22:40:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,437 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,438 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,438 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,439 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,440 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,441 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,442 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,443 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,444 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,445 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,447 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,447 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,448 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,448 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,448 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,448 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,449 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,449 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,450 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,451 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,451 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,451 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,452 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,452 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,453 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,454 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,454 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,454 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,454 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,455 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,456 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,460 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,461 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,461 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,462 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,463 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,463 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,464 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,465 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,466 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,470 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,470 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,471 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,471 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,472 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,474 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,475 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,475 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,476 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,477 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,477 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,478 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,478 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-05 22:40:32,493 INFO L251 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2020-10-05 22:40:32,513 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-10-05 22:40:32,513 INFO L376 AbstractCegarLoop]: Hoare is true [2020-10-05 22:40:32,513 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-10-05 22:40:32,513 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-05 22:40:32,514 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-05 22:40:32,514 INFO L380 AbstractCegarLoop]: Difference is false [2020-10-05 22:40:32,514 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-05 22:40:32,514 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-05 22:40:32,529 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 123 places, 112 transitions, 244 flow [2020-10-05 22:40:32,531 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-05 22:40:32,580 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-05 22:40:32,581 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:40:32,586 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 22:40:32,591 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 123 places, 112 transitions, 244 flow [2020-10-05 22:40:32,617 INFO L129 PetriNetUnfolder]: 2/108 cut-off events. [2020-10-05 22:40:32,617 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-05 22:40:32,618 INFO L80 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 108 events. 2/108 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/104 useless extension candidates. Maximal degree in co-relation 75. Up to 2 conditions per place. [2020-10-05 22:40:32,621 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 2580 [2020-10-05 22:40:32,622 INFO L170 etLargeBlockEncoding]: Semantic Check. [2020-10-05 22:40:32,753 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:32,753 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:32,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:32,755 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:32,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:32,760 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:32,764 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:32,764 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:32,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:32,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:32,790 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:32,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:32,793 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:32,794 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:32,797 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:32,797 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,204 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 58 [2020-10-05 22:40:33,318 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:33,319 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,433 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,434 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,435 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,436 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,438 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,439 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,442 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,442 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,461 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,462 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,463 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,463 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,466 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,466 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,469 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,469 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,500 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,501 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,502 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,502 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,505 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,505 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,507 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,524 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,524 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,525 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,531 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,531 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,602 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:40:33,605 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:33,606 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,645 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,646 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:33,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,653 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:33,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,655 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:33,658 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:33,658 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,660 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,660 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,662 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,662 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,733 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,734 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,735 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,735 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,737 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,737 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,739 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,740 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,755 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,756 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,756 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,757 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,759 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,759 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,761 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,761 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,799 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,800 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,802 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,802 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:33,804 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,804 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:33,805 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,806 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:33,807 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:33,808 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,809 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,810 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,811 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,847 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:33,848 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2020-10-05 22:40:33,850 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[9, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:33,850 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:33,935 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,935 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,938 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,940 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,940 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,957 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,958 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,959 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,959 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:33,961 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:33,961 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:33,963 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:33,963 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:34,161 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:34,162 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,162 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:34,163 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,164 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:34,165 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:34,166 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:34,166 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:34,181 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:34,182 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,182 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:34,183 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,184 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:34,185 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:34,186 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:34,187 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:34,306 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:34,306 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,327 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:34,327 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,349 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:34,350 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:34,351 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,352 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:34,352 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,353 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:34,599 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,599 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:40:34,601 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:34,602 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,630 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:34,631 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,644 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,645 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:34,646 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,647 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:34,648 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,649 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:34,651 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:34,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:34,653 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,654 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:34,655 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 2, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:34,656 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:34,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:34,788 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:34,936 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:34,936 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,002 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:35,003 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,004 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 4, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,004 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,005 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 4, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,005 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,104 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,105 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,105 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,106 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,107 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,107 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,109 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,109 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,119 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,121 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,121 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,122 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,123 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,124 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,125 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,355 WARN L193 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2020-10-05 22:40:35,508 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,508 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,509 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,510 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,513 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,513 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,515 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,515 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,526 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,526 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,527 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,527 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,528 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,529 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,530 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,530 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,652 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 2, 1] term [2020-10-05 22:40:35,652 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,711 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,711 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,713 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,713 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:35,714 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,715 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:35,715 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,716 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:35,717 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:35,717 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,718 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,718 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,719 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,720 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,747 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:35,747 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:40:35,749 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:35,749 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,774 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,774 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,775 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,775 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,776 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,777 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,778 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,778 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,788 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,789 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,789 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,790 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,791 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,791 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,792 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,922 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,922 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,923 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,923 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,924 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,925 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,926 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,926 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:35,938 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,939 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,939 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:35,941 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[4, 2, 3, 2, 3, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:35,941 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:35,942 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 3, 2, 1] term [2020-10-05 22:40:35,943 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-05 22:40:36,588 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:36,588 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-05 22:40:36,590 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[7, 2, 5, 3, 5, 3, 3, 2, 1] term [2020-10-05 22:40:36,590 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:36,614 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[2, 2, 3, 2, 3, 2, 1] term [2020-10-05 22:40:36,615 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-05 22:40:36,620 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:36,621 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:36,621 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:36,622 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:36,622 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[5, 2, 3, 2, 4, 3, 3, 2, 1] term [2020-10-05 22:40:36,623 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2020-10-05 22:40:36,625 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[8, 2, 4, 2, 5, 3, 3, 2, 1] term [2020-10-05 22:40:36,625 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:36,626 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:36,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:36,628 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 3, 5, 3, 6, 3, 4, 3, 4, 3, 3, 2, 1] term [2020-10-05 22:40:36,628 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-05 22:40:36,937 WARN L193 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2020-10-05 22:40:37,056 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 95 [2020-10-05 22:40:37,232 INFO L206 etLargeBlockEncoding]: Checked pairs total: 6694 [2020-10-05 22:40:37,233 INFO L214 etLargeBlockEncoding]: Total number of compositions: 87 [2020-10-05 22:40:37,237 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 33 transitions, 86 flow [2020-10-05 22:40:37,443 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 3898 states. [2020-10-05 22:40:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 3898 states. [2020-10-05 22:40:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-05 22:40:37,452 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:37,453 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-05 22:40:37,454 INFO L427 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:37,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:37,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1058342579, now seen corresponding path program 1 times [2020-10-05 22:40:37,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:37,472 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565562162] [2020-10-05 22:40:37,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:37,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:37,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:37,770 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565562162] [2020-10-05 22:40:37,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:37,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:40:37,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96432412] [2020-10-05 22:40:37,776 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:40:37,776 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:37,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:40:37,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:37,793 INFO L87 Difference]: Start difference. First operand 3898 states. Second operand 3 states. [2020-10-05 22:40:37,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:37,920 INFO L93 Difference]: Finished difference Result 3250 states and 12738 transitions. [2020-10-05 22:40:37,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:40:37,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-05 22:40:37,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:37,971 INFO L225 Difference]: With dead ends: 3250 [2020-10-05 22:40:37,971 INFO L226 Difference]: Without dead ends: 2650 [2020-10-05 22:40:37,972 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:38,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2020-10-05 22:40:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2650. [2020-10-05 22:40:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2650 states. [2020-10-05 22:40:38,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2650 states to 2650 states and 10228 transitions. [2020-10-05 22:40:38,138 INFO L78 Accepts]: Start accepts. Automaton has 2650 states and 10228 transitions. Word has length 5 [2020-10-05 22:40:38,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:38,139 INFO L479 AbstractCegarLoop]: Abstraction has 2650 states and 10228 transitions. [2020-10-05 22:40:38,139 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:40:38,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2650 states and 10228 transitions. [2020-10-05 22:40:38,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-05 22:40:38,142 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:38,142 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:38,142 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-05 22:40:38,142 INFO L427 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:38,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:38,143 INFO L82 PathProgramCache]: Analyzing trace with hash 1977612226, now seen corresponding path program 1 times [2020-10-05 22:40:38,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:38,143 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555654804] [2020-10-05 22:40:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:38,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:38,222 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555654804] [2020-10-05 22:40:38,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:38,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-05 22:40:38,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841633516] [2020-10-05 22:40:38,224 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:40:38,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:38,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:40:38,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:38,225 INFO L87 Difference]: Start difference. First operand 2650 states and 10228 transitions. Second operand 3 states. [2020-10-05 22:40:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:38,258 INFO L93 Difference]: Finished difference Result 2450 states and 9358 transitions. [2020-10-05 22:40:38,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:40:38,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2020-10-05 22:40:38,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:38,279 INFO L225 Difference]: With dead ends: 2450 [2020-10-05 22:40:38,279 INFO L226 Difference]: Without dead ends: 2450 [2020-10-05 22:40:38,280 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2450 states. [2020-10-05 22:40:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2450 to 2450. [2020-10-05 22:40:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2450 states. [2020-10-05 22:40:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2450 states to 2450 states and 9358 transitions. [2020-10-05 22:40:38,364 INFO L78 Accepts]: Start accepts. Automaton has 2450 states and 9358 transitions. Word has length 11 [2020-10-05 22:40:38,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:38,365 INFO L479 AbstractCegarLoop]: Abstraction has 2450 states and 9358 transitions. [2020-10-05 22:40:38,365 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:40:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 2450 states and 9358 transitions. [2020-10-05 22:40:38,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-05 22:40:38,369 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:38,369 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:38,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-05 22:40:38,370 INFO L427 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:38,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:38,370 INFO L82 PathProgramCache]: Analyzing trace with hash 2105541718, now seen corresponding path program 1 times [2020-10-05 22:40:38,370 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:38,371 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666742455] [2020-10-05 22:40:38,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:38,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:38,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:38,495 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666742455] [2020-10-05 22:40:38,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:38,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:40:38,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686963991] [2020-10-05 22:40:38,497 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:40:38,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:38,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:40:38,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:40:38,497 INFO L87 Difference]: Start difference. First operand 2450 states and 9358 transitions. Second operand 4 states. [2020-10-05 22:40:38,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:38,560 INFO L93 Difference]: Finished difference Result 2426 states and 8388 transitions. [2020-10-05 22:40:38,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:40:38,561 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-05 22:40:38,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:38,574 INFO L225 Difference]: With dead ends: 2426 [2020-10-05 22:40:38,574 INFO L226 Difference]: Without dead ends: 1826 [2020-10-05 22:40:38,575 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:40:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1826 states. [2020-10-05 22:40:38,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1826 to 1826. [2020-10-05 22:40:38,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1826 states. [2020-10-05 22:40:38,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1826 states to 1826 states and 6238 transitions. [2020-10-05 22:40:38,630 INFO L78 Accepts]: Start accepts. Automaton has 1826 states and 6238 transitions. Word has length 13 [2020-10-05 22:40:38,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:38,631 INFO L479 AbstractCegarLoop]: Abstraction has 1826 states and 6238 transitions. [2020-10-05 22:40:38,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:40:38,631 INFO L276 IsEmpty]: Start isEmpty. Operand 1826 states and 6238 transitions. [2020-10-05 22:40:38,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-05 22:40:38,633 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:38,634 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:38,634 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-05 22:40:38,634 INFO L427 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:38,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:38,634 INFO L82 PathProgramCache]: Analyzing trace with hash -630305857, now seen corresponding path program 1 times [2020-10-05 22:40:38,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:38,635 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900301769] [2020-10-05 22:40:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:38,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:38,826 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900301769] [2020-10-05 22:40:38,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:38,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:40:38,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915795948] [2020-10-05 22:40:38,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:40:38,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:38,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:40:38,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:40:38,831 INFO L87 Difference]: Start difference. First operand 1826 states and 6238 transitions. Second operand 5 states. [2020-10-05 22:40:38,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:38,899 INFO L93 Difference]: Finished difference Result 1522 states and 4780 transitions. [2020-10-05 22:40:38,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-05 22:40:38,900 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-05 22:40:38,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:38,909 INFO L225 Difference]: With dead ends: 1522 [2020-10-05 22:40:38,909 INFO L226 Difference]: Without dead ends: 1162 [2020-10-05 22:40:38,910 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:40:38,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1162 states. [2020-10-05 22:40:38,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1162 to 1162. [2020-10-05 22:40:38,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-10-05 22:40:38,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3582 transitions. [2020-10-05 22:40:38,942 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3582 transitions. Word has length 16 [2020-10-05 22:40:38,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:38,942 INFO L479 AbstractCegarLoop]: Abstraction has 1162 states and 3582 transitions. [2020-10-05 22:40:38,942 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:40:38,943 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3582 transitions. [2020-10-05 22:40:38,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:40:38,946 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:38,946 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:38,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-05 22:40:38,946 INFO L427 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:38,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1434489172, now seen corresponding path program 1 times [2020-10-05 22:40:38,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:38,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488361258] [2020-10-05 22:40:38,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:39,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:39,049 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488361258] [2020-10-05 22:40:39,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:39,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-05 22:40:39,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570815496] [2020-10-05 22:40:39,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-05 22:40:39,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-05 22:40:39,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-05 22:40:39,051 INFO L87 Difference]: Start difference. First operand 1162 states and 3582 transitions. Second operand 4 states. [2020-10-05 22:40:39,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:39,075 INFO L93 Difference]: Finished difference Result 1550 states and 4656 transitions. [2020-10-05 22:40:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-05 22:40:39,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2020-10-05 22:40:39,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:39,084 INFO L225 Difference]: With dead ends: 1550 [2020-10-05 22:40:39,085 INFO L226 Difference]: Without dead ends: 1195 [2020-10-05 22:40:39,085 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:40:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1195 states. [2020-10-05 22:40:39,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1195 to 1162. [2020-10-05 22:40:39,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1162 states. [2020-10-05 22:40:39,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1162 states to 1162 states and 3485 transitions. [2020-10-05 22:40:39,123 INFO L78 Accepts]: Start accepts. Automaton has 1162 states and 3485 transitions. Word has length 19 [2020-10-05 22:40:39,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:39,123 INFO L479 AbstractCegarLoop]: Abstraction has 1162 states and 3485 transitions. [2020-10-05 22:40:39,123 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-05 22:40:39,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1162 states and 3485 transitions. [2020-10-05 22:40:39,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-10-05 22:40:39,126 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:39,127 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:39,127 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-05 22:40:39,127 INFO L427 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:39,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:39,127 INFO L82 PathProgramCache]: Analyzing trace with hash 237267546, now seen corresponding path program 2 times [2020-10-05 22:40:39,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:39,128 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264760475] [2020-10-05 22:40:39,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:39,272 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:39,272 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264760475] [2020-10-05 22:40:39,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:39,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:40:39,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623973581] [2020-10-05 22:40:39,273 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-05 22:40:39,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:39,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-05 22:40:39,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:40:39,274 INFO L87 Difference]: Start difference. First operand 1162 states and 3485 transitions. Second operand 6 states. [2020-10-05 22:40:39,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:39,342 INFO L93 Difference]: Finished difference Result 1011 states and 3006 transitions. [2020-10-05 22:40:39,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:40:39,343 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2020-10-05 22:40:39,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:39,349 INFO L225 Difference]: With dead ends: 1011 [2020-10-05 22:40:39,349 INFO L226 Difference]: Without dead ends: 899 [2020-10-05 22:40:39,350 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:40:39,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2020-10-05 22:40:39,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2020-10-05 22:40:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 899 states. [2020-10-05 22:40:39,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 2716 transitions. [2020-10-05 22:40:39,373 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 2716 transitions. Word has length 19 [2020-10-05 22:40:39,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:39,373 INFO L479 AbstractCegarLoop]: Abstraction has 899 states and 2716 transitions. [2020-10-05 22:40:39,373 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-05 22:40:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 2716 transitions. [2020-10-05 22:40:39,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:40:39,376 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:39,376 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:39,376 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-05 22:40:39,376 INFO L427 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:39,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:39,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1182410003, now seen corresponding path program 1 times [2020-10-05 22:40:39,377 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:39,377 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442157936] [2020-10-05 22:40:39,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:39,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:39,548 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442157936] [2020-10-05 22:40:39,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:39,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-05 22:40:39,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247889431] [2020-10-05 22:40:39,549 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-05 22:40:39,549 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:39,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-05 22:40:39,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-05 22:40:39,551 INFO L87 Difference]: Start difference. First operand 899 states and 2716 transitions. Second operand 5 states. [2020-10-05 22:40:39,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:39,706 INFO L93 Difference]: Finished difference Result 1727 states and 4958 transitions. [2020-10-05 22:40:39,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:40:39,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-10-05 22:40:39,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:39,715 INFO L225 Difference]: With dead ends: 1727 [2020-10-05 22:40:39,715 INFO L226 Difference]: Without dead ends: 1415 [2020-10-05 22:40:39,716 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-05 22:40:39,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2020-10-05 22:40:39,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1057. [2020-10-05 22:40:39,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1057 states. [2020-10-05 22:40:39,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1057 states to 1057 states and 3119 transitions. [2020-10-05 22:40:39,749 INFO L78 Accepts]: Start accepts. Automaton has 1057 states and 3119 transitions. Word has length 23 [2020-10-05 22:40:39,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:39,749 INFO L479 AbstractCegarLoop]: Abstraction has 1057 states and 3119 transitions. [2020-10-05 22:40:39,750 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-05 22:40:39,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1057 states and 3119 transitions. [2020-10-05 22:40:39,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:40:39,753 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:39,753 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:39,753 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-05 22:40:39,754 INFO L427 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:39,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:39,754 INFO L82 PathProgramCache]: Analyzing trace with hash 1391835003, now seen corresponding path program 2 times [2020-10-05 22:40:39,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:39,754 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723064619] [2020-10-05 22:40:39,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:39,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:40,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:40,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723064619] [2020-10-05 22:40:40,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:40,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-10-05 22:40:40,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040909911] [2020-10-05 22:40:40,228 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-10-05 22:40:40,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:40,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-05 22:40:40,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:40:40,229 INFO L87 Difference]: Start difference. First operand 1057 states and 3119 transitions. Second operand 11 states. [2020-10-05 22:40:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:40,775 INFO L93 Difference]: Finished difference Result 1312 states and 3810 transitions. [2020-10-05 22:40:40,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-10-05 22:40:40,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 23 [2020-10-05 22:40:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:40,785 INFO L225 Difference]: With dead ends: 1312 [2020-10-05 22:40:40,785 INFO L226 Difference]: Without dead ends: 1197 [2020-10-05 22:40:40,785 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2020-10-05 22:40:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1197 states. [2020-10-05 22:40:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1197 to 1118. [2020-10-05 22:40:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1118 states. [2020-10-05 22:40:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 3280 transitions. [2020-10-05 22:40:40,827 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 3280 transitions. Word has length 23 [2020-10-05 22:40:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:40,827 INFO L479 AbstractCegarLoop]: Abstraction has 1118 states and 3280 transitions. [2020-10-05 22:40:40,827 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-10-05 22:40:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 3280 transitions. [2020-10-05 22:40:40,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:40:40,831 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:40,831 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:40,831 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-05 22:40:40,831 INFO L427 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:40,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:40,832 INFO L82 PathProgramCache]: Analyzing trace with hash -187980553, now seen corresponding path program 3 times [2020-10-05 22:40:40,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:40,838 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555624138] [2020-10-05 22:40:40,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:41,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555624138] [2020-10-05 22:40:41,143 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:41,143 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-05 22:40:41,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112410957] [2020-10-05 22:40:41,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:40:41,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:40:41,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:40:41,145 INFO L87 Difference]: Start difference. First operand 1118 states and 3280 transitions. Second operand 7 states. [2020-10-05 22:40:41,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:41,346 INFO L93 Difference]: Finished difference Result 1562 states and 4445 transitions. [2020-10-05 22:40:41,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:40:41,346 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 22:40:41,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:41,356 INFO L225 Difference]: With dead ends: 1562 [2020-10-05 22:40:41,356 INFO L226 Difference]: Without dead ends: 1510 [2020-10-05 22:40:41,357 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:40:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2020-10-05 22:40:41,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1053. [2020-10-05 22:40:41,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2020-10-05 22:40:41,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 3084 transitions. [2020-10-05 22:40:41,391 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 3084 transitions. Word has length 23 [2020-10-05 22:40:41,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:41,391 INFO L479 AbstractCegarLoop]: Abstraction has 1053 states and 3084 transitions. [2020-10-05 22:40:41,391 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:40:41,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 3084 transitions. [2020-10-05 22:40:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-10-05 22:40:41,395 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:41,395 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:41,395 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-05 22:40:41,395 INFO L427 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:41,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -278622975, now seen corresponding path program 4 times [2020-10-05 22:40:41,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:41,396 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063446638] [2020-10-05 22:40:41,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:41,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:41,493 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063446638] [2020-10-05 22:40:41,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:41,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:40:41,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273564788] [2020-10-05 22:40:41,494 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-05 22:40:41,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:41,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-05 22:40:41,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-10-05 22:40:41,494 INFO L87 Difference]: Start difference. First operand 1053 states and 3084 transitions. Second operand 7 states. [2020-10-05 22:40:41,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:41,570 INFO L93 Difference]: Finished difference Result 1024 states and 3023 transitions. [2020-10-05 22:40:41,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-05 22:40:41,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-10-05 22:40:41,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:41,573 INFO L225 Difference]: With dead ends: 1024 [2020-10-05 22:40:41,574 INFO L226 Difference]: Without dead ends: 515 [2020-10-05 22:40:41,574 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2020-10-05 22:40:41,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2020-10-05 22:40:41,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 515. [2020-10-05 22:40:41,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2020-10-05 22:40:41,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 1415 transitions. [2020-10-05 22:40:41,587 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 1415 transitions. Word has length 23 [2020-10-05 22:40:41,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:41,587 INFO L479 AbstractCegarLoop]: Abstraction has 515 states and 1415 transitions. [2020-10-05 22:40:41,587 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-05 22:40:41,588 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 1415 transitions. [2020-10-05 22:40:41,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:40:41,589 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:41,590 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:41,590 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-05 22:40:41,590 INFO L427 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:41,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:41,590 INFO L82 PathProgramCache]: Analyzing trace with hash 118425235, now seen corresponding path program 1 times [2020-10-05 22:40:41,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:41,591 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36526600] [2020-10-05 22:40:41,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:41,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:41,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:41,641 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36526600] [2020-10-05 22:40:41,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:41,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-05 22:40:41,641 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610192133] [2020-10-05 22:40:41,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-05 22:40:41,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:41,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-05 22:40:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:41,642 INFO L87 Difference]: Start difference. First operand 515 states and 1415 transitions. Second operand 3 states. [2020-10-05 22:40:41,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:41,653 INFO L93 Difference]: Finished difference Result 779 states and 2137 transitions. [2020-10-05 22:40:41,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-05 22:40:41,654 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2020-10-05 22:40:41,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:41,656 INFO L225 Difference]: With dead ends: 779 [2020-10-05 22:40:41,656 INFO L226 Difference]: Without dead ends: 375 [2020-10-05 22:40:41,656 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-05 22:40:41,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2020-10-05 22:40:41,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2020-10-05 22:40:41,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2020-10-05 22:40:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 975 transitions. [2020-10-05 22:40:41,665 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 975 transitions. Word has length 27 [2020-10-05 22:40:41,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:41,665 INFO L479 AbstractCegarLoop]: Abstraction has 375 states and 975 transitions. [2020-10-05 22:40:41,665 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-05 22:40:41,666 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 975 transitions. [2020-10-05 22:40:41,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:40:41,667 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:41,667 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:41,667 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-05 22:40:41,667 INFO L427 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:41,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:41,668 INFO L82 PathProgramCache]: Analyzing trace with hash 1966836115, now seen corresponding path program 2 times [2020-10-05 22:40:41,668 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:41,668 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169960684] [2020-10-05 22:40:41,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-05 22:40:41,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-05 22:40:41,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169960684] [2020-10-05 22:40:41,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-05 22:40:41,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-10-05 22:40:41,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879673095] [2020-10-05 22:40:41,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-10-05 22:40:41,953 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-05 22:40:41,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-05 22:40:41,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-10-05 22:40:41,953 INFO L87 Difference]: Start difference. First operand 375 states and 975 transitions. Second operand 8 states. [2020-10-05 22:40:42,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-05 22:40:42,131 INFO L93 Difference]: Finished difference Result 534 states and 1355 transitions. [2020-10-05 22:40:42,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-05 22:40:42,131 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2020-10-05 22:40:42,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-05 22:40:42,134 INFO L225 Difference]: With dead ends: 534 [2020-10-05 22:40:42,134 INFO L226 Difference]: Without dead ends: 423 [2020-10-05 22:40:42,134 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2020-10-05 22:40:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2020-10-05 22:40:42,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 332. [2020-10-05 22:40:42,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2020-10-05 22:40:42,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 863 transitions. [2020-10-05 22:40:42,143 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 863 transitions. Word has length 27 [2020-10-05 22:40:42,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-05 22:40:42,143 INFO L479 AbstractCegarLoop]: Abstraction has 332 states and 863 transitions. [2020-10-05 22:40:42,143 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-10-05 22:40:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 863 transitions. [2020-10-05 22:40:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-10-05 22:40:42,144 INFO L414 BasicCegarLoop]: Found error trace [2020-10-05 22:40:42,144 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-05 22:40:42,145 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-05 22:40:42,145 INFO L427 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-05 22:40:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-05 22:40:42,145 INFO L82 PathProgramCache]: Analyzing trace with hash 917301029, now seen corresponding path program 3 times [2020-10-05 22:40:42,145 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-05 22:40:42,145 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649604325] [2020-10-05 22:40:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-05 22:40:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:40:42,194 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:40:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-05 22:40:42,256 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-05 22:40:42,291 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-05 22:40:42,291 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-10-05 22:40:42,292 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-05 22:40:42,292 WARN L633 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-05 22:40:42,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L4-->L869: Formula: (let ((.cse6 (= (mod ~x$w_buff0_used~0_In574250225 256) 0)) (.cse7 (= (mod ~x$r_buff0_thd0~0_In574250225 256) 0)) (.cse9 (= (mod ~x$w_buff1_used~0_In574250225 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In574250225 256) 0))) (let ((.cse2 (or .cse9 .cse8)) (.cse0 (not .cse9)) (.cse1 (not .cse8)) (.cse5 (or .cse6 .cse7)) (.cse3 (not .cse7)) (.cse4 (not .cse6))) (and (= ~x$r_buff1_thd0~0_In574250225 ~x$r_buff1_thd0~0_Out574250225) (= ~x$r_buff0_thd0~0_In574250225 ~x$r_buff0_thd0~0_Out574250225) (or (and (= ~x$w_buff1_used~0_Out574250225 0) .cse0 .cse1) (and (= ~x$w_buff1_used~0_Out574250225 ~x$w_buff1_used~0_In574250225) .cse2)) (or (and .cse3 (= ~x~0_Out574250225 ~x$w_buff0~0_In574250225) .cse4) (and (or (and (= ~x~0_Out574250225 ~x~0_In574250225) .cse2) (and (= ~x$w_buff1~0_In574250225 ~x~0_Out574250225) .cse0 .cse1)) .cse5)) (or (and (= ~x$w_buff0_used~0_Out574250225 ~x$w_buff0_used~0_In574250225) .cse5) (and (= ~x$w_buff0_used~0_Out574250225 0) .cse3 .cse4)) (not (= ULTIMATE.start_assume_abort_if_not_~cond_In574250225 0))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In574250225, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574250225, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In574250225, ~x$w_buff1~0=~x$w_buff1~0_In574250225, ~x$w_buff1_used~0=~x$w_buff1_used~0_In574250225, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In574250225, ~x~0=~x~0_In574250225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574250225} OutVars{~x$w_buff0~0=~x$w_buff0~0_In574250225, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out574250225, ~x$w_buff1~0=~x$w_buff1~0_In574250225, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out574250225|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out574250225, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out574250225|, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out574250225|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out574250225, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out574250225, ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out574250225|, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out574250225|, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out574250225|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_In574250225, ~x~0=~x~0_Out574250225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite47, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite48, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0] because there is no mapped edge [2020-10-05 22:40:42,317 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,317 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,320 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,320 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,321 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,321 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,322 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,322 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,323 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,323 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,324 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,324 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,325 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,325 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,326 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,326 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,327 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,327 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,328 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,328 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,328 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,328 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,329 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,329 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,330 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,330 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,330 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,330 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,331 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-05 22:40:42,331 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-05 22:40:42,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 10:40:42 BasicIcfg [2020-10-05 22:40:42,420 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-05 22:40:42,423 INFO L168 Benchmark]: Toolchain (without parser) took 13067.54 ms. Allocated memory was 147.3 MB in the beginning and 442.5 MB in the end (delta: 295.2 MB). Free memory was 102.2 MB in the beginning and 123.9 MB in the end (delta: -21.7 MB). Peak memory consumption was 273.5 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,423 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,426 INFO L168 Benchmark]: CACSL2BoogieTranslator took 754.64 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.2 MB in the beginning and 158.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,427 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.76 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,427 INFO L168 Benchmark]: Boogie Preprocessor took 41.63 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,428 INFO L168 Benchmark]: RCFGBuilder took 2161.95 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 153.2 MB in the beginning and 169.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,429 INFO L168 Benchmark]: TraceAbstraction took 10041.94 ms. Allocated memory was 246.9 MB in the beginning and 442.5 MB in the end (delta: 195.6 MB). Free memory was 169.2 MB in the beginning and 123.9 MB in the end (delta: 45.4 MB). Peak memory consumption was 240.9 MB. Max. memory is 7.1 GB. [2020-10-05 22:40:42,438 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 147.3 MB. Free memory was 122.0 MB in the beginning and 121.6 MB in the end (delta: 419.7 kB). Peak memory consumption was 419.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 754.64 ms. Allocated memory was 147.3 MB in the beginning and 203.9 MB in the end (delta: 56.6 MB). Free memory was 102.2 MB in the beginning and 158.1 MB in the end (delta: -55.9 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.76 ms. Allocated memory is still 203.9 MB. Free memory was 158.1 MB in the beginning and 155.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.63 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 153.2 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2161.95 ms. Allocated memory was 203.9 MB in the beginning and 246.9 MB in the end (delta: 43.0 MB). Free memory was 153.2 MB in the beginning and 169.2 MB in the end (delta: -16.0 MB). Peak memory consumption was 102.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10041.94 ms. Allocated memory was 246.9 MB in the beginning and 442.5 MB in the end (delta: 195.6 MB). Free memory was 169.2 MB in the beginning and 123.9 MB in the end (delta: 45.4 MB). Peak memory consumption was 240.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.7s, 123 ProgramPointsBefore, 46 ProgramPointsAfterwards, 112 TransitionsBefore, 33 TransitionsAfterwards, 2580 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 1264 VarBasedMoverChecksPositive, 54 VarBasedMoverChecksNegative, 3 SemBasedMoverChecksPositive, 75 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 6694 CheckedPairsTotal, 87 TotalNumberOfCompositions - CounterExampleResult [Line: 8]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L700] 0 int __unbuffered_cnt = 0; [L702] 0 int __unbuffered_p0_EAX = 0; [L704] 0 int __unbuffered_p1_EAX = 0; [L706] 0 int __unbuffered_p3_EAX = 0; [L708] 0 int __unbuffered_p3_EBX = 0; [L710] 0 int a = 0; [L711] 0 _Bool main$tmp_guard0; [L712] 0 _Bool main$tmp_guard1; [L714] 0 int x = 0; [L715] 0 _Bool x$flush_delayed; [L716] 0 int x$mem_tmp; [L717] 0 _Bool x$r_buff0_thd0; [L718] 0 _Bool x$r_buff0_thd1; [L719] 0 _Bool x$r_buff0_thd2; [L720] 0 _Bool x$r_buff0_thd3; [L721] 0 _Bool x$r_buff0_thd4; [L722] 0 _Bool x$r_buff1_thd0; [L723] 0 _Bool x$r_buff1_thd1; [L724] 0 _Bool x$r_buff1_thd2; [L725] 0 _Bool x$r_buff1_thd3; [L726] 0 _Bool x$r_buff1_thd4; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L851] 0 pthread_t t709; [L852] FCALL, FORK 0 pthread_create(&t709, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t710; [L854] FCALL, FORK 0 pthread_create(&t710, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 1 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L8] COND TRUE 2 !expression [L8] 2 __VERIFIER_error() [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t711; [L856] FCALL, FORK 0 pthread_create(&t711, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t712; [L858] FCALL, FORK 0 pthread_create(&t712, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L742] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L745] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L746] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L747] 1 x$flush_delayed = weak$$choice2 [L748] 1 x$mem_tmp = x [L749] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L749] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L750] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L750] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L751] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1) [L751] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L751] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L752] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L752] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L752] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used) [L752] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L752] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L753] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L753] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L754] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L754] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L755] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0 [L755] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0) [L755] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L755] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 __unbuffered_p0_EAX = x [L757] EXPR 1 x$flush_delayed ? x$mem_tmp : x [L757] 1 x = x$flush_delayed ? x$mem_tmp : x [L758] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L871] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L8] COND TRUE 0 !expression [L8] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=255, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 111 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.9s, HoareTripleCheckerStatistics: 467 SDtfs, 714 SDslu, 1205 SDs, 0 SdLazy, 601 SolverSat, 140 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3898occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1018 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 217 ConstructedInterpolants, 0 QuantifiedInterpolants, 37717 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...