./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix021_power.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_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix021_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/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 7cd84424f476a75a642ba1265ba8d2f45e7bcede ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 15:15:26,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:15:26,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:15:26,651 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:15:26,651 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:15:26,652 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:15:26,653 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:15:26,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:15:26,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:15:26,656 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:15:26,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:15:26,657 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:15:26,658 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:15:26,658 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:15:26,659 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:15:26,660 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:15:26,660 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:15:26,661 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:15:26,662 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:15:26,664 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:15:26,665 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:15:26,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:15:26,667 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:15:26,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:15:26,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:15:26,669 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:15:26,669 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:15:26,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:15:26,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:15:26,671 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:15:26,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:15:26,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:15:26,671 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:15:26,672 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:15:26,673 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:15:26,673 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:15:26,673 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:15:26,673 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:15:26,673 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:15:26,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:15:26,674 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:15:26,675 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:15:26,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:15:26,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:15:26,685 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:15:26,685 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:15:26,685 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:15:26,685 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:15:26,685 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:15:26,685 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:15:26,685 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:15:26,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:15:26,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:15:26,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:15:26,687 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:15:26,688 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_b4d305a9-d539-4bcd-a9f0-08e123ffb199/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 -> 7cd84424f476a75a642ba1265ba8d2f45e7bcede [2019-12-07 15:15:26,791 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:15:26,800 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:15:26,803 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:15:26,805 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:15:26,805 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:15:26,806 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix021_power.opt.i [2019-12-07 15:15:26,851 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/data/b5f9ec41a/a9fc5dcc61ac464eb2f7b8d219ee45db/FLAGb2723870d [2019-12-07 15:15:27,325 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:15:27,325 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/sv-benchmarks/c/pthread-wmm/mix021_power.opt.i [2019-12-07 15:15:27,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/data/b5f9ec41a/a9fc5dcc61ac464eb2f7b8d219ee45db/FLAGb2723870d [2019-12-07 15:15:27,641 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/data/b5f9ec41a/a9fc5dcc61ac464eb2f7b8d219ee45db [2019-12-07 15:15:27,647 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:15:27,650 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:15:27,652 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:15:27,652 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:15:27,657 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:15:27,657 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:15:27" (1/1) ... [2019-12-07 15:15:27,659 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c19867b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:27, skipping insertion in model container [2019-12-07 15:15:27,659 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:15:27" (1/1) ... [2019-12-07 15:15:27,664 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:15:27,694 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:15:27,971 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:15:27,980 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:15:28,034 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:15:28,079 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:15:28,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28 WrapperNode [2019-12-07 15:15:28,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:15:28,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:15:28,080 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:15:28,080 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:15:28,086 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,100 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:15:28,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:15:28,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:15:28,122 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:15:28,129 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,133 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,133 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,145 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... [2019-12-07 15:15:28,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:15:28,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:15:28,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:15:28,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:15:28,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/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 15:15:28,192 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:15:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:15:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 15:15:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 15:15:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 15:15:28,193 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 15:15:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:15:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:15:28,194 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:15:28,195 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 15:15:28,589 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:15:28,589 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:15:28,590 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:15:28 BoogieIcfgContainer [2019-12-07 15:15:28,590 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:15:28,590 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:15:28,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:15:28,593 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:15:28,593 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:15:27" (1/3) ... [2019-12-07 15:15:28,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc15690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:15:28, skipping insertion in model container [2019-12-07 15:15:28,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:15:28" (2/3) ... [2019-12-07 15:15:28,594 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc15690 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:15:28, skipping insertion in model container [2019-12-07 15:15:28,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:15:28" (3/3) ... [2019-12-07 15:15:28,596 INFO L109 eAbstractionObserver]: Analyzing ICFG mix021_power.opt.i [2019-12-07 15:15:28,603 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:15:28,603 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:15:28,608 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:15:28,608 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:15:28,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,636 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,637 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,637 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,637 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,638 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,638 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,638 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,639 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,640 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,641 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,642 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,643 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,644 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,645 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,649 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,650 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,651 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,652 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,653 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,654 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,655 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,656 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,657 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,658 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,659 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,660 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,661 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:15:28,673 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 15:15:28,685 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:15:28,686 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:15:28,686 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:15:28,686 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:15:28,686 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:15:28,686 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:15:28,686 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:15:28,686 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:15:28,699 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 210 places, 253 transitions [2019-12-07 15:15:28,700 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 15:15:28,765 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 15:15:28,765 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:15:28,777 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 15:15:28,801 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 210 places, 253 transitions [2019-12-07 15:15:28,837 INFO L134 PetriNetUnfolder]: 56/249 cut-off events. [2019-12-07 15:15:28,837 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:15:28,846 INFO L76 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 249 events. 56/249 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 925 event pairs. 12/203 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 15:15:28,872 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 15:15:28,873 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:15:32,552 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 15:15:32,794 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-07 15:15:32,907 INFO L206 etLargeBlockEncoding]: Checked pairs total: 146481 [2019-12-07 15:15:32,907 INFO L214 etLargeBlockEncoding]: Total number of compositions: 131 [2019-12-07 15:15:32,909 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 115 places, 135 transitions [2019-12-07 15:15:41,009 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 93550 states. [2019-12-07 15:15:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 93550 states. [2019-12-07 15:15:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 15:15:41,015 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:41,015 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:15:41,016 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:41,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:41,020 INFO L82 PathProgramCache]: Analyzing trace with hash 155254263, now seen corresponding path program 1 times [2019-12-07 15:15:41,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:41,025 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797838857] [2019-12-07 15:15:41,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:41,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:41,178 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 15:15:41,178 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797838857] [2019-12-07 15:15:41,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:15:41,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:15:41,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682450131] [2019-12-07 15:15:41,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:15:41,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:41,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:15:41,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:15:41,193 INFO L87 Difference]: Start difference. First operand 93550 states. Second operand 3 states. [2019-12-07 15:15:41,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:41,909 INFO L93 Difference]: Finished difference Result 92966 states and 426320 transitions. [2019-12-07 15:15:41,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:15:41,911 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 15:15:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:42,367 INFO L225 Difference]: With dead ends: 92966 [2019-12-07 15:15:42,367 INFO L226 Difference]: Without dead ends: 86602 [2019-12-07 15:15:42,368 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 15:15:43,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86602 states. [2019-12-07 15:15:45,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86602 to 86602. [2019-12-07 15:15:45,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86602 states. [2019-12-07 15:15:45,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86602 states to 86602 states and 396876 transitions. [2019-12-07 15:15:45,402 INFO L78 Accepts]: Start accepts. Automaton has 86602 states and 396876 transitions. Word has length 9 [2019-12-07 15:15:45,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:45,403 INFO L462 AbstractCegarLoop]: Abstraction has 86602 states and 396876 transitions. [2019-12-07 15:15:45,404 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:15:45,404 INFO L276 IsEmpty]: Start isEmpty. Operand 86602 states and 396876 transitions. [2019-12-07 15:15:45,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:15:45,408 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:45,409 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:15:45,409 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:45,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1923219547, now seen corresponding path program 1 times [2019-12-07 15:15:45,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:45,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927638378] [2019-12-07 15:15:45,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:45,468 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 15:15:45,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927638378] [2019-12-07 15:15:45,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:15:45,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:15:45,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296097741] [2019-12-07 15:15:45,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:15:45,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:45,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:15:45,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:15:45,470 INFO L87 Difference]: Start difference. First operand 86602 states and 396876 transitions. Second operand 4 states. [2019-12-07 15:15:47,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:47,613 INFO L93 Difference]: Finished difference Result 138074 states and 610572 transitions. [2019-12-07 15:15:47,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:15:47,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 15:15:47,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:48,064 INFO L225 Difference]: With dead ends: 138074 [2019-12-07 15:15:48,065 INFO L226 Difference]: Without dead ends: 138002 [2019-12-07 15:15:48,065 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 15:15:49,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138002 states. [2019-12-07 15:15:51,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138002 to 133994. [2019-12-07 15:15:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133994 states. [2019-12-07 15:15:52,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133994 states to 133994 states and 595808 transitions. [2019-12-07 15:15:52,009 INFO L78 Accepts]: Start accepts. Automaton has 133994 states and 595808 transitions. Word has length 15 [2019-12-07 15:15:52,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:15:52,009 INFO L462 AbstractCegarLoop]: Abstraction has 133994 states and 595808 transitions. [2019-12-07 15:15:52,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:15:52,009 INFO L276 IsEmpty]: Start isEmpty. Operand 133994 states and 595808 transitions. [2019-12-07 15:15:52,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 15:15:52,014 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:15:52,014 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 15:15:52,015 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:15:52,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:15:52,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1961000002, now seen corresponding path program 1 times [2019-12-07 15:15:52,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:15:52,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801241718] [2019-12-07 15:15:52,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:15:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:15:52,061 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 15:15:52,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801241718] [2019-12-07 15:15:52,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:15:52,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:15:52,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610837909] [2019-12-07 15:15:52,062 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:15:52,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:15:52,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:15:52,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:15:52,062 INFO L87 Difference]: Start difference. First operand 133994 states and 595808 transitions. Second operand 4 states. [2019-12-07 15:15:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:15:53,295 INFO L93 Difference]: Finished difference Result 171690 states and 753612 transitions. [2019-12-07 15:15:53,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:15:53,295 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 15:15:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:15:53,792 INFO L225 Difference]: With dead ends: 171690 [2019-12-07 15:15:53,792 INFO L226 Difference]: Without dead ends: 171630 [2019-12-07 15:15:53,792 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 15:15:57,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171630 states. [2019-12-07 15:15:59,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171630 to 153202. [2019-12-07 15:15:59,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153202 states. [2019-12-07 15:16:00,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153202 states to 153202 states and 678068 transitions. [2019-12-07 15:16:00,223 INFO L78 Accepts]: Start accepts. Automaton has 153202 states and 678068 transitions. Word has length 18 [2019-12-07 15:16:00,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:00,223 INFO L462 AbstractCegarLoop]: Abstraction has 153202 states and 678068 transitions. [2019-12-07 15:16:00,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:00,223 INFO L276 IsEmpty]: Start isEmpty. Operand 153202 states and 678068 transitions. [2019-12-07 15:16:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 15:16:00,231 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:00,231 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:16:00,231 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:00,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:00,231 INFO L82 PathProgramCache]: Analyzing trace with hash 661487434, now seen corresponding path program 1 times [2019-12-07 15:16:00,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:00,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514829574] [2019-12-07 15:16:00,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:00,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:00,258 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 15:16:00,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514829574] [2019-12-07 15:16:00,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:00,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:16:00,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610108293] [2019-12-07 15:16:00,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:00,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:00,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:00,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:00,259 INFO L87 Difference]: Start difference. First operand 153202 states and 678068 transitions. Second operand 3 states. [2019-12-07 15:16:01,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:01,582 INFO L93 Difference]: Finished difference Result 255766 states and 1092468 transitions. [2019-12-07 15:16:01,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:01,582 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 15:16:01,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:02,326 INFO L225 Difference]: With dead ends: 255766 [2019-12-07 15:16:02,327 INFO L226 Difference]: Without dead ends: 255766 [2019-12-07 15:16:02,327 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 15:16:04,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255766 states. [2019-12-07 15:16:10,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255766 to 227670. [2019-12-07 15:16:10,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227670 states. [2019-12-07 15:16:11,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227670 states to 227670 states and 984460 transitions. [2019-12-07 15:16:11,763 INFO L78 Accepts]: Start accepts. Automaton has 227670 states and 984460 transitions. Word has length 19 [2019-12-07 15:16:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:11,763 INFO L462 AbstractCegarLoop]: Abstraction has 227670 states and 984460 transitions. [2019-12-07 15:16:11,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 227670 states and 984460 transitions. [2019-12-07 15:16:11,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:16:11,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:11,774 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 15:16:11,774 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:11,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:11,775 INFO L82 PathProgramCache]: Analyzing trace with hash 301900253, now seen corresponding path program 1 times [2019-12-07 15:16:11,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:11,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225069655] [2019-12-07 15:16:11,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:11,817 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 15:16:11,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225069655] [2019-12-07 15:16:11,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:11,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:11,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982126734] [2019-12-07 15:16:11,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:11,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:11,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:11,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:11,818 INFO L87 Difference]: Start difference. First operand 227670 states and 984460 transitions. Second operand 3 states. [2019-12-07 15:16:12,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:12,970 INFO L93 Difference]: Finished difference Result 227670 states and 973664 transitions. [2019-12-07 15:16:12,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:12,971 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 15:16:12,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:13,631 INFO L225 Difference]: With dead ends: 227670 [2019-12-07 15:16:13,631 INFO L226 Difference]: Without dead ends: 227670 [2019-12-07 15:16:13,632 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 15:16:16,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227670 states. [2019-12-07 15:16:22,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227670 to 225646. [2019-12-07 15:16:22,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225646 states. [2019-12-07 15:16:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225646 states to 225646 states and 965864 transitions. [2019-12-07 15:16:23,316 INFO L78 Accepts]: Start accepts. Automaton has 225646 states and 965864 transitions. Word has length 20 [2019-12-07 15:16:23,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:23,317 INFO L462 AbstractCegarLoop]: Abstraction has 225646 states and 965864 transitions. [2019-12-07 15:16:23,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:23,317 INFO L276 IsEmpty]: Start isEmpty. Operand 225646 states and 965864 transitions. [2019-12-07 15:16:23,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 15:16:23,326 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:23,326 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 15:16:23,326 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:23,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:23,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1488828346, now seen corresponding path program 1 times [2019-12-07 15:16:23,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:23,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48875090] [2019-12-07 15:16:23,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:23,397 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 15:16:23,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48875090] [2019-12-07 15:16:23,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:23,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:16:23,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712518311] [2019-12-07 15:16:23,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:23,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:23,399 INFO L87 Difference]: Start difference. First operand 225646 states and 965864 transitions. Second operand 3 states. [2019-12-07 15:16:25,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:25,673 INFO L93 Difference]: Finished difference Result 392289 states and 1609867 transitions. [2019-12-07 15:16:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:16:25,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 15:16:25,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:26,685 INFO L225 Difference]: With dead ends: 392289 [2019-12-07 15:16:26,686 INFO L226 Difference]: Without dead ends: 390867 [2019-12-07 15:16:26,686 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 15:16:29,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390867 states. [2019-12-07 15:16:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390867 to 376641. [2019-12-07 15:16:36,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376641 states. [2019-12-07 15:16:43,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376641 states to 376641 states and 1560668 transitions. [2019-12-07 15:16:43,099 INFO L78 Accepts]: Start accepts. Automaton has 376641 states and 1560668 transitions. Word has length 20 [2019-12-07 15:16:43,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:43,099 INFO L462 AbstractCegarLoop]: Abstraction has 376641 states and 1560668 transitions. [2019-12-07 15:16:43,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:16:43,099 INFO L276 IsEmpty]: Start isEmpty. Operand 376641 states and 1560668 transitions. [2019-12-07 15:16:43,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:16:43,118 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:43,118 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 15:16:43,118 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1251839182, now seen corresponding path program 1 times [2019-12-07 15:16:43,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:43,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835385537] [2019-12-07 15:16:43,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:43,157 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 15:16:43,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835385537] [2019-12-07 15:16:43,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:43,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:43,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902215068] [2019-12-07 15:16:43,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:16:43,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:16:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:16:43,159 INFO L87 Difference]: Start difference. First operand 376641 states and 1560668 transitions. Second operand 4 states. [2019-12-07 15:16:45,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:16:45,674 INFO L93 Difference]: Finished difference Result 465181 states and 1907392 transitions. [2019-12-07 15:16:45,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:16:45,675 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 15:16:45,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:16:47,340 INFO L225 Difference]: With dead ends: 465181 [2019-12-07 15:16:47,340 INFO L226 Difference]: Without dead ends: 465109 [2019-12-07 15:16:47,340 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 15:16:50,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465109 states. [2019-12-07 15:16:56,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465109 to 381324. [2019-12-07 15:16:56,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381324 states. [2019-12-07 15:16:58,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381324 states to 381324 states and 1579994 transitions. [2019-12-07 15:16:58,346 INFO L78 Accepts]: Start accepts. Automaton has 381324 states and 1579994 transitions. Word has length 21 [2019-12-07 15:16:58,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:16:58,346 INFO L462 AbstractCegarLoop]: Abstraction has 381324 states and 1579994 transitions. [2019-12-07 15:16:58,346 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:16:58,346 INFO L276 IsEmpty]: Start isEmpty. Operand 381324 states and 1579994 transitions. [2019-12-07 15:16:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 15:16:58,365 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:16:58,365 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 15:16:58,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:16:58,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:16:58,366 INFO L82 PathProgramCache]: Analyzing trace with hash 1027281216, now seen corresponding path program 1 times [2019-12-07 15:16:58,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:16:58,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097681348] [2019-12-07 15:16:58,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:16:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:16:58,390 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 15:16:58,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097681348] [2019-12-07 15:16:58,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:16:58,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:16:58,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417405114] [2019-12-07 15:16:58,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:16:58,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:16:58,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:16:58,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:16:58,392 INFO L87 Difference]: Start difference. First operand 381324 states and 1579994 transitions. Second operand 3 states. [2019-12-07 15:17:03,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:03,256 INFO L93 Difference]: Finished difference Result 319676 states and 1263297 transitions. [2019-12-07 15:17:03,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:17:03,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 15:17:03,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:04,031 INFO L225 Difference]: With dead ends: 319676 [2019-12-07 15:17:04,032 INFO L226 Difference]: Without dead ends: 319676 [2019-12-07 15:17:04,032 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 15:17:06,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319676 states. [2019-12-07 15:17:10,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319676 to 319676. [2019-12-07 15:17:10,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319676 states. [2019-12-07 15:17:11,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319676 states to 319676 states and 1263297 transitions. [2019-12-07 15:17:11,624 INFO L78 Accepts]: Start accepts. Automaton has 319676 states and 1263297 transitions. Word has length 21 [2019-12-07 15:17:11,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:11,625 INFO L462 AbstractCegarLoop]: Abstraction has 319676 states and 1263297 transitions. [2019-12-07 15:17:11,625 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:17:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand 319676 states and 1263297 transitions. [2019-12-07 15:17:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:17:11,642 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:11,642 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] [2019-12-07 15:17:11,642 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:11,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:11,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1200590819, now seen corresponding path program 1 times [2019-12-07 15:17:11,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:11,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770873220] [2019-12-07 15:17:11,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:11,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:11,670 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 15:17:11,670 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770873220] [2019-12-07 15:17:11,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:11,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:17:11,671 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416759680] [2019-12-07 15:17:11,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:17:11,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:11,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:17:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:17:11,671 INFO L87 Difference]: Start difference. First operand 319676 states and 1263297 transitions. Second operand 3 states. [2019-12-07 15:17:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:14,023 INFO L93 Difference]: Finished difference Result 423180 states and 1593177 transitions. [2019-12-07 15:17:14,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:17:14,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 15:17:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:14,771 INFO L225 Difference]: With dead ends: 423180 [2019-12-07 15:17:14,771 INFO L226 Difference]: Without dead ends: 320684 [2019-12-07 15:17:14,771 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 15:17:17,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320684 states. [2019-12-07 15:17:20,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320684 to 269178. [2019-12-07 15:17:20,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269178 states. [2019-12-07 15:17:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269178 states to 269178 states and 947222 transitions. [2019-12-07 15:17:21,784 INFO L78 Accepts]: Start accepts. Automaton has 269178 states and 947222 transitions. Word has length 22 [2019-12-07 15:17:21,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:21,784 INFO L462 AbstractCegarLoop]: Abstraction has 269178 states and 947222 transitions. [2019-12-07 15:17:21,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:17:21,784 INFO L276 IsEmpty]: Start isEmpty. Operand 269178 states and 947222 transitions. [2019-12-07 15:17:21,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 15:17:21,799 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:21,799 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] [2019-12-07 15:17:21,799 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:21,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:21,799 INFO L82 PathProgramCache]: Analyzing trace with hash -468870348, now seen corresponding path program 1 times [2019-12-07 15:17:21,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:21,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062707721] [2019-12-07 15:17:21,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:21,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:21,832 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 15:17:21,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062707721] [2019-12-07 15:17:21,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:21,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:17:21,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229693986] [2019-12-07 15:17:21,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:17:21,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:21,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:17:21,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:17:21,833 INFO L87 Difference]: Start difference. First operand 269178 states and 947222 transitions. Second operand 3 states. [2019-12-07 15:17:22,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:22,811 INFO L93 Difference]: Finished difference Result 262678 states and 921870 transitions. [2019-12-07 15:17:22,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:17:22,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 15:17:22,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:23,376 INFO L225 Difference]: With dead ends: 262678 [2019-12-07 15:17:23,376 INFO L226 Difference]: Without dead ends: 262678 [2019-12-07 15:17:23,376 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 15:17:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262678 states. [2019-12-07 15:17:30,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262678 to 194517. [2019-12-07 15:17:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194517 states. [2019-12-07 15:17:30,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194517 states to 194517 states and 692515 transitions. [2019-12-07 15:17:30,857 INFO L78 Accepts]: Start accepts. Automaton has 194517 states and 692515 transitions. Word has length 22 [2019-12-07 15:17:30,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:30,857 INFO L462 AbstractCegarLoop]: Abstraction has 194517 states and 692515 transitions. [2019-12-07 15:17:30,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:17:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 194517 states and 692515 transitions. [2019-12-07 15:17:30,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 15:17:30,879 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:30,880 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] [2019-12-07 15:17:30,880 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:30,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:30,880 INFO L82 PathProgramCache]: Analyzing trace with hash -342281171, now seen corresponding path program 1 times [2019-12-07 15:17:30,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:30,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415562426] [2019-12-07 15:17:30,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:30,919 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 15:17:30,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415562426] [2019-12-07 15:17:30,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:30,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:17:30,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200622429] [2019-12-07 15:17:30,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:17:30,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:30,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:17:30,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:17:30,920 INFO L87 Difference]: Start difference. First operand 194517 states and 692515 transitions. Second operand 5 states. [2019-12-07 15:17:32,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:32,615 INFO L93 Difference]: Finished difference Result 276451 states and 964218 transitions. [2019-12-07 15:17:32,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:17:32,615 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 15:17:32,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:33,202 INFO L225 Difference]: With dead ends: 276451 [2019-12-07 15:17:33,202 INFO L226 Difference]: Without dead ends: 276213 [2019-12-07 15:17:33,203 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 15:17:35,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276213 states. [2019-12-07 15:17:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276213 to 211333. [2019-12-07 15:17:38,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211333 states. [2019-12-07 15:17:39,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211333 states to 211333 states and 750844 transitions. [2019-12-07 15:17:39,033 INFO L78 Accepts]: Start accepts. Automaton has 211333 states and 750844 transitions. Word has length 25 [2019-12-07 15:17:39,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:39,033 INFO L462 AbstractCegarLoop]: Abstraction has 211333 states and 750844 transitions. [2019-12-07 15:17:39,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:17:39,033 INFO L276 IsEmpty]: Start isEmpty. Operand 211333 states and 750844 transitions. [2019-12-07 15:17:39,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:17:39,072 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:39,072 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] [2019-12-07 15:17:39,072 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:39,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:39,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1997113759, now seen corresponding path program 1 times [2019-12-07 15:17:39,072 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:39,073 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100381710] [2019-12-07 15:17:39,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:39,115 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 15:17:39,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100381710] [2019-12-07 15:17:39,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:39,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:17:39,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58570636] [2019-12-07 15:17:39,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:17:39,116 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:39,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:17:39,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:17:39,117 INFO L87 Difference]: Start difference. First operand 211333 states and 750844 transitions. Second operand 5 states. [2019-12-07 15:17:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:40,904 INFO L93 Difference]: Finished difference Result 289698 states and 1009412 transitions. [2019-12-07 15:17:40,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 15:17:40,904 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 15:17:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:41,516 INFO L225 Difference]: With dead ends: 289698 [2019-12-07 15:17:41,516 INFO L226 Difference]: Without dead ends: 289203 [2019-12-07 15:17:41,517 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 15:17:43,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289203 states. [2019-12-07 15:17:47,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289203 to 198244. [2019-12-07 15:17:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198244 states. [2019-12-07 15:17:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198244 states to 198244 states and 704182 transitions. [2019-12-07 15:17:47,615 INFO L78 Accepts]: Start accepts. Automaton has 198244 states and 704182 transitions. Word has length 28 [2019-12-07 15:17:47,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:47,615 INFO L462 AbstractCegarLoop]: Abstraction has 198244 states and 704182 transitions. [2019-12-07 15:17:47,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:17:47,615 INFO L276 IsEmpty]: Start isEmpty. Operand 198244 states and 704182 transitions. [2019-12-07 15:17:47,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 15:17:47,740 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:47,740 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 15:17:47,740 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:47,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:47,741 INFO L82 PathProgramCache]: Analyzing trace with hash -1648973845, now seen corresponding path program 1 times [2019-12-07 15:17:47,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:47,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094663524] [2019-12-07 15:17:47,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:47,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:47,773 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 15:17:47,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094663524] [2019-12-07 15:17:47,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:47,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:17:47,774 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006735274] [2019-12-07 15:17:47,774 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:17:47,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:47,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:17:47,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:17:47,775 INFO L87 Difference]: Start difference. First operand 198244 states and 704182 transitions. Second operand 4 states. [2019-12-07 15:17:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:48,056 INFO L93 Difference]: Finished difference Result 85077 states and 273632 transitions. [2019-12-07 15:17:48,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:17:48,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 15:17:48,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:48,194 INFO L225 Difference]: With dead ends: 85077 [2019-12-07 15:17:48,194 INFO L226 Difference]: Without dead ends: 85077 [2019-12-07 15:17:48,195 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 15:17:49,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85077 states. [2019-12-07 15:17:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85077 to 84907. [2019-12-07 15:17:49,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84907 states. [2019-12-07 15:17:50,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84907 states to 84907 states and 273248 transitions. [2019-12-07 15:17:50,016 INFO L78 Accepts]: Start accepts. Automaton has 84907 states and 273248 transitions. Word has length 36 [2019-12-07 15:17:50,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:50,016 INFO L462 AbstractCegarLoop]: Abstraction has 84907 states and 273248 transitions. [2019-12-07 15:17:50,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:17:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 84907 states and 273248 transitions. [2019-12-07 15:17:50,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 15:17:50,057 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:50,058 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 15:17:50,058 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:50,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1946767640, now seen corresponding path program 1 times [2019-12-07 15:17:50,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:50,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656383123] [2019-12-07 15:17:50,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:50,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:50,104 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 15:17:50,105 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656383123] [2019-12-07 15:17:50,105 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:50,105 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:17:50,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959703462] [2019-12-07 15:17:50,105 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:17:50,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:50,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:17:50,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:17:50,106 INFO L87 Difference]: Start difference. First operand 84907 states and 273248 transitions. Second operand 4 states. [2019-12-07 15:17:50,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:50,568 INFO L93 Difference]: Finished difference Result 147878 states and 474063 transitions. [2019-12-07 15:17:50,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:17:50,568 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 15:17:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:50,673 INFO L225 Difference]: With dead ends: 147878 [2019-12-07 15:17:50,673 INFO L226 Difference]: Without dead ends: 64649 [2019-12-07 15:17:50,673 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 15:17:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64649 states. [2019-12-07 15:17:52,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64649 to 64212. [2019-12-07 15:17:52,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64212 states. [2019-12-07 15:17:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64212 states to 64212 states and 201249 transitions. [2019-12-07 15:17:53,048 INFO L78 Accepts]: Start accepts. Automaton has 64212 states and 201249 transitions. Word has length 37 [2019-12-07 15:17:53,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:53,048 INFO L462 AbstractCegarLoop]: Abstraction has 64212 states and 201249 transitions. [2019-12-07 15:17:53,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:17:53,048 INFO L276 IsEmpty]: Start isEmpty. Operand 64212 states and 201249 transitions. [2019-12-07 15:17:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 15:17:53,082 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:53,082 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 15:17:53,082 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:53,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:53,083 INFO L82 PathProgramCache]: Analyzing trace with hash 2067327712, now seen corresponding path program 1 times [2019-12-07 15:17:53,083 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:53,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111560390] [2019-12-07 15:17:53,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:53,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:53,119 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 15:17:53,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111560390] [2019-12-07 15:17:53,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:53,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:17:53,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575350705] [2019-12-07 15:17:53,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:17:53,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:53,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:17:53,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:17:53,120 INFO L87 Difference]: Start difference. First operand 64212 states and 201249 transitions. Second operand 5 states. [2019-12-07 15:17:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:53,165 INFO L93 Difference]: Finished difference Result 12909 states and 30537 transitions. [2019-12-07 15:17:53,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:17:53,165 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 15:17:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:53,173 INFO L225 Difference]: With dead ends: 12909 [2019-12-07 15:17:53,173 INFO L226 Difference]: Without dead ends: 9514 [2019-12-07 15:17:53,173 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 15:17:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9514 states. [2019-12-07 15:17:53,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9514 to 9386. [2019-12-07 15:17:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9386 states. [2019-12-07 15:17:53,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9386 states to 9386 states and 22102 transitions. [2019-12-07 15:17:53,264 INFO L78 Accepts]: Start accepts. Automaton has 9386 states and 22102 transitions. Word has length 38 [2019-12-07 15:17:53,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:53,264 INFO L462 AbstractCegarLoop]: Abstraction has 9386 states and 22102 transitions. [2019-12-07 15:17:53,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:17:53,264 INFO L276 IsEmpty]: Start isEmpty. Operand 9386 states and 22102 transitions. [2019-12-07 15:17:53,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 15:17:53,270 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:53,270 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 15:17:53,270 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:53,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:53,270 INFO L82 PathProgramCache]: Analyzing trace with hash -616668294, now seen corresponding path program 1 times [2019-12-07 15:17:53,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:53,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725116257] [2019-12-07 15:17:53,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:53,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:53,329 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 15:17:53,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725116257] [2019-12-07 15:17:53,330 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:53,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:17:53,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614959860] [2019-12-07 15:17:53,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:17:53,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:53,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:17:53,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:17:53,330 INFO L87 Difference]: Start difference. First operand 9386 states and 22102 transitions. Second operand 4 states. [2019-12-07 15:17:53,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:53,480 INFO L93 Difference]: Finished difference Result 10640 states and 24699 transitions. [2019-12-07 15:17:53,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:17:53,480 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 15:17:53,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:53,488 INFO L225 Difference]: With dead ends: 10640 [2019-12-07 15:17:53,488 INFO L226 Difference]: Without dead ends: 10640 [2019-12-07 15:17:53,489 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 15:17:53,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10640 states. [2019-12-07 15:17:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10640 to 10136. [2019-12-07 15:17:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10136 states. [2019-12-07 15:17:53,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10136 states to 10136 states and 23659 transitions. [2019-12-07 15:17:53,590 INFO L78 Accepts]: Start accepts. Automaton has 10136 states and 23659 transitions. Word has length 49 [2019-12-07 15:17:53,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:53,590 INFO L462 AbstractCegarLoop]: Abstraction has 10136 states and 23659 transitions. [2019-12-07 15:17:53,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:17:53,590 INFO L276 IsEmpty]: Start isEmpty. Operand 10136 states and 23659 transitions. [2019-12-07 15:17:53,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 15:17:53,596 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:53,596 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] [2019-12-07 15:17:53,597 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:53,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:53,597 INFO L82 PathProgramCache]: Analyzing trace with hash 302664444, now seen corresponding path program 1 times [2019-12-07 15:17:53,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:53,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608370141] [2019-12-07 15:17:53,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:53,646 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 15:17:53,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608370141] [2019-12-07 15:17:53,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:53,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:17:53,647 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444675772] [2019-12-07 15:17:53,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:17:53,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:53,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:17:53,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:17:53,648 INFO L87 Difference]: Start difference. First operand 10136 states and 23659 transitions. Second operand 6 states. [2019-12-07 15:17:53,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:53,686 INFO L93 Difference]: Finished difference Result 7732 states and 18258 transitions. [2019-12-07 15:17:53,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:17:53,686 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-12-07 15:17:53,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:53,689 INFO L225 Difference]: With dead ends: 7732 [2019-12-07 15:17:53,689 INFO L226 Difference]: Without dead ends: 3994 [2019-12-07 15:17:53,690 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 15:17:53,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3994 states. [2019-12-07 15:17:53,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3994 to 3866. [2019-12-07 15:17:53,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3866 states. [2019-12-07 15:17:53,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3866 states to 3866 states and 9109 transitions. [2019-12-07 15:17:53,728 INFO L78 Accepts]: Start accepts. Automaton has 3866 states and 9109 transitions. Word has length 50 [2019-12-07 15:17:53,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:53,728 INFO L462 AbstractCegarLoop]: Abstraction has 3866 states and 9109 transitions. [2019-12-07 15:17:53,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:17:53,728 INFO L276 IsEmpty]: Start isEmpty. Operand 3866 states and 9109 transitions. [2019-12-07 15:17:53,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:17:53,731 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:53,731 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 15:17:53,731 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:53,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:53,731 INFO L82 PathProgramCache]: Analyzing trace with hash -256453500, now seen corresponding path program 1 times [2019-12-07 15:17:53,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:53,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805568905] [2019-12-07 15:17:53,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:53,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:53,810 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 15:17:53,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805568905] [2019-12-07 15:17:53,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:53,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:17:53,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505942346] [2019-12-07 15:17:53,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:17:53,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:53,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:17:53,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:17:53,811 INFO L87 Difference]: Start difference. First operand 3866 states and 9109 transitions. Second operand 6 states. [2019-12-07 15:17:54,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:54,056 INFO L93 Difference]: Finished difference Result 4285 states and 9920 transitions. [2019-12-07 15:17:54,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:17:54,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 15:17:54,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:54,060 INFO L225 Difference]: With dead ends: 4285 [2019-12-07 15:17:54,060 INFO L226 Difference]: Without dead ends: 4285 [2019-12-07 15:17:54,060 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:17:54,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2019-12-07 15:17:54,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 3951. [2019-12-07 15:17:54,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3951 states. [2019-12-07 15:17:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3951 states to 3951 states and 9268 transitions. [2019-12-07 15:17:54,097 INFO L78 Accepts]: Start accepts. Automaton has 3951 states and 9268 transitions. Word has length 65 [2019-12-07 15:17:54,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:54,097 INFO L462 AbstractCegarLoop]: Abstraction has 3951 states and 9268 transitions. [2019-12-07 15:17:54,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:17:54,097 INFO L276 IsEmpty]: Start isEmpty. Operand 3951 states and 9268 transitions. [2019-12-07 15:17:54,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:17:54,099 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:54,100 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 15:17:54,100 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:54,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:54,100 INFO L82 PathProgramCache]: Analyzing trace with hash 2093876492, now seen corresponding path program 2 times [2019-12-07 15:17:54,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:54,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599609800] [2019-12-07 15:17:54,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:54,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:54,177 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 15:17:54,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599609800] [2019-12-07 15:17:54,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:54,178 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:17:54,178 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815556807] [2019-12-07 15:17:54,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:17:54,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:54,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:17:54,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:17:54,178 INFO L87 Difference]: Start difference. First operand 3951 states and 9268 transitions. Second operand 4 states. [2019-12-07 15:17:54,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:54,219 INFO L93 Difference]: Finished difference Result 4476 states and 10449 transitions. [2019-12-07 15:17:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:17:54,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 15:17:54,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:54,223 INFO L225 Difference]: With dead ends: 4476 [2019-12-07 15:17:54,223 INFO L226 Difference]: Without dead ends: 4054 [2019-12-07 15:17:54,223 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 15:17:54,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4054 states. [2019-12-07 15:17:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4054 to 3582. [2019-12-07 15:17:54,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3582 states. [2019-12-07 15:17:54,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3582 states to 3582 states and 8321 transitions. [2019-12-07 15:17:54,257 INFO L78 Accepts]: Start accepts. Automaton has 3582 states and 8321 transitions. Word has length 65 [2019-12-07 15:17:54,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:54,258 INFO L462 AbstractCegarLoop]: Abstraction has 3582 states and 8321 transitions. [2019-12-07 15:17:54,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:17:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 3582 states and 8321 transitions. [2019-12-07 15:17:54,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:17:54,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:54,260 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 15:17:54,260 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:54,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:54,260 INFO L82 PathProgramCache]: Analyzing trace with hash 2004121330, now seen corresponding path program 3 times [2019-12-07 15:17:54,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:54,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259150008] [2019-12-07 15:17:54,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:54,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:54,331 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 15:17:54,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259150008] [2019-12-07 15:17:54,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:54,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:17:54,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209749500] [2019-12-07 15:17:54,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:17:54,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:54,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:17:54,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:17:54,333 INFO L87 Difference]: Start difference. First operand 3582 states and 8321 transitions. Second operand 6 states. [2019-12-07 15:17:54,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:54,652 INFO L93 Difference]: Finished difference Result 4914 states and 11306 transitions. [2019-12-07 15:17:54,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:17:54,652 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-07 15:17:54,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:54,656 INFO L225 Difference]: With dead ends: 4914 [2019-12-07 15:17:54,656 INFO L226 Difference]: Without dead ends: 4914 [2019-12-07 15:17:54,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:17:54,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4914 states. [2019-12-07 15:17:54,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4914 to 3817. [2019-12-07 15:17:54,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3817 states. [2019-12-07 15:17:54,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3817 states to 3817 states and 8887 transitions. [2019-12-07 15:17:54,791 INFO L78 Accepts]: Start accepts. Automaton has 3817 states and 8887 transitions. Word has length 65 [2019-12-07 15:17:54,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:54,791 INFO L462 AbstractCegarLoop]: Abstraction has 3817 states and 8887 transitions. [2019-12-07 15:17:54,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:17:54,791 INFO L276 IsEmpty]: Start isEmpty. Operand 3817 states and 8887 transitions. [2019-12-07 15:17:54,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 15:17:54,794 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:54,794 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 15:17:54,794 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:54,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:54,794 INFO L82 PathProgramCache]: Analyzing trace with hash 814085236, now seen corresponding path program 4 times [2019-12-07 15:17:54,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:54,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828315733] [2019-12-07 15:17:54,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:54,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:54,830 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 15:17:54,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828315733] [2019-12-07 15:17:54,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:54,830 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:17:54,830 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311908281] [2019-12-07 15:17:54,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:17:54,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:54,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:17:54,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:17:54,831 INFO L87 Difference]: Start difference. First operand 3817 states and 8887 transitions. Second operand 5 states. [2019-12-07 15:17:55,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:55,007 INFO L93 Difference]: Finished difference Result 4671 states and 10640 transitions. [2019-12-07 15:17:55,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:17:55,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 15:17:55,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:55,013 INFO L225 Difference]: With dead ends: 4671 [2019-12-07 15:17:55,013 INFO L226 Difference]: Without dead ends: 4671 [2019-12-07 15:17:55,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:17:55,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4671 states. [2019-12-07 15:17:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4671 to 4053. [2019-12-07 15:17:55,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4053 states. [2019-12-07 15:17:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4053 states to 4053 states and 9386 transitions. [2019-12-07 15:17:55,061 INFO L78 Accepts]: Start accepts. Automaton has 4053 states and 9386 transitions. Word has length 65 [2019-12-07 15:17:55,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:55,061 INFO L462 AbstractCegarLoop]: Abstraction has 4053 states and 9386 transitions. [2019-12-07 15:17:55,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:17:55,061 INFO L276 IsEmpty]: Start isEmpty. Operand 4053 states and 9386 transitions. [2019-12-07 15:17:55,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 15:17:55,063 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:55,063 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 15:17:55,064 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:55,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:55,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1338605312, now seen corresponding path program 1 times [2019-12-07 15:17:55,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:55,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76288419] [2019-12-07 15:17:55,064 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:55,131 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 15:17:55,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76288419] [2019-12-07 15:17:55,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:55,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:17:55,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192082038] [2019-12-07 15:17:55,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:17:55,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:55,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:17:55,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:17:55,133 INFO L87 Difference]: Start difference. First operand 4053 states and 9386 transitions. Second operand 5 states. [2019-12-07 15:17:55,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:55,178 INFO L93 Difference]: Finished difference Result 4596 states and 10605 transitions. [2019-12-07 15:17:55,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:17:55,178 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-07 15:17:55,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:55,179 INFO L225 Difference]: With dead ends: 4596 [2019-12-07 15:17:55,179 INFO L226 Difference]: Without dead ends: 599 [2019-12-07 15:17:55,179 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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 15:17:55,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2019-12-07 15:17:55,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2019-12-07 15:17:55,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 599 states. [2019-12-07 15:17:55,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 1291 transitions. [2019-12-07 15:17:55,184 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 1291 transitions. Word has length 66 [2019-12-07 15:17:55,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:55,184 INFO L462 AbstractCegarLoop]: Abstraction has 599 states and 1291 transitions. [2019-12-07 15:17:55,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:17:55,184 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 1291 transitions. [2019-12-07 15:17:55,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 15:17:55,185 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:55,185 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 15:17:55,185 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:55,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:55,185 INFO L82 PathProgramCache]: Analyzing trace with hash 977277596, now seen corresponding path program 2 times [2019-12-07 15:17:55,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:55,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291853235] [2019-12-07 15:17:55,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:55,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:17:55,320 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 15:17:55,320 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291853235] [2019-12-07 15:17:55,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:17:55,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 15:17:55,321 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205517047] [2019-12-07 15:17:55,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 15:17:55,321 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:17:55,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 15:17:55,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:17:55,321 INFO L87 Difference]: Start difference. First operand 599 states and 1291 transitions. Second operand 12 states. [2019-12-07 15:17:55,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:17:55,788 INFO L93 Difference]: Finished difference Result 1039 states and 2206 transitions. [2019-12-07 15:17:55,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-07 15:17:55,788 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-07 15:17:55,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:17:55,789 INFO L225 Difference]: With dead ends: 1039 [2019-12-07 15:17:55,789 INFO L226 Difference]: Without dead ends: 708 [2019-12-07 15:17:55,789 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=448, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:17:55,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-12-07 15:17:55,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 662. [2019-12-07 15:17:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-12-07 15:17:55,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1387 transitions. [2019-12-07 15:17:55,795 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1387 transitions. Word has length 66 [2019-12-07 15:17:55,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:17:55,795 INFO L462 AbstractCegarLoop]: Abstraction has 662 states and 1387 transitions. [2019-12-07 15:17:55,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 15:17:55,795 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1387 transitions. [2019-12-07 15:17:55,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 15:17:55,795 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:17:55,795 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 15:17:55,796 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:17:55,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:17:55,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1081052920, now seen corresponding path program 3 times [2019-12-07 15:17:55,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:17:55,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260507822] [2019-12-07 15:17:55,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:17:55,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:17:55,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:17:55,885 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:17:55,885 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:17:55,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37| 1) |v_#valid_90|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= v_~a~0_37 0) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t557~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t557~0.offset_25|) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t557~0.base_37| 4)) (= v_~z$w_buff0~0_773 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37|) |v_ULTIMATE.start_main_~#t557~0.offset_25| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd0~0_170 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37|) 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_30|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t557~0.base=|v_ULTIMATE.start_main_~#t557~0.base_37|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_~#t557~0.offset=|v_ULTIMATE.start_main_~#t557~0.offset_25|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_22|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_18|, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_23|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_18|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} 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, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t558~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t557~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t557~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t558~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t559~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t560~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t560~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t559~0.offset, #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] because there is no mapped edge [2019-12-07 15:17:55,888 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12|) |v_ULTIMATE.start_main_~#t558~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t558~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t558~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t558~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t558~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t558~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t558~0.base, #length] because there is no mapped edge [2019-12-07 15:17:55,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (not (= |v_ULTIMATE.start_main_~#t559~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t559~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12|) |v_ULTIMATE.start_main_~#t559~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t559~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t559~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_12|, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t559~0.base, ULTIMATE.start_main_~#t559~0.offset] because there is no mapped edge [2019-12-07 15:17:55,889 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t560~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t560~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13|) |v_ULTIMATE.start_main_~#t560~0.offset_11| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t560~0.offset_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t560~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t560~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t560~0.offset] because there is no mapped edge [2019-12-07 15:17:55,890 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 15:17:55,891 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out-395586140| |P3Thread1of1ForFork2_#t~ite29_Out-395586140|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-395586140 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-395586140 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-395586140| ~z$w_buff0~0_In-395586140) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-395586140| ~z$w_buff1~0_In-395586140) .cse2 (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-395586140, ~z$w_buff0~0=~z$w_buff0~0_In-395586140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-395586140, ~z$w_buff1~0=~z$w_buff1~0_In-395586140} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-395586140|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-395586140|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-395586140, ~z$w_buff0~0=~z$w_buff0~0_In-395586140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-395586140, ~z$w_buff1~0=~z$w_buff1~0_In-395586140} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 15:17:55,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:17:55,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1003366729 256) 0))) (or (and (= ~z~0_In-1003366729 |P3Thread1of1ForFork2_#t~ite48_Out-1003366729|) .cse0) (and (= ~z$mem_tmp~0_In-1003366729 |P3Thread1of1ForFork2_#t~ite48_Out-1003366729|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1003366729, ~z$flush_delayed~0=~z$flush_delayed~0_In-1003366729, ~z~0=~z~0_In-1003366729} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1003366729, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1003366729|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1003366729, ~z~0=~z~0_In-1003366729} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 15:17:55,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 15:17:55,896 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 15:17:55,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-922879458 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-922879458 256)))) (or (and (= ~z$w_buff0_used~0_In-922879458 |P3Thread1of1ForFork2_#t~ite51_Out-922879458|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-922879458|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-922879458, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-922879458} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-922879458|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-922879458, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-922879458} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 15:17:55,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1726631923 256)))) (or (and (= ~z~0_In-1726631923 |P2Thread1of1ForFork1_#t~ite25_Out-1726631923|) .cse0) (and (= ~z$mem_tmp~0_In-1726631923 |P2Thread1of1ForFork1_#t~ite25_Out-1726631923|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1726631923, ~z$flush_delayed~0=~z$flush_delayed~0_In-1726631923, ~z~0=~z~0_In-1726631923} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1726631923, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1726631923|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1726631923, ~z~0=~z~0_In-1726631923} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 15:17:55,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:17:55,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-103441924 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-103441924 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-103441924 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-103441924 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-103441924|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-103441924 |P3Thread1of1ForFork2_#t~ite52_Out-103441924|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-103441924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-103441924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-103441924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-103441924} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-103441924|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-103441924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-103441924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-103441924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-103441924} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 15:17:55,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1001372669 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1001372669 256))) (.cse2 (= ~z$r_buff0_thd4~0_In1001372669 ~z$r_buff0_thd4~0_Out1001372669))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1001372669) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1001372669} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1001372669|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1001372669} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:17:55,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-411842922 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-411842922 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-411842922 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-411842922 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-411842922| 0)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out-411842922| ~z$r_buff1_thd4~0_In-411842922) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-411842922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-411842922, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-411842922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411842922} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-411842922|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-411842922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-411842922, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-411842922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411842922} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 15:17:55,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 15:17:55,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:17:55,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out861377350| |ULTIMATE.start_main_#t~ite60_Out861377350|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In861377350 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In861377350 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite59_Out861377350| ~z~0_In861377350)) (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out861377350| ~z$w_buff1~0_In861377350) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In861377350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861377350, ~z$w_buff1~0=~z$w_buff1~0_In861377350, ~z~0=~z~0_In861377350} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out861377350|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In861377350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861377350, ~z$w_buff1~0=~z$w_buff1~0_In861377350, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out861377350|, ~z~0=~z~0_In861377350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:17:55,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1889497564 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1889497564 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1889497564| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out1889497564| ~z$w_buff0_used~0_In1889497564) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1889497564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:17:55,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1179356013 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1179356013 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1179356013 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1179356013 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1179356013 |ULTIMATE.start_main_#t~ite62_Out1179356013|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1179356013|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179356013, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179356013, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1179356013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1179356013} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1179356013|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179356013, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179356013, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1179356013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1179356013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:17:55,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1767637450 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1767637450 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1767637450 |ULTIMATE.start_main_#t~ite63_Out1767637450|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out1767637450|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1767637450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1767637450} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1767637450|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1767637450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1767637450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 15:17:55,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In218757910 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In218757910 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In218757910 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In218757910 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out218757910| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out218757910| ~z$r_buff1_thd0~0_In218757910)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218757910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218757910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218757910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218757910} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218757910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218757910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218757910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218757910, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out218757910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 15:17:55,907 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 15:17:55,971 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:17:55 BasicIcfg [2019-12-07 15:17:55,971 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:17:55,972 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:17:55,972 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:17:55,972 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:17:55,972 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:15:28" (3/4) ... [2019-12-07 15:17:55,974 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:17:55,974 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] ULTIMATE.startENTRY-->L849: Formula: (let ((.cse0 (store |v_#valid_92| 0 0))) (and (= 0 v_~x~0_105) (= 0 v_~z$flush_delayed~0_384) (= v_~z$w_buff1_used~0_989 0) (= 0 v_~__unbuffered_p2_EAX~0_146) (= |v_#NULL.offset_7| 0) (= 0 v_~z$mem_tmp~0_347) (= v_~z$r_buff1_thd2~0_303 0) (< 0 |v_#StackHeapBarrier_21|) (= (store .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37| 1) |v_#valid_90|) (= 0 v_~z$r_buff0_thd3~0_515) (= v_~z$r_buff0_thd2~0_71 0) (= v_~__unbuffered_p3_EAX~0_112 0) (= v_~z$w_buff0_used~0_1397 0) (= v_~main$tmp_guard1~0_91 0) (= v_~weak$$choice2~0_438 0) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd1~0_71 0) (= v_~z$r_buff1_thd0~0_430 0) (= v_~z$r_buff1_thd1~0_299 0) (= 0 v_~weak$$choice0~0_336) (= v_~__unbuffered_cnt~0_142 0) (= v_~z$read_delayed_var~0.base_7 0) (= v_~y~0_119 0) (= v_~z$read_delayed~0_7 0) (= v_~z$w_buff1~0_562 0) (= 0 |v_#NULL.base_7|) (= 0 v_~__unbuffered_p3_EBX~0_93) (= v_~a~0_37 0) (= 0 v_~z$r_buff0_thd4~0_677) (= v_~main$tmp_guard0~0_22 0) (< |v_#StackHeapBarrier_21| |v_ULTIMATE.start_main_~#t557~0.base_37|) (= 0 |v_ULTIMATE.start_main_~#t557~0.offset_25|) (= v_~z~0_307 0) (= 0 v_~z$r_buff1_thd4~0_523) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t557~0.base_37| 4)) (= v_~z$w_buff0~0_773 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t557~0.base_37|) |v_ULTIMATE.start_main_~#t557~0.offset_25| 0)) |v_#memory_int_23|) (= v_~z$r_buff0_thd0~0_170 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t557~0.base_37|) 0) (= 0 v_~z$r_buff1_thd3~0_601))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_21|, #valid=|v_#valid_92|, #memory_int=|v_#memory_int_24|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_10|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_303, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_184|, ~a~0=v_~a~0_37, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_170, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_677, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_112, #length=|v_#length_31|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_30|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_146, ULTIMATE.start_main_~#t557~0.base=|v_ULTIMATE.start_main_~#t557~0.base_37|, ~z$mem_tmp~0=v_~z$mem_tmp~0_347, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_989, ~z$flush_delayed~0=v_~z$flush_delayed~0_384, ULTIMATE.start_main_~#t557~0.offset=|v_ULTIMATE.start_main_~#t557~0.offset_25|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_37|, ~weak$$choice0~0=v_~weak$$choice0~0_336, #StackHeapBarrier=|v_#StackHeapBarrier_21|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_409|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_299, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_515, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_142, ~x~0=v_~x~0_105, ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_17|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_523, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_562, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_91, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_22|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_430, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_18|, ~y~0=v_~y~0_119, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_71, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1397, ~z$w_buff0~0=v_~z$w_buff0~0_773, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_23|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_601, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_43|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_93, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_18|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_45|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_67|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_57|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_307, ~weak$$choice2~0=v_~weak$$choice2~0_438, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_71} 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, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t558~0.base, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t557~0.base, ~z$mem_tmp~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t557~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t558~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t559~0.base, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t560~0.offset, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_~#t560~0.base, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t559~0.offset, #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] because there is no mapped edge [2019-12-07 15:17:55,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L849-1-->L851: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t558~0.base_12|) |v_ULTIMATE.start_main_~#t558~0.offset_10| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12|)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t558~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t558~0.base_12| 1)) (not (= 0 |v_ULTIMATE.start_main_~#t558~0.base_12|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t558~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t558~0.offset_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_14|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t558~0.offset=|v_ULTIMATE.start_main_~#t558~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t558~0.base=|v_ULTIMATE.start_main_~#t558~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t558~0.offset, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t558~0.base, #length] because there is no mapped edge [2019-12-07 15:17:55,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L851-1-->L853: Formula: (and (not (= |v_ULTIMATE.start_main_~#t559~0.base_12| 0)) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12|)) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t559~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t559~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t559~0.base_12|) |v_ULTIMATE.start_main_~#t559~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t559~0.base_12|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t559~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_19|, ULTIMATE.start_main_~#t559~0.base=|v_ULTIMATE.start_main_~#t559~0.base_12|, ULTIMATE.start_main_~#t559~0.offset=|v_ULTIMATE.start_main_~#t559~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t559~0.base, ULTIMATE.start_main_~#t559~0.offset] because there is no mapped edge [2019-12-07 15:17:55,975 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13| 1)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t560~0.base_13|) (= 0 (select |v_#valid_49| |v_ULTIMATE.start_main_~#t560~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t560~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t560~0.base_13|) |v_ULTIMATE.start_main_~#t560~0.offset_11| 3)) |v_#memory_int_15|) (= 0 |v_ULTIMATE.start_main_~#t560~0.offset_11|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t560~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_6|, ULTIMATE.start_main_~#t560~0.base=|v_ULTIMATE.start_main_~#t560~0.base_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, #length=|v_#length_23|, ULTIMATE.start_main_~#t560~0.offset=|v_ULTIMATE.start_main_~#t560~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t560~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t560~0.offset] because there is no mapped edge [2019-12-07 15:17:55,976 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_216 v_~z$w_buff1_used~0_129) (= v_~z$w_buff0~0_91 v_~z$w_buff1~0_66) (= v_P3Thread1of1ForFork2_~arg.offset_32 |v_P3Thread1of1ForFork2_#in~arg.offset_34|) (= v_~z$w_buff0_used~0_215 1) (= 1 v_~z$w_buff0~0_90) (= |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32| (ite (not (and (not (= (mod v_~z$w_buff0_used~0_215 256) 0)) (not (= 0 (mod v_~z$w_buff1_used~0_129 256))))) 1 0)) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 0)) (= |v_P3Thread1of1ForFork2_#in~arg.base_34| v_P3Thread1of1ForFork2_~arg.base_32) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_216, ~z$w_buff0~0=v_~z$w_buff0~0_91, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_34, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_32, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_215, ~z$w_buff0~0=v_~z$w_buff0~0_90, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_129, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_34|, ~z$w_buff1~0=v_~z$w_buff1~0_66, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_32|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_32, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_34|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 15:17:55,977 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L811-2-->L811-5: Formula: (let ((.cse2 (= |P3Thread1of1ForFork2_#t~ite28_Out-395586140| |P3Thread1of1ForFork2_#t~ite29_Out-395586140|)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-395586140 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-395586140 256)))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite28_Out-395586140| ~z$w_buff0~0_In-395586140) (not .cse1) .cse2) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-395586140| ~z$w_buff1~0_In-395586140) .cse2 (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-395586140, ~z$w_buff0~0=~z$w_buff0~0_In-395586140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-395586140, ~z$w_buff1~0=~z$w_buff1~0_In-395586140} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-395586140|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-395586140|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-395586140, ~z$w_buff0~0=~z$w_buff0~0_In-395586140, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-395586140, ~z$w_buff1~0=~z$w_buff1~0_In-395586140} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 15:17:55,980 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L816-->L817: Formula: (and (not (= (mod v_~weak$$choice2~0_78 256) 0)) (= v_~z$r_buff0_thd4~0_135 v_~z$r_buff0_thd4~0_134)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_135, ~weak$$choice2~0=v_~weak$$choice2~0_78} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_134, ~weak$$choice2~0=v_~weak$$choice2~0_78} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:17:55,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L819-->L819-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1003366729 256) 0))) (or (and (= ~z~0_In-1003366729 |P3Thread1of1ForFork2_#t~ite48_Out-1003366729|) .cse0) (and (= ~z$mem_tmp~0_In-1003366729 |P3Thread1of1ForFork2_#t~ite48_Out-1003366729|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1003366729, ~z$flush_delayed~0=~z$flush_delayed~0_In-1003366729, ~z~0=~z~0_In-1003366729} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1003366729, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out-1003366729|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1003366729, ~z~0=~z~0_In-1003366729} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 15:17:55,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_96 1) v_~__unbuffered_cnt~0_95) (= v_~a~0_14 1) (= v_~x~0_22 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|} OutVars{~a~0=v_~a~0_14, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_95, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_22} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 15:17:55,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1018] [1018] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~x~0_15 2) (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= v_~y~0_36 1)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_36, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 15:17:55,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-922879458 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-922879458 256)))) (or (and (= ~z$w_buff0_used~0_In-922879458 |P3Thread1of1ForFork2_#t~ite51_Out-922879458|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P3Thread1of1ForFork2_#t~ite51_Out-922879458|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-922879458, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-922879458} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-922879458|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-922879458, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-922879458} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 15:17:55,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L781-->L781-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1726631923 256)))) (or (and (= ~z~0_In-1726631923 |P2Thread1of1ForFork1_#t~ite25_Out-1726631923|) .cse0) (and (= ~z$mem_tmp~0_In-1726631923 |P2Thread1of1ForFork1_#t~ite25_Out-1726631923|) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1726631923, ~z$flush_delayed~0=~z$flush_delayed~0_In-1726631923, ~z~0=~z~0_In-1726631923} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1726631923, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1726631923|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1726631923, ~z~0=~z~0_In-1726631923} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 15:17:55,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L781-2-->P2EXIT: Formula: (and (= v_~z~0_127 |v_P2Thread1of1ForFork1_#t~ite25_38|) (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_91) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_37|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51, ~z$flush_delayed~0=v_~z$flush_delayed~0_91, ~z~0=v_~z~0_127, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 15:17:55,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L828-->L828-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-103441924 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-103441924 256))) (.cse2 (= (mod ~z$r_buff1_thd4~0_In-103441924 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-103441924 256)))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-103441924|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-103441924 |P3Thread1of1ForFork2_#t~ite52_Out-103441924|)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-103441924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-103441924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-103441924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-103441924} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-103441924|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-103441924, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-103441924, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-103441924, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-103441924} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 15:17:55,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L829-->L830: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1001372669 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1001372669 256))) (.cse2 (= ~z$r_buff0_thd4~0_In1001372669 ~z$r_buff0_thd4~0_Out1001372669))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out1001372669) (not .cse1)) (and .cse0 .cse2) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1001372669} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out1001372669|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1001372669, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out1001372669} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 15:17:55,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L830-->L830-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-411842922 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-411842922 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-411842922 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd4~0_In-411842922 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-411842922| 0)) (and (= |P3Thread1of1ForFork2_#t~ite54_Out-411842922| ~z$r_buff1_thd4~0_In-411842922) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-411842922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-411842922, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-411842922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411842922} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-411842922|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-411842922, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-411842922, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-411842922, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-411842922} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 15:17:55,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1016] [1016] L830-2-->P3EXIT: Formula: (and (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63) (= |v_P3Thread1of1ForFork2_#t~ite54_26| v_~z$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_25|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_141, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 15:17:55,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] L855-1-->L861: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_9 256))) (= v_~main$tmp_guard0~0_9 (ite (= (ite (= 4 v_~__unbuffered_cnt~0_34) 1 0) 0) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet58, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:17:55,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L861-2-->L861-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out861377350| |ULTIMATE.start_main_#t~ite60_Out861377350|)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In861377350 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In861377350 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite59_Out861377350| ~z~0_In861377350)) (and .cse0 (= |ULTIMATE.start_main_#t~ite59_Out861377350| ~z$w_buff1~0_In861377350) (not .cse2) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In861377350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861377350, ~z$w_buff1~0=~z$w_buff1~0_In861377350, ~z~0=~z~0_In861377350} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out861377350|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In861377350, ~z$w_buff1_used~0=~z$w_buff1_used~0_In861377350, ~z$w_buff1~0=~z$w_buff1~0_In861377350, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out861377350|, ~z~0=~z~0_In861377350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 15:17:55,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L862-->L862-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1889497564 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1889497564 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1889497564| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out1889497564| ~z$w_buff0_used~0_In1889497564) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1889497564, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1889497564|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1889497564} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 15:17:55,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L863-->L863-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In1179356013 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1179356013 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1179356013 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1179356013 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1179356013 |ULTIMATE.start_main_#t~ite62_Out1179356013|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite62_Out1179356013|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179356013, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179356013, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1179356013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1179356013} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1179356013|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1179356013, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1179356013, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1179356013, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1179356013} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 15:17:55,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L864-->L864-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1767637450 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1767637450 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In1767637450 |ULTIMATE.start_main_#t~ite63_Out1767637450|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite63_Out1767637450|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1767637450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1767637450} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1767637450|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1767637450, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1767637450} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 15:17:55,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L865-->L865-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In218757910 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In218757910 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In218757910 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In218757910 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out218757910| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite64_Out218757910| ~z$r_buff1_thd0~0_In218757910)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218757910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218757910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218757910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218757910} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218757910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218757910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218757910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218757910, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out218757910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 15:17:55,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L865-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~z$r_buff1_thd0~0_182 |v_ULTIMATE.start_main_#t~ite64_46|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~main$tmp_guard1~0_19 (ite (= (ite (not (and (= 0 v_~__unbuffered_p2_EAX~0_48) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~y~0_49 2) (= 1 v_~__unbuffered_p3_EAX~0_33) (= v_~x~0_29 2))) 1 0) 0) 0 1))) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_46|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_182, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_48, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_49, ~x~0=v_~x~0_29, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_45|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} 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 15:17:56,053 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b4d305a9-d539-4bcd-a9f0-08e123ffb199/bin/uautomizer/witness.graphml [2019-12-07 15:17:56,054 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:17:56,055 INFO L168 Benchmark]: Toolchain (without parser) took 148406.38 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.8 GB). Free memory was 943.5 MB in the beginning and 6.4 GB in the end (delta: -5.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-12-07 15:17:56,055 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:17:56,055 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:17:56,055 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:17:56,055 INFO L168 Benchmark]: Boogie Preprocessor took 28.66 ms. Allocated memory is still 1.2 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 15:17:56,056 INFO L168 Benchmark]: RCFGBuilder took 438.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:17:56,056 INFO L168 Benchmark]: TraceAbstraction took 147381.06 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-12-07 15:17:56,056 INFO L168 Benchmark]: Witness Printer took 81.91 ms. Allocated memory is still 7.8 GB. Free memory was 6.5 GB in the beginning and 6.4 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:17:56,058 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 428.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.2 MB). Free memory was 943.5 MB in the beginning and 1.1 GB in the end (delta: -146.3 MB). Peak memory consumption was 23.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.66 ms. Allocated memory is still 1.2 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 438.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 147381.06 ms. Allocated memory was 1.2 GB in the beginning and 7.8 GB in the end (delta: 6.6 GB). Free memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: -5.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 81.91 ms. Allocated memory is still 7.8 GB. Free memory was 6.5 GB in the beginning and 6.4 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 210 ProgramPointsBefore, 115 ProgramPointsAfterwards, 253 TransitionsBefore, 135 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 50 ConcurrentYvCompositions, 28 ChoiceCompositions, 10258 VarBasedMoverChecksPositive, 419 VarBasedMoverChecksNegative, 190 SemBasedMoverChecksPositive, 389 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.5s, 0 MoverChecksTotal, 146481 CheckedPairsTotal, 131 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L849] FCALL, FORK 0 pthread_create(&t557, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L851] FCALL, FORK 0 pthread_create(&t558, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L853] FCALL, FORK 0 pthread_create(&t559, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L855] FCALL, FORK 0 pthread_create(&t560, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L799] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L800] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L801] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L802] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L803] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L804] 4 z$r_buff0_thd4 = (_Bool)1 [L807] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L808] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L809] 4 z$flush_delayed = weak$$choice2 [L810] 4 z$mem_tmp = z VAL [__unbuffered_cnt=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] [L811] 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_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] [L811] 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) [L812] 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_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] [L812] 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)) [L813] 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_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] [L813] 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)) [L814] 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_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] [L814] 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)) [L815] 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_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] [L815] 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)) [L817] 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_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] [L817] 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)) [L818] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=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] [L819] 4 z = z$flush_delayed ? z$mem_tmp : z [L820] 4 z$flush_delayed = (_Bool)0 [L823] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=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] [L826] 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 [\result={0:0}, __unbuffered_cnt=1, __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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, 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] [L766] 3 y = 2 [L769] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L770] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L771] 3 z$flush_delayed = weak$$choice2 [L772] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, y=2, 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] [L773] 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_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=2, y=2, 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] [L773] 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) [L774] 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_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=2, y=2, 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] [L774] 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)) [L775] 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_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=2, y=2, 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] [L775] 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)) [L776] 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_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=2, y=2, 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] [L776] 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)) [L777] 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_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=2, y=2, 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] [L777] 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)) [L778] 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_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=2, y=2, 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] [L778] 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)) [L779] 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_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=2, y=2, 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] [L779] 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)) [L780] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, y=2, 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] [L826] 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) [L827] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L828] 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 [L861] EXPR 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_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=2, y=2, 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=0, z$w_buff1=0, z$w_buff1_used=0] [L861] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L862] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L863] 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 [L864] 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, 198 locations, 2 error locations. Result: UNSAFE, OverallTime: 147.2s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 34.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4981 SDtfs, 4843 SDslu, 7418 SDs, 0 SdLazy, 3204 SolverSat, 193 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 128 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=381324occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 98.6s AutomataMinimizationTime, 23 MinimizatonAttempts, 430007 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 908 NumberOfCodeBlocks, 908 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 819 ConstructedInterpolants, 0 QuantifiedInterpolants, 180241 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...