./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix013_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix013_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 94a9764bcdaeb0b1da6f82a7a0c7542aa8f2e04e ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 17:13:40,598 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:13:40,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:13:40,607 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:13:40,607 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:13:40,608 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:13:40,609 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:13:40,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:13:40,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:13:40,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:13:40,612 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:13:40,613 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:13:40,613 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:13:40,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:13:40,615 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:13:40,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:13:40,616 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:13:40,616 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:13:40,618 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:13:40,619 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:13:40,620 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:13:40,621 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:13:40,622 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:13:40,622 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:13:40,624 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:13:40,624 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:13:40,624 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:13:40,624 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:13:40,625 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:13:40,625 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:13:40,625 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:13:40,626 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:13:40,626 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:13:40,626 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:13:40,627 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:13:40,627 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:13:40,628 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:13:40,628 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:13:40,628 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:13:40,628 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:13:40,629 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:13:40,629 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:13:40,639 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:13:40,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:13:40,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:13:40,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:13:40,640 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:13:40,640 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:13:40,640 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:13:40,640 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:13:40,640 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:13:40,640 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:13:40,641 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:13:40,642 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:13:40,642 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:13:40,642 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:13:40,642 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:13:40,642 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:13:40,642 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:13:40,642 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:13:40,642 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:13:40,643 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:13:40,643 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:13:40,643 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:13:40,643 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:13:40,643 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94a9764bcdaeb0b1da6f82a7a0c7542aa8f2e04e [2019-12-07 17:13:40,740 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:13:40,750 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:13:40,752 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:13:40,753 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:13:40,754 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:13:40,754 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix013_pso.opt.i [2019-12-07 17:13:40,797 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/data/7beaafc10/5b2c923cfc9540e194254fa56911acc5/FLAG823a5c8ac [2019-12-07 17:13:41,224 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:13:41,225 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/sv-benchmarks/c/pthread-wmm/mix013_pso.opt.i [2019-12-07 17:13:41,235 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/data/7beaafc10/5b2c923cfc9540e194254fa56911acc5/FLAG823a5c8ac [2019-12-07 17:13:41,580 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/data/7beaafc10/5b2c923cfc9540e194254fa56911acc5 [2019-12-07 17:13:41,583 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:13:41,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:13:41,586 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:13:41,586 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:13:41,590 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:13:41,591 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:13:41" (1/1) ... [2019-12-07 17:13:41,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:41, skipping insertion in model container [2019-12-07 17:13:41,595 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:13:41" (1/1) ... [2019-12-07 17:13:41,604 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:13:41,641 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:13:41,915 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:13:41,923 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:13:41,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:13:42,010 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:13:42,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42 WrapperNode [2019-12-07 17:13:42,010 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:13:42,011 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:13:42,011 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:13:42,011 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:13:42,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,029 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,050 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:13:42,050 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:13:42,050 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:13:42,050 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:13:42,056 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,056 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,060 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,071 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... [2019-12-07 17:13:42,077 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:13:42,077 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:13:42,077 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:13:42,077 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:13:42,078 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/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 [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:13:42,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:13:42,118 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:13:42,118 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:13:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:13:42,119 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 17:13:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 17:13:42,119 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:13:42,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:13:42,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:13:42,120 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 17:13:42,518 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:13:42,518 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:13:42,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:13:42 BoogieIcfgContainer [2019-12-07 17:13:42,519 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:13:42,520 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:13:42,520 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:13:42,521 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:13:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:13:41" (1/3) ... [2019-12-07 17:13:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a3810f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:13:42, skipping insertion in model container [2019-12-07 17:13:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:13:42" (2/3) ... [2019-12-07 17:13:42,522 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9a3810f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:13:42, skipping insertion in model container [2019-12-07 17:13:42,522 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:13:42" (3/3) ... [2019-12-07 17:13:42,523 INFO L109 eAbstractionObserver]: Analyzing ICFG mix013_pso.opt.i [2019-12-07 17:13:42,530 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:13:42,530 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:13:42,534 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:13:42,535 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:13:42,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,562 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,562 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,564 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,565 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,569 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,570 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,571 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,572 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,573 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,574 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,575 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,575 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,576 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,577 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,578 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,579 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,580 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,581 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,582 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,583 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,584 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,585 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,586 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,587 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:13:42,599 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 17:13:42,612 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:13:42,612 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:13:42,612 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:13:42,612 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:13:42,612 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:13:42,612 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:13:42,613 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:13:42,613 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:13:42,625 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 213 places, 256 transitions [2019-12-07 17:13:42,626 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 17:13:42,692 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 17:13:42,693 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:13:42,707 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:13:42,728 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 213 places, 256 transitions [2019-12-07 17:13:42,772 INFO L134 PetriNetUnfolder]: 56/252 cut-off events. [2019-12-07 17:13:42,773 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:13:42,782 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 252 events. 56/252 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 926 event pairs. 12/206 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 17:13:42,809 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 17:13:42,810 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:13:46,622 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-07 17:13:46,968 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2019-12-07 17:13:47,003 INFO L206 etLargeBlockEncoding]: Checked pairs total: 131114 [2019-12-07 17:13:47,003 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 17:13:47,005 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 17:13:56,172 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 97990 states. [2019-12-07 17:13:56,173 INFO L276 IsEmpty]: Start isEmpty. Operand 97990 states. [2019-12-07 17:13:56,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 17:13:56,178 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:13:56,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:13:56,179 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:13:56,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:13:56,183 INFO L82 PathProgramCache]: Analyzing trace with hash -904171455, now seen corresponding path program 1 times [2019-12-07 17:13:56,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:13:56,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7954943] [2019-12-07 17:13:56,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:13:56,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:13:56,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:13:56,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7954943] [2019-12-07 17:13:56,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:13:56,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:13:56,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107569046] [2019-12-07 17:13:56,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:13:56,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:13:56,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:13:56,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:13:56,431 INFO L87 Difference]: Start difference. First operand 97990 states. Second operand 3 states. [2019-12-07 17:13:57,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:13:57,153 INFO L93 Difference]: Finished difference Result 97126 states and 446136 transitions. [2019-12-07 17:13:57,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:13:57,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 17:13:57,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:13:57,684 INFO L225 Difference]: With dead ends: 97126 [2019-12-07 17:13:57,684 INFO L226 Difference]: Without dead ends: 90910 [2019-12-07 17:13:57,685 INFO L630 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 [2019-12-07 17:13:59,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90910 states. [2019-12-07 17:14:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90910 to 90910. [2019-12-07 17:14:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90910 states. [2019-12-07 17:14:02,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90910 states to 90910 states and 417332 transitions. [2019-12-07 17:14:02,910 INFO L78 Accepts]: Start accepts. Automaton has 90910 states and 417332 transitions. Word has length 9 [2019-12-07 17:14:02,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:02,911 INFO L462 AbstractCegarLoop]: Abstraction has 90910 states and 417332 transitions. [2019-12-07 17:14:02,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:14:02,911 INFO L276 IsEmpty]: Start isEmpty. Operand 90910 states and 417332 transitions. [2019-12-07 17:14:02,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 17:14:02,916 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:02,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:02,917 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:02,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:02,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1686431172, now seen corresponding path program 1 times [2019-12-07 17:14:02,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:02,917 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1184937887] [2019-12-07 17:14:02,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:02,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:02,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1184937887] [2019-12-07 17:14:02,974 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:02,974 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:14:02,974 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992569612] [2019-12-07 17:14:02,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:02,975 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:02,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:02,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:02,976 INFO L87 Difference]: Start difference. First operand 90910 states and 417332 transitions. Second operand 4 states. [2019-12-07 17:14:03,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:03,842 INFO L93 Difference]: Finished difference Result 140998 states and 625524 transitions. [2019-12-07 17:14:03,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:14:03,842 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 17:14:03,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:04,233 INFO L225 Difference]: With dead ends: 140998 [2019-12-07 17:14:04,233 INFO L226 Difference]: Without dead ends: 140930 [2019-12-07 17:14:04,234 INFO L630 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 [2019-12-07 17:14:06,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140930 states. [2019-12-07 17:14:08,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140930 to 137862. [2019-12-07 17:14:08,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137862 states. [2019-12-07 17:14:08,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137862 states to 137862 states and 614280 transitions. [2019-12-07 17:14:08,563 INFO L78 Accepts]: Start accepts. Automaton has 137862 states and 614280 transitions. Word has length 15 [2019-12-07 17:14:08,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:08,564 INFO L462 AbstractCegarLoop]: Abstraction has 137862 states and 614280 transitions. [2019-12-07 17:14:08,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:08,564 INFO L276 IsEmpty]: Start isEmpty. Operand 137862 states and 614280 transitions. [2019-12-07 17:14:08,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:14:08,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:08,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:08,570 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:08,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:08,570 INFO L82 PathProgramCache]: Analyzing trace with hash -806058920, now seen corresponding path program 1 times [2019-12-07 17:14:08,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:08,570 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738564739] [2019-12-07 17:14:08,570 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:08,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738564739] [2019-12-07 17:14:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:08,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:14:08,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935212465] [2019-12-07 17:14:08,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:08,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:08,615 INFO L87 Difference]: Start difference. First operand 137862 states and 614280 transitions. Second operand 4 states. [2019-12-07 17:14:09,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:09,799 INFO L93 Difference]: Finished difference Result 175654 states and 773028 transitions. [2019-12-07 17:14:09,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:14:09,799 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 17:14:09,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:10,257 INFO L225 Difference]: With dead ends: 175654 [2019-12-07 17:14:10,258 INFO L226 Difference]: Without dead ends: 175594 [2019-12-07 17:14:10,258 INFO L630 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 [2019-12-07 17:14:14,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175594 states. [2019-12-07 17:14:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175594 to 157746. [2019-12-07 17:14:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157746 states. [2019-12-07 17:14:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157746 states to 157746 states and 699816 transitions. [2019-12-07 17:14:17,044 INFO L78 Accepts]: Start accepts. Automaton has 157746 states and 699816 transitions. Word has length 18 [2019-12-07 17:14:17,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:17,044 INFO L462 AbstractCegarLoop]: Abstraction has 157746 states and 699816 transitions. [2019-12-07 17:14:17,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:17,044 INFO L276 IsEmpty]: Start isEmpty. Operand 157746 states and 699816 transitions. [2019-12-07 17:14:17,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 17:14:17,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:17,057 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:17,057 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:17,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:17,057 INFO L82 PathProgramCache]: Analyzing trace with hash 363406382, now seen corresponding path program 1 times [2019-12-07 17:14:17,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:17,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562261459] [2019-12-07 17:14:17,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:17,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:17,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562261459] [2019-12-07 17:14:17,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:17,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:14:17,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777392998] [2019-12-07 17:14:17,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:14:17,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:17,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:14:17,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:14:17,126 INFO L87 Difference]: Start difference. First operand 157746 states and 699816 transitions. Second operand 3 states. [2019-12-07 17:14:17,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:17,824 INFO L93 Difference]: Finished difference Result 155822 states and 688606 transitions. [2019-12-07 17:14:17,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:14:17,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 17:14:17,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:18,241 INFO L225 Difference]: With dead ends: 155822 [2019-12-07 17:14:18,242 INFO L226 Difference]: Without dead ends: 155822 [2019-12-07 17:14:18,242 INFO L630 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 [2019-12-07 17:14:20,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155822 states. [2019-12-07 17:14:22,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155822 to 155675. [2019-12-07 17:14:22,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155675 states. [2019-12-07 17:14:25,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155675 states to 155675 states and 688262 transitions. [2019-12-07 17:14:25,646 INFO L78 Accepts]: Start accepts. Automaton has 155675 states and 688262 transitions. Word has length 20 [2019-12-07 17:14:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:25,647 INFO L462 AbstractCegarLoop]: Abstraction has 155675 states and 688262 transitions. [2019-12-07 17:14:25,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:14:25,647 INFO L276 IsEmpty]: Start isEmpty. Operand 155675 states and 688262 transitions. [2019-12-07 17:14:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 17:14:25,660 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:25,660 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:25,660 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:25,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:25,660 INFO L82 PathProgramCache]: Analyzing trace with hash 811087671, now seen corresponding path program 1 times [2019-12-07 17:14:25,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:25,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132128471] [2019-12-07 17:14:25,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:25,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:25,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:25,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132128471] [2019-12-07 17:14:25,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:25,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:14:25,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303160705] [2019-12-07 17:14:25,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:14:25,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:25,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:14:25,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:25,741 INFO L87 Difference]: Start difference. First operand 155675 states and 688262 transitions. Second operand 4 states. [2019-12-07 17:14:26,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:26,396 INFO L93 Difference]: Finished difference Result 148754 states and 659072 transitions. [2019-12-07 17:14:26,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:14:26,397 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 17:14:26,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:26,784 INFO L225 Difference]: With dead ends: 148754 [2019-12-07 17:14:26,784 INFO L226 Difference]: Without dead ends: 148754 [2019-12-07 17:14:26,784 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:14:28,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148754 states. [2019-12-07 17:14:30,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148754 to 148754. [2019-12-07 17:14:30,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148754 states. [2019-12-07 17:14:31,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148754 states to 148754 states and 659072 transitions. [2019-12-07 17:14:31,166 INFO L78 Accepts]: Start accepts. Automaton has 148754 states and 659072 transitions. Word has length 21 [2019-12-07 17:14:31,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:31,166 INFO L462 AbstractCegarLoop]: Abstraction has 148754 states and 659072 transitions. [2019-12-07 17:14:31,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:14:31,166 INFO L276 IsEmpty]: Start isEmpty. Operand 148754 states and 659072 transitions. [2019-12-07 17:14:31,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 17:14:31,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:31,192 INFO L410 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] [2019-12-07 17:14:31,192 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:31,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:31,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1517939491, now seen corresponding path program 1 times [2019-12-07 17:14:31,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:31,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321780394] [2019-12-07 17:14:31,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:31,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:31,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:31,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321780394] [2019-12-07 17:14:31,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:31,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:14:31,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111887699] [2019-12-07 17:14:31,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:14:31,231 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:31,231 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:14:31,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:14:31,231 INFO L87 Difference]: Start difference. First operand 148754 states and 659072 transitions. Second operand 5 states. [2019-12-07 17:14:32,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:32,680 INFO L93 Difference]: Finished difference Result 175846 states and 770252 transitions. [2019-12-07 17:14:32,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:14:32,680 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-07 17:14:32,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:33,126 INFO L225 Difference]: With dead ends: 175846 [2019-12-07 17:14:33,126 INFO L226 Difference]: Without dead ends: 175738 [2019-12-07 17:14:33,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:14:35,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175738 states. [2019-12-07 17:14:37,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175738 to 147798. [2019-12-07 17:14:37,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147798 states. [2019-12-07 17:14:37,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147798 states to 147798 states and 655176 transitions. [2019-12-07 17:14:37,967 INFO L78 Accepts]: Start accepts. Automaton has 147798 states and 655176 transitions. Word has length 24 [2019-12-07 17:14:37,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:37,967 INFO L462 AbstractCegarLoop]: Abstraction has 147798 states and 655176 transitions. [2019-12-07 17:14:37,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:14:37,967 INFO L276 IsEmpty]: Start isEmpty. Operand 147798 states and 655176 transitions. [2019-12-07 17:14:38,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 17:14:38,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:38,538 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:38,538 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:38,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:38,538 INFO L82 PathProgramCache]: Analyzing trace with hash 455873455, now seen corresponding path program 1 times [2019-12-07 17:14:38,539 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:38,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789599978] [2019-12-07 17:14:38,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:38,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789599978] [2019-12-07 17:14:38,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:38,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:14:38,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886426604] [2019-12-07 17:14:38,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:14:38,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:38,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:14:38,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:14:38,601 INFO L87 Difference]: Start difference. First operand 147798 states and 655176 transitions. Second operand 3 states. [2019-12-07 17:14:39,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:39,212 INFO L93 Difference]: Finished difference Result 139222 states and 609976 transitions. [2019-12-07 17:14:39,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:14:39,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 17:14:39,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:39,558 INFO L225 Difference]: With dead ends: 139222 [2019-12-07 17:14:39,559 INFO L226 Difference]: Without dead ends: 139222 [2019-12-07 17:14:39,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:14:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139222 states. [2019-12-07 17:14:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139222 to 138902. [2019-12-07 17:14:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138902 states. [2019-12-07 17:14:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138902 states to 138902 states and 608808 transitions. [2019-12-07 17:14:45,486 INFO L78 Accepts]: Start accepts. Automaton has 138902 states and 608808 transitions. Word has length 34 [2019-12-07 17:14:45,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:45,486 INFO L462 AbstractCegarLoop]: Abstraction has 138902 states and 608808 transitions. [2019-12-07 17:14:45,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:14:45,486 INFO L276 IsEmpty]: Start isEmpty. Operand 138902 states and 608808 transitions. [2019-12-07 17:14:45,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:14:45,609 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:45,610 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:45,610 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:45,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:45,610 INFO L82 PathProgramCache]: Analyzing trace with hash -608772183, now seen corresponding path program 1 times [2019-12-07 17:14:45,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:45,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290275011] [2019-12-07 17:14:45,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:45,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:45,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:45,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290275011] [2019-12-07 17:14:45,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:45,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:14:45,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189752036] [2019-12-07 17:14:45,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:14:45,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:45,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:14:45,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:14:45,666 INFO L87 Difference]: Start difference. First operand 138902 states and 608808 transitions. Second operand 5 states. [2019-12-07 17:14:46,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:46,601 INFO L93 Difference]: Finished difference Result 194896 states and 864928 transitions. [2019-12-07 17:14:46,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 17:14:46,602 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-07 17:14:46,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:47,095 INFO L225 Difference]: With dead ends: 194896 [2019-12-07 17:14:47,095 INFO L226 Difference]: Without dead ends: 194896 [2019-12-07 17:14:47,095 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:14:49,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194896 states. [2019-12-07 17:14:52,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194896 to 188630. [2019-12-07 17:14:52,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188630 states. [2019-12-07 17:14:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188630 states to 188630 states and 839240 transitions. [2019-12-07 17:14:52,878 INFO L78 Accepts]: Start accepts. Automaton has 188630 states and 839240 transitions. Word has length 35 [2019-12-07 17:14:52,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:14:52,879 INFO L462 AbstractCegarLoop]: Abstraction has 188630 states and 839240 transitions. [2019-12-07 17:14:52,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:14:52,879 INFO L276 IsEmpty]: Start isEmpty. Operand 188630 states and 839240 transitions. [2019-12-07 17:14:53,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:14:53,071 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:14:53,071 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:14:53,072 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:14:53,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:14:53,072 INFO L82 PathProgramCache]: Analyzing trace with hash 151916713, now seen corresponding path program 2 times [2019-12-07 17:14:53,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:14:53,072 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180067071] [2019-12-07 17:14:53,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:14:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:14:53,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:14:53,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180067071] [2019-12-07 17:14:53,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:14:53,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:14:53,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487160355] [2019-12-07 17:14:53,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:14:53,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:14:53,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:14:53,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:14:53,173 INFO L87 Difference]: Start difference. First operand 188630 states and 839240 transitions. Second operand 7 states. [2019-12-07 17:14:55,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:14:55,202 INFO L93 Difference]: Finished difference Result 290542 states and 1293524 transitions. [2019-12-07 17:14:55,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 17:14:55,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-07 17:14:55,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:14:58,620 INFO L225 Difference]: With dead ends: 290542 [2019-12-07 17:14:58,620 INFO L226 Difference]: Without dead ends: 290542 [2019-12-07 17:14:58,621 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2019-12-07 17:15:01,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290542 states. [2019-12-07 17:15:04,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290542 to 196670. [2019-12-07 17:15:04,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196670 states. [2019-12-07 17:15:05,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196670 states to 196670 states and 877404 transitions. [2019-12-07 17:15:05,124 INFO L78 Accepts]: Start accepts. Automaton has 196670 states and 877404 transitions. Word has length 35 [2019-12-07 17:15:05,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:05,124 INFO L462 AbstractCegarLoop]: Abstraction has 196670 states and 877404 transitions. [2019-12-07 17:15:05,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:15:05,124 INFO L276 IsEmpty]: Start isEmpty. Operand 196670 states and 877404 transitions. [2019-12-07 17:15:05,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:15:05,330 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:05,331 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:05,331 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:05,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:05,331 INFO L82 PathProgramCache]: Analyzing trace with hash -340130255, now seen corresponding path program 3 times [2019-12-07 17:15:05,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:05,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206209847] [2019-12-07 17:15:05,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:05,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:05,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:15:05,415 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206209847] [2019-12-07 17:15:05,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:05,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:15:05,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976597483] [2019-12-07 17:15:05,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:15:05,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:05,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:15:05,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:05,416 INFO L87 Difference]: Start difference. First operand 196670 states and 877404 transitions. Second operand 8 states. [2019-12-07 17:15:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:08,290 INFO L93 Difference]: Finished difference Result 389598 states and 1733674 transitions. [2019-12-07 17:15:08,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:15:08,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-07 17:15:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:09,977 INFO L225 Difference]: With dead ends: 389598 [2019-12-07 17:15:09,978 INFO L226 Difference]: Without dead ends: 389598 [2019-12-07 17:15:09,978 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:15:12,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389598 states. [2019-12-07 17:15:20,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389598 to 214622. [2019-12-07 17:15:20,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 214622 states. [2019-12-07 17:15:21,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214622 states to 214622 states and 954372 transitions. [2019-12-07 17:15:21,323 INFO L78 Accepts]: Start accepts. Automaton has 214622 states and 954372 transitions. Word has length 35 [2019-12-07 17:15:21,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:21,324 INFO L462 AbstractCegarLoop]: Abstraction has 214622 states and 954372 transitions. [2019-12-07 17:15:21,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:15:21,324 INFO L276 IsEmpty]: Start isEmpty. Operand 214622 states and 954372 transitions. [2019-12-07 17:15:21,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 17:15:21,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:21,541 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:21,541 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:21,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:21,541 INFO L82 PathProgramCache]: Analyzing trace with hash 159357381, now seen corresponding path program 4 times [2019-12-07 17:15:21,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:21,541 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364355103] [2019-12-07 17:15:21,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:21,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:15:21,597 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364355103] [2019-12-07 17:15:21,597 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:21,597 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:15:21,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044170115] [2019-12-07 17:15:21,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:15:21,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:21,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:15:21,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:21,598 INFO L87 Difference]: Start difference. First operand 214622 states and 954372 transitions. Second operand 4 states. [2019-12-07 17:15:22,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:22,577 INFO L93 Difference]: Finished difference Result 212826 states and 945886 transitions. [2019-12-07 17:15:22,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:15:22,578 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 17:15:22,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:23,630 INFO L225 Difference]: With dead ends: 212826 [2019-12-07 17:15:23,631 INFO L226 Difference]: Without dead ends: 212826 [2019-12-07 17:15:23,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:15:25,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212826 states. [2019-12-07 17:15:28,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212826 to 210374. [2019-12-07 17:15:28,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210374 states. [2019-12-07 17:15:29,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210374 states to 210374 states and 934404 transitions. [2019-12-07 17:15:29,363 INFO L78 Accepts]: Start accepts. Automaton has 210374 states and 934404 transitions. Word has length 35 [2019-12-07 17:15:29,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:29,363 INFO L462 AbstractCegarLoop]: Abstraction has 210374 states and 934404 transitions. [2019-12-07 17:15:29,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:15:29,364 INFO L276 IsEmpty]: Start isEmpty. Operand 210374 states and 934404 transitions. [2019-12-07 17:15:29,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:15:29,588 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:29,588 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:29,588 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:29,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:29,589 INFO L82 PathProgramCache]: Analyzing trace with hash 732867859, now seen corresponding path program 1 times [2019-12-07 17:15:29,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:29,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064294403] [2019-12-07 17:15:29,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:29,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:15:29,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064294403] [2019-12-07 17:15:29,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:29,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:15:29,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979941853] [2019-12-07 17:15:29,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:15:29,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:29,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:15:29,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:29,686 INFO L87 Difference]: Start difference. First operand 210374 states and 934404 transitions. Second operand 8 states. [2019-12-07 17:15:32,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:32,901 INFO L93 Difference]: Finished difference Result 470710 states and 2082788 transitions. [2019-12-07 17:15:32,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-07 17:15:32,901 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 17:15:32,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:37,530 INFO L225 Difference]: With dead ends: 470710 [2019-12-07 17:15:37,531 INFO L226 Difference]: Without dead ends: 397526 [2019-12-07 17:15:37,531 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=214, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:15:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397526 states. [2019-12-07 17:15:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397526 to 291058. [2019-12-07 17:15:45,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291058 states. [2019-12-07 17:15:46,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291058 states to 291058 states and 1296700 transitions. [2019-12-07 17:15:46,838 INFO L78 Accepts]: Start accepts. Automaton has 291058 states and 1296700 transitions. Word has length 36 [2019-12-07 17:15:46,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:15:46,838 INFO L462 AbstractCegarLoop]: Abstraction has 291058 states and 1296700 transitions. [2019-12-07 17:15:46,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:15:46,838 INFO L276 IsEmpty]: Start isEmpty. Operand 291058 states and 1296700 transitions. [2019-12-07 17:15:47,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:15:47,198 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:15:47,198 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:15:47,199 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:15:47,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:15:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1867550565, now seen corresponding path program 2 times [2019-12-07 17:15:47,199 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:15:47,199 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105320849] [2019-12-07 17:15:47,199 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:15:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:15:47,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:15:47,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105320849] [2019-12-07 17:15:47,280 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:15:47,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:15:47,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662987508] [2019-12-07 17:15:47,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 17:15:47,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:15:47,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 17:15:47,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 17:15:47,280 INFO L87 Difference]: Start difference. First operand 291058 states and 1296700 transitions. Second operand 8 states. [2019-12-07 17:15:51,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:15:51,024 INFO L93 Difference]: Finished difference Result 493980 states and 2191095 transitions. [2019-12-07 17:15:51,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:15:51,024 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-12-07 17:15:51,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:15:52,335 INFO L225 Difference]: With dead ends: 493980 [2019-12-07 17:15:52,336 INFO L226 Difference]: Without dead ends: 457756 [2019-12-07 17:15:52,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:15:56,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457756 states. [2019-12-07 17:16:05,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457756 to 259406. [2019-12-07 17:16:05,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259406 states. [2019-12-07 17:16:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259406 states to 259406 states and 1152150 transitions. [2019-12-07 17:16:06,181 INFO L78 Accepts]: Start accepts. Automaton has 259406 states and 1152150 transitions. Word has length 36 [2019-12-07 17:16:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:06,181 INFO L462 AbstractCegarLoop]: Abstraction has 259406 states and 1152150 transitions. [2019-12-07 17:16:06,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 17:16:06,181 INFO L276 IsEmpty]: Start isEmpty. Operand 259406 states and 1152150 transitions. [2019-12-07 17:16:06,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:16:06,477 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:06,477 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:06,477 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:06,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:06,478 INFO L82 PathProgramCache]: Analyzing trace with hash 1800421625, now seen corresponding path program 3 times [2019-12-07 17:16:06,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:06,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680496491] [2019-12-07 17:16:06,478 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:06,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:06,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680496491] [2019-12-07 17:16:06,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:06,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:16:06,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397601996] [2019-12-07 17:16:06,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:16:06,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:06,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:16:06,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:06,564 INFO L87 Difference]: Start difference. First operand 259406 states and 1152150 transitions. Second operand 9 states. [2019-12-07 17:16:10,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:10,726 INFO L93 Difference]: Finished difference Result 474254 states and 2109794 transitions. [2019-12-07 17:16:10,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 17:16:10,726 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 17:16:10,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:12,033 INFO L225 Difference]: With dead ends: 474254 [2019-12-07 17:16:12,033 INFO L226 Difference]: Without dead ends: 474254 [2019-12-07 17:16:12,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=232, Invalid=890, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 17:16:16,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474254 states. [2019-12-07 17:16:21,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474254 to 283218. [2019-12-07 17:16:21,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283218 states. [2019-12-07 17:16:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283218 states to 283218 states and 1259970 transitions. [2019-12-07 17:16:22,206 INFO L78 Accepts]: Start accepts. Automaton has 283218 states and 1259970 transitions. Word has length 36 [2019-12-07 17:16:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:22,207 INFO L462 AbstractCegarLoop]: Abstraction has 283218 states and 1259970 transitions. [2019-12-07 17:16:22,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:16:22,207 INFO L276 IsEmpty]: Start isEmpty. Operand 283218 states and 1259970 transitions. [2019-12-07 17:16:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:16:22,550 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:22,550 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:22,550 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:22,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:22,550 INFO L82 PathProgramCache]: Analyzing trace with hash -2130707105, now seen corresponding path program 4 times [2019-12-07 17:16:22,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:22,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126064063] [2019-12-07 17:16:22,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:22,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:22,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126064063] [2019-12-07 17:16:22,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:22,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:16:22,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937710716] [2019-12-07 17:16:22,603 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:16:22,603 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:16:22,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:16:22,603 INFO L87 Difference]: Start difference. First operand 283218 states and 1259970 transitions. Second operand 6 states. [2019-12-07 17:16:26,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:26,991 INFO L93 Difference]: Finished difference Result 346170 states and 1540826 transitions. [2019-12-07 17:16:26,992 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:16:26,992 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 36 [2019-12-07 17:16:26,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:27,889 INFO L225 Difference]: With dead ends: 346170 [2019-12-07 17:16:27,889 INFO L226 Difference]: Without dead ends: 329390 [2019-12-07 17:16:27,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329390 states. [2019-12-07 17:16:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329390 to 277774. [2019-12-07 17:16:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277774 states. [2019-12-07 17:16:36,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277774 states to 277774 states and 1235406 transitions. [2019-12-07 17:16:36,019 INFO L78 Accepts]: Start accepts. Automaton has 277774 states and 1235406 transitions. Word has length 36 [2019-12-07 17:16:36,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:36,019 INFO L462 AbstractCegarLoop]: Abstraction has 277774 states and 1235406 transitions. [2019-12-07 17:16:36,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:16:36,019 INFO L276 IsEmpty]: Start isEmpty. Operand 277774 states and 1235406 transitions. [2019-12-07 17:16:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:16:36,361 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:36,361 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:36,361 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:36,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -370912413, now seen corresponding path program 5 times [2019-12-07 17:16:36,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:36,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229431012] [2019-12-07 17:16:36,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:36,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:36,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229431012] [2019-12-07 17:16:36,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:36,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:16:36,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884099418] [2019-12-07 17:16:36,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:16:36,441 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:36,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:16:36,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:36,441 INFO L87 Difference]: Start difference. First operand 277774 states and 1235406 transitions. Second operand 9 states. [2019-12-07 17:16:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:39,828 INFO L93 Difference]: Finished difference Result 436950 states and 1934878 transitions. [2019-12-07 17:16:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:16:39,829 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 17:16:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:41,006 INFO L225 Difference]: With dead ends: 436950 [2019-12-07 17:16:41,006 INFO L226 Difference]: Without dead ends: 415738 [2019-12-07 17:16:41,006 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=339, Unknown=0, NotChecked=0, Total=462 [2019-12-07 17:16:44,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415738 states. [2019-12-07 17:16:49,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415738 to 282110. [2019-12-07 17:16:49,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282110 states. [2019-12-07 17:16:50,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282110 states to 282110 states and 1255238 transitions. [2019-12-07 17:16:50,332 INFO L78 Accepts]: Start accepts. Automaton has 282110 states and 1255238 transitions. Word has length 36 [2019-12-07 17:16:50,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:16:50,332 INFO L462 AbstractCegarLoop]: Abstraction has 282110 states and 1255238 transitions. [2019-12-07 17:16:50,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:16:50,332 INFO L276 IsEmpty]: Start isEmpty. Operand 282110 states and 1255238 transitions. [2019-12-07 17:16:50,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 17:16:50,662 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:16:50,662 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:16:50,662 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:16:50,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:16:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1508536587, now seen corresponding path program 6 times [2019-12-07 17:16:50,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:16:50,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197670347] [2019-12-07 17:16:50,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:16:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:16:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:16:50,740 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197670347] [2019-12-07 17:16:50,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:16:50,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 17:16:50,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186141620] [2019-12-07 17:16:50,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 17:16:50,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:16:50,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 17:16:50,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-07 17:16:50,741 INFO L87 Difference]: Start difference. First operand 282110 states and 1255238 transitions. Second operand 9 states. [2019-12-07 17:16:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:16:55,736 INFO L93 Difference]: Finished difference Result 445238 states and 1969374 transitions. [2019-12-07 17:16:55,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 17:16:55,737 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-12-07 17:16:55,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:16:57,133 INFO L225 Difference]: With dead ends: 445238 [2019-12-07 17:16:57,133 INFO L226 Difference]: Without dead ends: 413350 [2019-12-07 17:16:57,134 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=294, Unknown=0, NotChecked=0, Total=420 [2019-12-07 17:17:00,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413350 states. [2019-12-07 17:17:05,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413350 to 261294. [2019-12-07 17:17:05,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261294 states. [2019-12-07 17:17:05,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261294 states to 261294 states and 1160866 transitions. [2019-12-07 17:17:05,947 INFO L78 Accepts]: Start accepts. Automaton has 261294 states and 1160866 transitions. Word has length 36 [2019-12-07 17:17:05,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:05,947 INFO L462 AbstractCegarLoop]: Abstraction has 261294 states and 1160866 transitions. [2019-12-07 17:17:05,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 17:17:05,947 INFO L276 IsEmpty]: Start isEmpty. Operand 261294 states and 1160866 transitions. [2019-12-07 17:17:06,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:17:06,283 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:06,284 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:06,284 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:06,284 INFO L82 PathProgramCache]: Analyzing trace with hash -766693993, now seen corresponding path program 1 times [2019-12-07 17:17:06,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:06,284 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316589558] [2019-12-07 17:17:06,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:06,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:06,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:06,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316589558] [2019-12-07 17:17:06,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:06,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:06,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085443436] [2019-12-07 17:17:06,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:17:06,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:06,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:17:06,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:17:06,305 INFO L87 Difference]: Start difference. First operand 261294 states and 1160866 transitions. Second operand 3 states. [2019-12-07 17:17:09,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:09,320 INFO L93 Difference]: Finished difference Result 414338 states and 1768092 transitions. [2019-12-07 17:17:09,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:17:09,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 17:17:09,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:10,464 INFO L225 Difference]: With dead ends: 414338 [2019-12-07 17:17:10,464 INFO L226 Difference]: Without dead ends: 414254 [2019-12-07 17:17:10,464 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:17:14,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414254 states. [2019-12-07 17:17:24,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414254 to 385062. [2019-12-07 17:17:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385062 states. [2019-12-07 17:17:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385062 states to 385062 states and 1656522 transitions. [2019-12-07 17:17:25,986 INFO L78 Accepts]: Start accepts. Automaton has 385062 states and 1656522 transitions. Word has length 37 [2019-12-07 17:17:25,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:25,986 INFO L462 AbstractCegarLoop]: Abstraction has 385062 states and 1656522 transitions. [2019-12-07 17:17:25,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:17:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 385062 states and 1656522 transitions. [2019-12-07 17:17:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:17:26,762 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:26,762 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:26,762 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:26,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:26,762 INFO L82 PathProgramCache]: Analyzing trace with hash 442372446, now seen corresponding path program 1 times [2019-12-07 17:17:26,763 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:26,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92995891] [2019-12-07 17:17:26,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:26,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:26,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:26,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92995891] [2019-12-07 17:17:26,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:26,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:17:26,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926366850] [2019-12-07 17:17:26,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:17:26,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:26,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:17:26,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:17:26,792 INFO L87 Difference]: Start difference. First operand 385062 states and 1656522 transitions. Second operand 3 states. [2019-12-07 17:17:28,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:28,106 INFO L93 Difference]: Finished difference Result 298744 states and 1190151 transitions. [2019-12-07 17:17:28,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:17:28,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 17:17:28,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:28,854 INFO L225 Difference]: With dead ends: 298744 [2019-12-07 17:17:28,854 INFO L226 Difference]: Without dead ends: 298744 [2019-12-07 17:17:28,854 INFO L630 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 [2019-12-07 17:17:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298744 states. [2019-12-07 17:17:35,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298744 to 298744. [2019-12-07 17:17:35,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298744 states. [2019-12-07 17:17:36,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298744 states to 298744 states and 1190151 transitions. [2019-12-07 17:17:36,376 INFO L78 Accepts]: Start accepts. Automaton has 298744 states and 1190151 transitions. Word has length 37 [2019-12-07 17:17:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:36,377 INFO L462 AbstractCegarLoop]: Abstraction has 298744 states and 1190151 transitions. [2019-12-07 17:17:36,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:17:36,377 INFO L276 IsEmpty]: Start isEmpty. Operand 298744 states and 1190151 transitions. [2019-12-07 17:17:37,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 17:17:37,096 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:37,096 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:37,096 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:37,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:37,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1811485366, now seen corresponding path program 2 times [2019-12-07 17:17:37,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:37,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424230401] [2019-12-07 17:17:37,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:37,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:37,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:37,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424230401] [2019-12-07 17:17:37,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:37,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:37,117 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501871471] [2019-12-07 17:17:37,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:37,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:37,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:37,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:37,118 INFO L87 Difference]: Start difference. First operand 298744 states and 1190151 transitions. Second operand 4 states. [2019-12-07 17:17:37,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:37,567 INFO L93 Difference]: Finished difference Result 121469 states and 410372 transitions. [2019-12-07 17:17:37,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:37,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 17:17:37,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:37,796 INFO L225 Difference]: With dead ends: 121469 [2019-12-07 17:17:37,796 INFO L226 Difference]: Without dead ends: 121469 [2019-12-07 17:17:37,796 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121469 states. [2019-12-07 17:17:40,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121469 to 121469. [2019-12-07 17:17:40,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121469 states. [2019-12-07 17:17:40,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121469 states to 121469 states and 410372 transitions. [2019-12-07 17:17:40,392 INFO L78 Accepts]: Start accepts. Automaton has 121469 states and 410372 transitions. Word has length 37 [2019-12-07 17:17:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:40,392 INFO L462 AbstractCegarLoop]: Abstraction has 121469 states and 410372 transitions. [2019-12-07 17:17:40,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 121469 states and 410372 transitions. [2019-12-07 17:17:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 17:17:40,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:40,483 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:40,483 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:40,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:40,483 INFO L82 PathProgramCache]: Analyzing trace with hash -502050099, now seen corresponding path program 1 times [2019-12-07 17:17:40,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:40,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914351882] [2019-12-07 17:17:40,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:40,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:40,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:40,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914351882] [2019-12-07 17:17:40,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:40,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:17:40,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328819165] [2019-12-07 17:17:40,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:40,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:40,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:40,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:40,509 INFO L87 Difference]: Start difference. First operand 121469 states and 410372 transitions. Second operand 5 states. [2019-12-07 17:17:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:40,613 INFO L93 Difference]: Finished difference Result 28149 states and 93878 transitions. [2019-12-07 17:17:40,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:40,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 17:17:40,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:40,653 INFO L225 Difference]: With dead ends: 28149 [2019-12-07 17:17:40,653 INFO L226 Difference]: Without dead ends: 28149 [2019-12-07 17:17:40,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:40,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28149 states. [2019-12-07 17:17:40,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28149 to 21853. [2019-12-07 17:17:40,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21853 states. [2019-12-07 17:17:40,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21853 states to 21853 states and 71754 transitions. [2019-12-07 17:17:40,969 INFO L78 Accepts]: Start accepts. Automaton has 21853 states and 71754 transitions. Word has length 38 [2019-12-07 17:17:40,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:40,969 INFO L462 AbstractCegarLoop]: Abstraction has 21853 states and 71754 transitions. [2019-12-07 17:17:40,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 21853 states and 71754 transitions. [2019-12-07 17:17:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:17:40,989 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:40,989 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:40,990 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1651509924, now seen corresponding path program 1 times [2019-12-07 17:17:40,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:40,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701540805] [2019-12-07 17:17:40,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:41,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:41,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701540805] [2019-12-07 17:17:41,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:41,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:17:41,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801013944] [2019-12-07 17:17:41,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:17:41,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:41,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:17:41,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:17:41,025 INFO L87 Difference]: Start difference. First operand 21853 states and 71754 transitions. Second operand 4 states. [2019-12-07 17:17:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:41,099 INFO L93 Difference]: Finished difference Result 24557 states and 78699 transitions. [2019-12-07 17:17:41,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:17:41,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 17:17:41,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:41,127 INFO L225 Difference]: With dead ends: 24557 [2019-12-07 17:17:41,127 INFO L226 Difference]: Without dead ends: 21864 [2019-12-07 17:17:41,127 INFO L630 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 [2019-12-07 17:17:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21864 states. [2019-12-07 17:17:41,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21864 to 21841. [2019-12-07 17:17:41,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21841 states. [2019-12-07 17:17:41,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21841 states to 21841 states and 71526 transitions. [2019-12-07 17:17:41,422 INFO L78 Accepts]: Start accepts. Automaton has 21841 states and 71526 transitions. Word has length 49 [2019-12-07 17:17:41,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:41,422 INFO L462 AbstractCegarLoop]: Abstraction has 21841 states and 71526 transitions. [2019-12-07 17:17:41,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:17:41,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21841 states and 71526 transitions. [2019-12-07 17:17:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 17:17:41,442 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:41,442 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:41,442 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:41,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:41,443 INFO L82 PathProgramCache]: Analyzing trace with hash -87410594, now seen corresponding path program 2 times [2019-12-07 17:17:41,443 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:41,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727836229] [2019-12-07 17:17:41,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:41,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:41,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:41,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727836229] [2019-12-07 17:17:41,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:41,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:17:41,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180169677] [2019-12-07 17:17:41,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:17:41,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:17:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:41,481 INFO L87 Difference]: Start difference. First operand 21841 states and 71526 transitions. Second operand 6 states. [2019-12-07 17:17:41,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:41,621 INFO L93 Difference]: Finished difference Result 19478 states and 66188 transitions. [2019-12-07 17:17:41,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:41,622 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-07 17:17:41,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:41,636 INFO L225 Difference]: With dead ends: 19478 [2019-12-07 17:17:41,636 INFO L226 Difference]: Without dead ends: 11358 [2019-12-07 17:17:41,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:41,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11358 states. [2019-12-07 17:17:41,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11358 to 11090. [2019-12-07 17:17:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11090 states. [2019-12-07 17:17:41,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11090 states to 11090 states and 33945 transitions. [2019-12-07 17:17:41,766 INFO L78 Accepts]: Start accepts. Automaton has 11090 states and 33945 transitions. Word has length 49 [2019-12-07 17:17:41,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:41,766 INFO L462 AbstractCegarLoop]: Abstraction has 11090 states and 33945 transitions. [2019-12-07 17:17:41,766 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:17:41,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11090 states and 33945 transitions. [2019-12-07 17:17:41,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:17:41,775 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:41,775 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:41,775 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:41,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:41,776 INFO L82 PathProgramCache]: Analyzing trace with hash 471345684, now seen corresponding path program 1 times [2019-12-07 17:17:41,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:41,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423841757] [2019-12-07 17:17:41,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:41,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:41,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423841757] [2019-12-07 17:17:41,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:41,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:17:41,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503747224] [2019-12-07 17:17:41,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:41,830 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:41,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:41,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:41,830 INFO L87 Difference]: Start difference. First operand 11090 states and 33945 transitions. Second operand 5 states. [2019-12-07 17:17:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:41,879 INFO L93 Difference]: Finished difference Result 11959 states and 35895 transitions. [2019-12-07 17:17:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:17:41,880 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 17:17:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:41,887 INFO L225 Difference]: With dead ends: 11959 [2019-12-07 17:17:41,887 INFO L226 Difference]: Without dead ends: 6411 [2019-12-07 17:17:41,887 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:17:41,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6411 states. [2019-12-07 17:17:41,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6411 to 6411. [2019-12-07 17:17:41,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6411 states. [2019-12-07 17:17:41,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6411 states to 6411 states and 17009 transitions. [2019-12-07 17:17:41,956 INFO L78 Accepts]: Start accepts. Automaton has 6411 states and 17009 transitions. Word has length 65 [2019-12-07 17:17:41,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:41,956 INFO L462 AbstractCegarLoop]: Abstraction has 6411 states and 17009 transitions. [2019-12-07 17:17:41,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:41,956 INFO L276 IsEmpty]: Start isEmpty. Operand 6411 states and 17009 transitions. [2019-12-07 17:17:41,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 17:17:41,961 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:41,961 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:41,961 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:41,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:41,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1242442434, now seen corresponding path program 2 times [2019-12-07 17:17:41,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:41,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001874408] [2019-12-07 17:17:41,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:41,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:42,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:42,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001874408] [2019-12-07 17:17:42,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:42,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:17:42,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356852913] [2019-12-07 17:17:42,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:17:42,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:42,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:17:42,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:17:42,019 INFO L87 Difference]: Start difference. First operand 6411 states and 17009 transitions. Second operand 5 states. [2019-12-07 17:17:42,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:42,067 INFO L93 Difference]: Finished difference Result 6895 states and 18098 transitions. [2019-12-07 17:17:42,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:17:42,067 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 17:17:42,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:42,068 INFO L225 Difference]: With dead ends: 6895 [2019-12-07 17:17:42,068 INFO L226 Difference]: Without dead ends: 565 [2019-12-07 17:17:42,068 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:17:42,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2019-12-07 17:17:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2019-12-07 17:17:42,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2019-12-07 17:17:42,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1214 transitions. [2019-12-07 17:17:42,073 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1214 transitions. Word has length 65 [2019-12-07 17:17:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:42,073 INFO L462 AbstractCegarLoop]: Abstraction has 565 states and 1214 transitions. [2019-12-07 17:17:42,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:17:42,073 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1214 transitions. [2019-12-07 17:17:42,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:17:42,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:42,074 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:42,074 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:42,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:42,074 INFO L82 PathProgramCache]: Analyzing trace with hash -654325219, now seen corresponding path program 1 times [2019-12-07 17:17:42,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:42,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933860162] [2019-12-07 17:17:42,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:17:42,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:17:42,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933860162] [2019-12-07 17:17:42,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:17:42,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 17:17:42,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245050925] [2019-12-07 17:17:42,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:17:42,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:17:42,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:17:42,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:17:42,140 INFO L87 Difference]: Start difference. First operand 565 states and 1214 transitions. Second operand 7 states. [2019-12-07 17:17:42,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:17:42,301 INFO L93 Difference]: Finished difference Result 1170 states and 2485 transitions. [2019-12-07 17:17:42,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 17:17:42,301 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 17:17:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:17:42,302 INFO L225 Difference]: With dead ends: 1170 [2019-12-07 17:17:42,302 INFO L226 Difference]: Without dead ends: 847 [2019-12-07 17:17:42,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-07 17:17:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-07 17:17:42,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 631. [2019-12-07 17:17:42,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-07 17:17:42,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1329 transitions. [2019-12-07 17:17:42,308 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1329 transitions. Word has length 66 [2019-12-07 17:17:42,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:17:42,308 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1329 transitions. [2019-12-07 17:17:42,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:17:42,309 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1329 transitions. [2019-12-07 17:17:42,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:17:42,309 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:17:42,309 INFO L410 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:17:42,309 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:17:42,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:17:42,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1220820073, now seen corresponding path program 2 times [2019-12-07 17:17:42,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:17:42,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750615730] [2019-12-07 17:17:42,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:17:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:17:42,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:17:42,386 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:17:42,386 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:17:42,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t333~0.base_32|) 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t333~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t333~0.base_32|) |v_ULTIMATE.start_main_~#t333~0.offset_23| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= (store .cse0 |v_ULTIMATE.start_main_~#t333~0.base_32| 1) |v_#valid_83|) (= v_~a~0_21 0) (= v_~y~0_64 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t333~0.base_32|) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= |v_ULTIMATE.start_main_~#t333~0.offset_23| 0) (= 0 v_~z$flush_delayed~0_302) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= v_~weak$$choice2~0_349 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t333~0.base_32| 4) |v_#length_31|) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t334~0.base=|v_ULTIMATE.start_main_~#t334~0.base_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ULTIMATE.start_main_~#t334~0.offset=|v_ULTIMATE.start_main_~#t334~0.offset_16|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ULTIMATE.start_main_~#t336~0.offset=|v_ULTIMATE.start_main_~#t336~0.offset_16|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~x~0=v_~x~0_31, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_~#t333~0.base=|v_ULTIMATE.start_main_~#t333~0.base_32|, ~z$w_buff1~0=v_~z$w_buff1~0_470, ULTIMATE.start_main_~#t335~0.offset=|v_ULTIMATE.start_main_~#t335~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ULTIMATE.start_main_~#t336~0.base=|v_ULTIMATE.start_main_~#t336~0.base_19|, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ULTIMATE.start_main_~#t333~0.offset=|v_ULTIMATE.start_main_~#t333~0.offset_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82, ULTIMATE.start_main_~#t335~0.base=|v_ULTIMATE.start_main_~#t335~0.base_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t334~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t334~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t336~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t333~0.base, ~z$w_buff1~0, ULTIMATE.start_main_~#t335~0.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t336~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t333~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t335~0.base] because there is no mapped edge [2019-12-07 17:17:42,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= |v_ULTIMATE.start_main_~#t334~0.offset_11| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t334~0.base_12| 4)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t334~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t334~0.base_12|) |v_ULTIMATE.start_main_~#t334~0.offset_11| 1))) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t334~0.base_12|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t334~0.base_12| 1) |v_#valid_43|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t334~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t334~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t334~0.base=|v_ULTIMATE.start_main_~#t334~0.base_12|, ULTIMATE.start_main_~#t334~0.offset=|v_ULTIMATE.start_main_~#t334~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t334~0.base, ULTIMATE.start_main_~#t334~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:17:42,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t335~0.base_9|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t335~0.base_9|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t335~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t335~0.offset_8| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t335~0.base_9| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t335~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t335~0.base_9|) |v_ULTIMATE.start_main_~#t335~0.offset_8| 2))) (not (= |v_ULTIMATE.start_main_~#t335~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t335~0.offset=|v_ULTIMATE.start_main_~#t335~0.offset_8|, #length=|v_#length_17|, ULTIMATE.start_main_~#t335~0.base=|v_ULTIMATE.start_main_~#t335~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t335~0.offset, #length, ULTIMATE.start_main_~#t335~0.base] because there is no mapped edge [2019-12-07 17:17:42,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t336~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t336~0.base_13|) |v_ULTIMATE.start_main_~#t336~0.offset_11| 3)) |v_#memory_int_19|) (= 0 (select |v_#valid_50| |v_ULTIMATE.start_main_~#t336~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t336~0.base_13|)) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t336~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t336~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t336~0.base_13|) (= |v_ULTIMATE.start_main_~#t336~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t336~0.base=|v_ULTIMATE.start_main_~#t336~0.base_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t336~0.offset=|v_ULTIMATE.start_main_~#t336~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t336~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t336~0.offset, #length] because there is no mapped edge [2019-12-07 17:17:42,391 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 17:17:42,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork3_#t~ite29_Out1987295334| |P3Thread1of1ForFork3_#t~ite28_Out1987295334|)) (.cse2 (= (mod ~z$w_buff0_used~0_In1987295334 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1987295334 256)))) (or (and (= ~z$w_buff0~0_In1987295334 |P3Thread1of1ForFork3_#t~ite28_Out1987295334|) (not .cse0) .cse1 (not .cse2)) (and (= ~z$w_buff1~0_In1987295334 |P3Thread1of1ForFork3_#t~ite28_Out1987295334|) .cse1 (or .cse2 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1987295334, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1987295334, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1987295334, ~z$w_buff1~0=~z$w_buff1~0_In1987295334} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out1987295334|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out1987295334|, ~z$w_buff0~0=~z$w_buff0~0_In1987295334, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1987295334, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1987295334, ~z$w_buff1~0=~z$w_buff1~0_In1987295334} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 17:17:42,395 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:42,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1238653789 256)))) (or (and .cse0 (= ~z~0_In1238653789 |P3Thread1of1ForFork3_#t~ite48_Out1238653789|)) (and (= ~z$mem_tmp~0_In1238653789 |P3Thread1of1ForFork3_#t~ite48_Out1238653789|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1238653789, ~z$flush_delayed~0=~z$flush_delayed~0_In1238653789, ~z~0=~z~0_In1238653789} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1238653789, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out1238653789|, ~z$flush_delayed~0=~z$flush_delayed~0_In1238653789, ~z~0=~z~0_In1238653789} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 17:17:42,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:17:42,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:17:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-592462084 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite25_Out-592462084| ~z$mem_tmp~0_In-592462084) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite25_Out-592462084| ~z~0_In-592462084)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-592462084, ~z$flush_delayed~0=~z$flush_delayed~0_In-592462084, ~z~0=~z~0_In-592462084} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-592462084, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-592462084|, ~z$flush_delayed~0=~z$flush_delayed~0_In-592462084, ~z~0=~z~0_In-592462084} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:17:42,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:17:42,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1835462469 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1835462469 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1835462469 |P3Thread1of1ForFork3_#t~ite51_Out-1835462469|)) (and (= 0 |P3Thread1of1ForFork3_#t~ite51_Out-1835462469|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1835462469, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1835462469} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-1835462469|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1835462469, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1835462469} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 17:17:42,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-383004899 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-383004899 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-383004899 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-383004899 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite52_Out-383004899| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite52_Out-383004899| ~z$w_buff1_used~0_In-383004899)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out-383004899|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 17:17:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out1978311708 ~z$r_buff0_thd4~0_In1978311708)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1978311708 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1978311708 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out1978311708 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1978311708, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978311708} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out1978311708|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978311708, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1978311708} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In2017959808 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2017959808 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In2017959808 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2017959808 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite54_Out2017959808| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork3_#t~ite54_Out2017959808| ~z$r_buff1_thd4~0_In2017959808)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2017959808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2017959808, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2017959808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017959808} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out2017959808|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2017959808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2017959808, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2017959808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017959808} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 17:17:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:17:42,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:17:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-709854807 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-709854807 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-709854807| ~z~0_In-709854807)) (and (not .cse0) (= ~z$w_buff1~0_In-709854807 |ULTIMATE.start_main_#t~ite59_Out-709854807|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-709854807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-709854807, ~z$w_buff1~0=~z$w_buff1~0_In-709854807, ~z~0=~z~0_In-709854807} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-709854807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-709854807, ~z$w_buff1~0=~z$w_buff1~0_In-709854807, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-709854807|, ~z~0=~z~0_In-709854807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:17:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:17:42,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010509751 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010509751 256) 0))) (or (and (= ~z$w_buff0_used~0_In2010509751 |ULTIMATE.start_main_#t~ite61_Out2010509751|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out2010509751|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out2010509751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:17:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1792629238 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1792629238 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1792629238 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1792629238 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1792629238| ~z$w_buff1_used~0_In1792629238) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1792629238|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1792629238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792629238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1792629238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792629238} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1792629238|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1792629238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792629238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1792629238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792629238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:17:42,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-568372031 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-568372031 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-568372031| ~z$r_buff0_thd0~0_In-568372031)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-568372031| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-568372031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568372031} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-568372031|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-568372031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568372031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:17:42,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-2093842778 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2093842778 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2093842778 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2093842778 256)))) (or (and (= ~z$r_buff1_thd0~0_In-2093842778 |ULTIMATE.start_main_#t~ite64_Out-2093842778|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-2093842778|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2093842778, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2093842778, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2093842778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2093842778} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2093842778, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2093842778, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2093842778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2093842778, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-2093842778|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:17:42,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:17:42,475 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:17:42 BasicIcfg [2019-12-07 17:17:42,475 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:17:42,475 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:17:42,475 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:17:42,475 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:17:42,476 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:13:42" (3/4) ... [2019-12-07 17:17:42,478 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:17:42,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] ULTIMATE.startENTRY-->L858: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_138 0) (= v_~z$w_buff0_used~0_1252 0) (= v_~main$tmp_guard1~0_62 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t333~0.base_32|) 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$w_buff1~0_470 0) (= |v_#NULL.offset_6| 0) (< 0 |v_#StackHeapBarrier_21|) (= v_~z$r_buff1_thd2~0_210 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t333~0.base_32| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t333~0.base_32|) |v_ULTIMATE.start_main_~#t333~0.offset_23| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff0_thd3~0_449) (= v_~main$tmp_guard0~0_25 0) (= v_~z$read_delayed~0_6 0) (= v_~z$w_buff0~0_733 0) (= v_~z~0_333 0) (= v_~z$r_buff1_thd1~0_210 0) (= v_~z$r_buff1_thd0~0_311 0) (= 0 v_~weak$$choice0~0_252) (= 0 v_~__unbuffered_p1_EAX~0_76) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p3_EAX~0_79) (= v_~z$r_buff0_thd1~0_82 0) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_888 0) (= v_~x~0_31 0) (= 0 v_~z$mem_tmp~0_265) (= v_~z$r_buff0_thd2~0_82 0) (= 0 v_~z$r_buff1_thd4~0_428) (= 0 v_~__unbuffered_p3_EBX~0_68) (= (store .cse0 |v_ULTIMATE.start_main_~#t333~0.base_32| 1) |v_#valid_83|) (= v_~a~0_21 0) (= v_~y~0_64 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t333~0.base_32|) (= v_~z$r_buff0_thd0~0_181 0) (= v_~__unbuffered_p1_EBX~0_76 0) (= |v_ULTIMATE.start_main_~#t333~0.offset_23| 0) (= 0 v_~z$flush_delayed~0_302) (= 0 v_~z$r_buff1_thd3~0_503) (= 0 v_~__unbuffered_p0_EAX~0_66) (= 0 v_~z$r_buff0_thd4~0_609) (= v_~weak$$choice2~0_349 0) (= (store |v_#length_32| |v_ULTIMATE.start_main_~#t333~0.base_32| 4) |v_#length_31|) (= 0 v_~__unbuffered_p2_EAX~0_114))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_28|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_210, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_131|, ~a~0=v_~a~0_21, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_181, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_~#t334~0.base=|v_ULTIMATE.start_main_~#t334~0.base_25|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_76, ULTIMATE.start_main_~#t334~0.offset=|v_ULTIMATE.start_main_~#t334~0.offset_16|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_609, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_79, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_114, ~z$mem_tmp~0=v_~z$mem_tmp~0_265, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_888, ~z$flush_delayed~0=v_~z$flush_delayed~0_302, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_252, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_221|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_210, ULTIMATE.start_main_~#t336~0.offset=|v_ULTIMATE.start_main_~#t336~0.offset_16|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_449, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_138, ~x~0=v_~x~0_31, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_428, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_25|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_~#t333~0.base=|v_ULTIMATE.start_main_~#t333~0.base_32|, ~z$w_buff1~0=v_~z$w_buff1~0_470, ULTIMATE.start_main_~#t335~0.offset=|v_ULTIMATE.start_main_~#t335~0.offset_15|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_62, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_311, ULTIMATE.start_main_~#t336~0.base=|v_ULTIMATE.start_main_~#t336~0.base_19|, ~y~0=v_~y~0_64, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_82, ULTIMATE.start_main_~#t333~0.offset=|v_ULTIMATE.start_main_~#t333~0.offset_23|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_76, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1252, ~z$w_buff0~0=v_~z$w_buff0~0_733, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_503, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_57|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_25, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_68, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_59|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_27|, ~z~0=v_~z~0_333, ~weak$$choice2~0=v_~weak$$choice2~0_349, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_82, ULTIMATE.start_main_~#t335~0.base=|v_ULTIMATE.start_main_~#t335~0.base_18|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t334~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t334~0.offset, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t336~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t333~0.base, ~z$w_buff1~0, ULTIMATE.start_main_~#t335~0.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t336~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t333~0.offset, ~__unbuffered_p1_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t335~0.base] because there is no mapped edge [2019-12-07 17:17:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L858-1-->L860: Formula: (and (= |v_ULTIMATE.start_main_~#t334~0.offset_11| 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t334~0.base_12| 4)) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t334~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t334~0.base_12|) |v_ULTIMATE.start_main_~#t334~0.offset_11| 1))) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t334~0.base_12|) (= (store |v_#valid_44| |v_ULTIMATE.start_main_~#t334~0.base_12| 1) |v_#valid_43|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t334~0.base_12|)) (not (= 0 |v_ULTIMATE.start_main_~#t334~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t334~0.base=|v_ULTIMATE.start_main_~#t334~0.base_12|, ULTIMATE.start_main_~#t334~0.offset=|v_ULTIMATE.start_main_~#t334~0.offset_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t334~0.base, ULTIMATE.start_main_~#t334~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 17:17:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L860-1-->L862: Formula: (and (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t335~0.base_9|) 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t335~0.base_9|) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t335~0.base_9| 1)) (= |v_ULTIMATE.start_main_~#t335~0.offset_8| 0) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t335~0.base_9| 4) |v_#length_17|) (= |v_#memory_int_13| (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t335~0.base_9| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t335~0.base_9|) |v_ULTIMATE.start_main_~#t335~0.offset_8| 2))) (not (= |v_ULTIMATE.start_main_~#t335~0.base_9| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t335~0.offset=|v_ULTIMATE.start_main_~#t335~0.offset_8|, #length=|v_#length_17|, ULTIMATE.start_main_~#t335~0.base=|v_ULTIMATE.start_main_~#t335~0.base_9|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t335~0.offset, #length, ULTIMATE.start_main_~#t335~0.base] because there is no mapped edge [2019-12-07 17:17:42,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1041] [1041] L862-1-->L864: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t336~0.base_13| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t336~0.base_13|) |v_ULTIMATE.start_main_~#t336~0.offset_11| 3)) |v_#memory_int_19|) (= 0 (select |v_#valid_50| |v_ULTIMATE.start_main_~#t336~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t336~0.base_13|)) (= |v_#valid_49| (store |v_#valid_50| |v_ULTIMATE.start_main_~#t336~0.base_13| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t336~0.base_13| 4) |v_#length_23|) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t336~0.base_13|) (= |v_ULTIMATE.start_main_~#t336~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, ULTIMATE.start_main_~#t336~0.base=|v_ULTIMATE.start_main_~#t336~0.base_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t336~0.offset=|v_ULTIMATE.start_main_~#t336~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t336~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t336~0.offset, #length] because there is no mapped edge [2019-12-07 17:17:42,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [913] [913] L4-->L820: Formula: (and (= v_~z$r_buff0_thd3~0_44 v_~z$r_buff1_thd3~0_30) (not (= v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14 0)) (= v_~z$r_buff0_thd2~0_10 v_~z$r_buff1_thd2~0_10) (= v_~weak$$choice2~0_39 v_~z$flush_delayed~0_19) (= v_~z$r_buff0_thd1~0_10 v_~z$r_buff1_thd1~0_10) (= v_~z$r_buff0_thd4~0_79 v_~z$r_buff1_thd4~0_44) (= |v_P3Thread1of1ForFork3_#t~nondet27_18| v_~weak$$choice2~0_39) (= |v_P3Thread1of1ForFork3_#t~nondet26_18| v_~weak$$choice0~0_13) (= v_~z$r_buff0_thd0~0_36 v_~z$r_buff1_thd0~0_17) (= v_~z$mem_tmp~0_15 v_~z~0_31) (= v_~z$r_buff0_thd4~0_78 1)) InVars {P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_18|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_79, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_18|} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, P3Thread1of1ForFork3_#t~nondet26=|v_P3Thread1of1ForFork3_#t~nondet26_17|, P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_14, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_44, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_30, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_10, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ~weak$$choice0~0=v_~weak$$choice0~0_13, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_36, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_10, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_78, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_44, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_39, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_10, P3Thread1of1ForFork3_#t~nondet27=|v_P3Thread1of1ForFork3_#t~nondet27_17|} AuxVars[] AssignedVars[~z$mem_tmp~0, P3Thread1of1ForFork3_#t~nondet26, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0, P3Thread1of1ForFork3_#t~nondet27] because there is no mapped edge [2019-12-07 17:17:42,481 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L820-2-->L820-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork3_#t~ite29_Out1987295334| |P3Thread1of1ForFork3_#t~ite28_Out1987295334|)) (.cse2 (= (mod ~z$w_buff0_used~0_In1987295334 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1987295334 256)))) (or (and (= ~z$w_buff0~0_In1987295334 |P3Thread1of1ForFork3_#t~ite28_Out1987295334|) (not .cse0) .cse1 (not .cse2)) (and (= ~z$w_buff1~0_In1987295334 |P3Thread1of1ForFork3_#t~ite28_Out1987295334|) .cse1 (or .cse2 .cse0)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In1987295334, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1987295334, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1987295334, ~z$w_buff1~0=~z$w_buff1~0_In1987295334} OutVars{P3Thread1of1ForFork3_#t~ite29=|P3Thread1of1ForFork3_#t~ite29_Out1987295334|, P3Thread1of1ForFork3_#t~ite28=|P3Thread1of1ForFork3_#t~ite28_Out1987295334|, ~z$w_buff0~0=~z$w_buff0~0_In1987295334, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1987295334, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1987295334, ~z$w_buff1~0=~z$w_buff1~0_In1987295334} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite29, P3Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-07 17:17:42,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [957] [957] L825-->L826: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~z$r_buff0_thd4~0_139 v_~z$r_buff0_thd4~0_138)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_139, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P3Thread1of1ForFork3_#t~ite42=|v_P3Thread1of1ForFork3_#t~ite42_6|, P3Thread1of1ForFork3_#t~ite43=|v_P3Thread1of1ForFork3_#t~ite43_9|, P3Thread1of1ForFork3_#t~ite44=|v_P3Thread1of1ForFork3_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_138, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite42, P3Thread1of1ForFork3_#t~ite43, P3Thread1of1ForFork3_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:42,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L828-->L828-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1238653789 256)))) (or (and .cse0 (= ~z~0_In1238653789 |P3Thread1of1ForFork3_#t~ite48_Out1238653789|)) (and (= ~z$mem_tmp~0_In1238653789 |P3Thread1of1ForFork3_#t~ite48_Out1238653789|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1238653789, ~z$flush_delayed~0=~z$flush_delayed~0_In1238653789, ~z~0=~z~0_In1238653789} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1238653789, P3Thread1of1ForFork3_#t~ite48=|P3Thread1of1ForFork3_#t~ite48_Out1238653789|, ~z$flush_delayed~0=~z$flush_delayed~0_In1238653789, ~z~0=~z~0_In1238653789} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite48] because there is no mapped edge [2019-12-07 17:17:42,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.offset_7 |v_P0Thread1of1ForFork0_#in~arg.offset_9|) (= v_~x~0_12 v_~__unbuffered_p0_EAX~0_12) (= v_~a~0_15 1) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.base_7 |v_P0Thread1of1ForFork0_#in~arg.base_9|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78, ~x~0=v_~x~0_12} OutVars{~a~0=v_~a~0_15, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_9|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_7, ~x~0=v_~x~0_12, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_7} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 17:17:42,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] P1ENTRY-->P1EXIT: Formula: (and (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_12|) (= |v_P1Thread1of1ForFork1_#in~arg.offset_12| v_P1Thread1of1ForFork1_~arg.offset_10) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= v_~x~0_19 1) (= v_~__unbuffered_p1_EBX~0_21 v_~y~0_49) (= v_~x~0_19 v_~__unbuffered_p1_EAX~0_21) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101, ~y~0=v_~y~0_49} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_21, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_12|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, ~y~0=v_~y~0_49, ~x~0=v_~x~0_19, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, ~__unbuffered_p1_EBX~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 17:17:42,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L790-->L790-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-592462084 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite25_Out-592462084| ~z$mem_tmp~0_In-592462084) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork2_#t~ite25_Out-592462084| ~z~0_In-592462084)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-592462084, ~z$flush_delayed~0=~z$flush_delayed~0_In-592462084, ~z~0=~z~0_In-592462084} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-592462084, P2Thread1of1ForFork2_#t~ite25=|P2Thread1of1ForFork2_#t~ite25_Out-592462084|, ~z$flush_delayed~0=~z$flush_delayed~0_In-592462084, ~z~0=~z~0_In-592462084} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-07 17:17:42,492 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] L790-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= v_~z~0_156 |v_P2Thread1of1ForFork2_#t~ite25_54|) (= 0 v_~z$flush_delayed~0_114)) InVars {P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P2Thread1of1ForFork2_#t~ite25=|v_P2Thread1of1ForFork2_#t~ite25_53|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, ~z$flush_delayed~0=v_~z$flush_delayed~0_114, ~z~0=v_~z~0_156, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite25, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 17:17:42,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1835462469 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1835462469 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1835462469 |P3Thread1of1ForFork3_#t~ite51_Out-1835462469|)) (and (= 0 |P3Thread1of1ForFork3_#t~ite51_Out-1835462469|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1835462469, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1835462469} OutVars{P3Thread1of1ForFork3_#t~ite51=|P3Thread1of1ForFork3_#t~ite51_Out-1835462469|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1835462469, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1835462469} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite51] because there is no mapped edge [2019-12-07 17:17:42,493 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L837-->L837-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-383004899 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-383004899 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-383004899 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-383004899 256)))) (or (and (= |P3Thread1of1ForFork3_#t~ite52_Out-383004899| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite52_Out-383004899| ~z$w_buff1_used~0_In-383004899)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899} OutVars{P3Thread1of1ForFork3_#t~ite52=|P3Thread1of1ForFork3_#t~ite52_Out-383004899|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-383004899, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-383004899, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-383004899, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-383004899} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite52] because there is no mapped edge [2019-12-07 17:17:42,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L838-->L839: Formula: (let ((.cse1 (= ~z$r_buff0_thd4~0_Out1978311708 ~z$r_buff0_thd4~0_In1978311708)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1978311708 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In1978311708 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~z$r_buff0_thd4~0_Out1978311708 0) (not .cse2) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1978311708, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1978311708} OutVars{P3Thread1of1ForFork3_#t~ite53=|P3Thread1of1ForFork3_#t~ite53_Out1978311708|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1978311708, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1978311708} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 17:17:42,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L839-->L839-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In2017959808 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In2017959808 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd4~0_In2017959808 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In2017959808 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite54_Out2017959808| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork3_#t~ite54_Out2017959808| ~z$r_buff1_thd4~0_In2017959808)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2017959808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2017959808, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2017959808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017959808} OutVars{P3Thread1of1ForFork3_#t~ite54=|P3Thread1of1ForFork3_#t~ite54_Out2017959808|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In2017959808, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2017959808, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2017959808, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2017959808} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54] because there is no mapped edge [2019-12-07 17:17:42,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L839-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork3_#res.base_3|) (= |v_P3Thread1of1ForFork3_#t~ite54_34| v_~z$r_buff1_thd4~0_277) (= 0 |v_P3Thread1of1ForFork3_#res.offset_3|) (= v_~__unbuffered_cnt~0_116 (+ v_~__unbuffered_cnt~0_117 1))) InVars {P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_117} OutVars{P3Thread1of1ForFork3_#t~ite54=|v_P3Thread1of1ForFork3_#t~ite54_33|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_277, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_3|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite54, ~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-07 17:17:42,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L864-1-->L870: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 4 v_~__unbuffered_cnt~0_32) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_32, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:17:42,494 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L870-2-->L870-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In-709854807 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-709854807 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out-709854807| ~z~0_In-709854807)) (and (not .cse0) (= ~z$w_buff1~0_In-709854807 |ULTIMATE.start_main_#t~ite59_Out-709854807|) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-709854807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-709854807, ~z$w_buff1~0=~z$w_buff1~0_In-709854807, ~z~0=~z~0_In-709854807} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-709854807, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-709854807, ~z$w_buff1~0=~z$w_buff1~0_In-709854807, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-709854807|, ~z~0=~z~0_In-709854807} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 17:17:42,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] L870-4-->L871: Formula: (= v_~z~0_23 |v_ULTIMATE.start_main_#t~ite59_9|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_9|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|, ~z~0=v_~z~0_23} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 17:17:42,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L871-->L871-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2010509751 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In2010509751 256) 0))) (or (and (= ~z$w_buff0_used~0_In2010509751 |ULTIMATE.start_main_#t~ite61_Out2010509751|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out2010509751|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2010509751, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out2010509751|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2010509751} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 17:17:42,495 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L872-->L872-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1792629238 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In1792629238 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1792629238 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1792629238 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite62_Out1792629238| ~z$w_buff1_used~0_In1792629238) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1792629238|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1792629238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792629238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1792629238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792629238} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1792629238|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1792629238, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1792629238, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1792629238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1792629238} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 17:17:42,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L873-->L873-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-568372031 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-568372031 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-568372031| ~z$r_buff0_thd0~0_In-568372031)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite63_Out-568372031| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-568372031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568372031} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-568372031|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-568372031, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-568372031} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 17:17:42,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L874-->L874-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In-2093842778 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2093842778 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-2093842778 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-2093842778 256)))) (or (and (= ~z$r_buff1_thd0~0_In-2093842778 |ULTIMATE.start_main_#t~ite64_Out-2093842778|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite64_Out-2093842778|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2093842778, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2093842778, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2093842778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2093842778} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-2093842778, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2093842778, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-2093842778, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2093842778, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-2093842778|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 17:17:42,496 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L874-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 1 v_~__unbuffered_p3_EAX~0_36) (= 1 v_~__unbuffered_p1_EAX~0_39) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_62) (= v_~__unbuffered_p1_EBX~0_39 0))) 1 0)) 0 1) v_~main$tmp_guard1~0_25) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_25 256)) (= v_~z$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite64_62|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_62|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_39, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_39, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_36, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_62, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_61|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:17:42,568 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_9a4a5128-ff3f-4123-88ff-1995032e4faa/bin/uautomizer/witness.graphml [2019-12-07 17:17:42,568 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:17:42,569 INFO L168 Benchmark]: Toolchain (without parser) took 240984.87 ms. Allocated memory was 1.0 GB in the beginning and 11.3 GB in the end (delta: 10.2 GB). Free memory was 940.8 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.6 GB. Max. memory is 11.5 GB. [2019-12-07 17:17:42,569 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:17:42,569 INFO L168 Benchmark]: CACSL2BoogieTranslator took 424.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:42,570 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:17:42,570 INFO L168 Benchmark]: Boogie Preprocessor took 27.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:42,570 INFO L168 Benchmark]: RCFGBuilder took 441.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:42,570 INFO L168 Benchmark]: TraceAbstraction took 239955.42 ms. Allocated memory was 1.1 GB in the beginning and 11.3 GB in the end (delta: 10.1 GB). Free memory was 992.8 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.5 GB. Max. memory is 11.5 GB. [2019-12-07 17:17:42,571 INFO L168 Benchmark]: Witness Printer took 92.65 ms. Allocated memory is still 11.3 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-12-07 17:17:42,572 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 424.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 96.5 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -116.9 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.09 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.14 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 441.92 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 992.8 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 239955.42 ms. Allocated memory was 1.1 GB in the beginning and 11.3 GB in the end (delta: 10.1 GB). Free memory was 992.8 MB in the beginning and 4.6 GB in the end (delta: -3.6 GB). Peak memory consumption was 6.5 GB. Max. memory is 11.5 GB. * Witness Printer took 92.65 ms. Allocated memory is still 11.3 GB. Free memory was 4.6 GB in the beginning and 4.6 GB in the end (delta: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.3s, 213 ProgramPointsBefore, 115 ProgramPointsAfterwards, 256 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 11402 VarBasedMoverChecksPositive, 391 VarBasedMoverChecksNegative, 126 SemBasedMoverChecksPositive, 392 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 131114 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L858] FCALL, FORK 0 pthread_create(&t333, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t334, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t335, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] FCALL, FORK 0 pthread_create(&t336, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = z$w_buff0 [L804] 4 z$w_buff0 = 1 [L805] 4 z$w_buff1_used = z$w_buff0_used [L806] 4 z$w_buff0_used = (_Bool)1 [L820] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L821] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L823] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L823] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L824] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L827] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$flush_delayed ? z$mem_tmp : z [L829] 4 z$flush_delayed = (_Bool)0 [L832] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 y = 1 [L778] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L779] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L780] 3 z$flush_delayed = weak$$choice2 [L781] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L783] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L785] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L786] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L788] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L835] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L836] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L837] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __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=3, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L871] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L872] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L873] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 201 locations, 2 error locations. Result: UNSAFE, OverallTime: 239.7s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 64.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6500 SDtfs, 10919 SDslu, 15788 SDs, 0 SdLazy, 7320 SolverSat, 396 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 233 GetRequests, 27 SyntacticMatches, 5 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 617 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=385062occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 154.2s AutomataMinimizationTime, 26 MinimizatonAttempts, 1196038 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1006 NumberOfCodeBlocks, 1006 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 914 ConstructedInterpolants, 0 QuantifiedInterpolants, 225784 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...