./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.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_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/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 7cb9fad924771a4988b59243a5b10880f8a7e2e9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 16:13:05,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:13:05,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:13:05,592 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:13:05,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:13:05,593 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:13:05,594 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:13:05,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:13:05,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:13:05,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:13:05,598 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:13:05,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:13:05,598 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:13:05,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:13:05,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:13:05,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:13:05,601 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:13:05,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:13:05,603 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:13:05,604 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:13:05,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:13:05,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:13:05,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:13:05,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:13:05,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:13:05,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:13:05,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:13:05,610 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:13:05,610 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:13:05,611 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:13:05,611 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:13:05,611 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:13:05,612 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:13:05,612 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:13:05,613 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:13:05,613 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:13:05,613 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:13:05,613 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:13:05,614 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:13:05,614 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:13:05,615 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:13:05,615 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 16:13:05,624 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:13:05,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:13:05,625 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 16:13:05,625 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 16:13:05,626 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:13:05,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:13:05,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 16:13:05,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:13:05,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:13:05,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:13:05,629 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:13:05,629 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_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/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 -> 7cb9fad924771a4988b59243a5b10880f8a7e2e9 [2019-12-07 16:13:05,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:13:05,739 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:13:05,741 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:13:05,743 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:13:05,743 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:13:05,744 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.i [2019-12-07 16:13:05,790 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/data/5a8ff62b8/b2d8edca12f04fd39b76a50346102ab6/FLAG07b503751 [2019-12-07 16:13:06,220 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:13:06,220 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/sv-benchmarks/c/pthread-wmm/mix049_rmo.oepc.i [2019-12-07 16:13:06,231 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/data/5a8ff62b8/b2d8edca12f04fd39b76a50346102ab6/FLAG07b503751 [2019-12-07 16:13:06,579 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/data/5a8ff62b8/b2d8edca12f04fd39b76a50346102ab6 [2019-12-07 16:13:06,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:13:06,583 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:13:06,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:13:06,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:13:06,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:13:06,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:06,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46581b5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06, skipping insertion in model container [2019-12-07 16:13:06,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:06,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:13:06,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:13:06,862 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:13:06,869 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:13:06,909 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:13:06,954 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:13:06,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06 WrapperNode [2019-12-07 16:13:06,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:13:06,955 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:13:06,955 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:13:06,955 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:13:06,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:06,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:06,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:13:06,990 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:13:06,990 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:13:06,990 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:13:06,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:06,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:07,000 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:07,000 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:07,007 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:07,010 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:07,012 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... [2019-12-07 16:13:07,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:13:07,015 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:13:07,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:13:07,016 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:13:07,016 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/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 16:13:07,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 16:13:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 16:13:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 16:13:07,057 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 16:13:07,057 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 16:13:07,058 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:13:07,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:13:07,059 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 16:13:07,417 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:13:07,417 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 16:13:07,418 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:13:07 BoogieIcfgContainer [2019-12-07 16:13:07,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:13:07,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:13:07,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:13:07,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:13:07,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:13:06" (1/3) ... [2019-12-07 16:13:07,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f92d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:13:07, skipping insertion in model container [2019-12-07 16:13:07,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:13:06" (2/3) ... [2019-12-07 16:13:07,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f92d6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:13:07, skipping insertion in model container [2019-12-07 16:13:07,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:13:07" (3/3) ... [2019-12-07 16:13:07,423 INFO L109 eAbstractionObserver]: Analyzing ICFG mix049_rmo.oepc.i [2019-12-07 16:13:07,430 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 16:13:07,430 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:13:07,435 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 16:13:07,435 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 16:13:07,460 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,461 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,462 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,463 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,464 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,469 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,470 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,471 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,472 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,473 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,474 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,475 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,476 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,477 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,478 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,479 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,480 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,481 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 16:13:07,492 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 16:13:07,504 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:13:07,504 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:13:07,504 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:13:07,504 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:13:07,505 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:13:07,505 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:13:07,505 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:13:07,505 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:13:07,515 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-07 16:13:07,517 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 16:13:07,585 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 16:13:07,585 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:13:07,596 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 16:13:07,614 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-07 16:13:07,645 INFO L134 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-07 16:13:07,645 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 16:13:07,652 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 701 event pairs. 9/170 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 16:13:07,672 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 16:13:07,673 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 16:13:10,596 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 16:13:10,919 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-07 16:13:10,919 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-07 16:13:10,922 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-07 16:13:29,703 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-07 16:13:29,704 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-07 16:13:29,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 16:13:29,708 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:29,708 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 16:13:29,709 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:13:29,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:29,712 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-07 16:13:29,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:13:29,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689614163] [2019-12-07 16:13:29,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:13:29,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:29,848 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 16:13:29,849 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689614163] [2019-12-07 16:13:29,849 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:29,849 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 16:13:29,850 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466520258] [2019-12-07 16:13:29,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:13:29,853 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:13:29,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:13:29,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:13:29,864 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-07 16:13:30,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:30,677 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-07 16:13:30,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:13:30,678 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 16:13:30,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:31,172 INFO L225 Difference]: With dead ends: 125570 [2019-12-07 16:13:31,173 INFO L226 Difference]: Without dead ends: 111010 [2019-12-07 16:13:31,174 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 16:13:35,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-07 16:13:38,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-07 16:13:38,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-07 16:13:39,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-07 16:13:39,111 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-07 16:13:39,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:39,112 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-07 16:13:39,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:13:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-07 16:13:39,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 16:13:39,115 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:39,115 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:39,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:13:39,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:39,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-07 16:13:39,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:13:39,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46247923] [2019-12-07 16:13:39,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:13:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:39,186 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 16:13:39,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46247923] [2019-12-07 16:13:39,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:39,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:13:39,186 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671833773] [2019-12-07 16:13:39,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:13:39,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:13:39,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:13:39,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:13:39,188 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-07 16:13:40,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:40,469 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-07 16:13:40,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:13:40,470 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 16:13:40,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:40,888 INFO L225 Difference]: With dead ends: 172646 [2019-12-07 16:13:40,889 INFO L226 Difference]: Without dead ends: 172548 [2019-12-07 16:13:40,889 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 16:13:46,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-07 16:13:48,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-07 16:13:48,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-07 16:13:51,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-07 16:13:51,523 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-07 16:13:51,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:13:51,524 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-07 16:13:51,524 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:13:51,524 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-07 16:13:51,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 16:13:51,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:13:51,528 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:13:51,528 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:13:51,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:13:51,528 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-07 16:13:51,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:13:51,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757774793] [2019-12-07 16:13:51,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:13:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:13:51,586 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 16:13:51,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757774793] [2019-12-07 16:13:51,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:13:51,587 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:13:51,587 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118651956] [2019-12-07 16:13:51,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:13:51,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:13:51,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:13:51,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:13:51,587 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 4 states. [2019-12-07 16:13:52,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:13:52,727 INFO L93 Difference]: Finished difference Result 228902 states and 931210 transitions. [2019-12-07 16:13:52,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:13:52,728 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 16:13:52,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:13:53,312 INFO L225 Difference]: With dead ends: 228902 [2019-12-07 16:13:53,312 INFO L226 Difference]: Without dead ends: 228790 [2019-12-07 16:13:53,312 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 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 16:13:59,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228790 states. [2019-12-07 16:14:02,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228790 to 192327. [2019-12-07 16:14:02,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192327 states. [2019-12-07 16:14:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192327 states to 192327 states and 796272 transitions. [2019-12-07 16:14:03,273 INFO L78 Accepts]: Start accepts. Automaton has 192327 states and 796272 transitions. Word has length 13 [2019-12-07 16:14:03,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:03,274 INFO L462 AbstractCegarLoop]: Abstraction has 192327 states and 796272 transitions. [2019-12-07 16:14:03,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:03,274 INFO L276 IsEmpty]: Start isEmpty. Operand 192327 states and 796272 transitions. [2019-12-07 16:14:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:14:03,282 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:03,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:03,282 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:03,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-07 16:14:03,282 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:03,282 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478358517] [2019-12-07 16:14:03,282 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:03,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:03,309 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 16:14:03,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478358517] [2019-12-07 16:14:03,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:03,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:03,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845458407] [2019-12-07 16:14:03,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:03,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:03,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:03,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:03,310 INFO L87 Difference]: Start difference. First operand 192327 states and 796272 transitions. Second operand 3 states. [2019-12-07 16:14:06,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:06,828 INFO L93 Difference]: Finished difference Result 280788 states and 1158875 transitions. [2019-12-07 16:14:06,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:06,829 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 16:14:06,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:07,539 INFO L225 Difference]: With dead ends: 280788 [2019-12-07 16:14:07,539 INFO L226 Difference]: Without dead ends: 280788 [2019-12-07 16:14:07,539 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 16:14:14,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280788 states. [2019-12-07 16:14:17,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280788 to 222888. [2019-12-07 16:14:17,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222888 states. [2019-12-07 16:14:18,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222888 states to 222888 states and 926633 transitions. [2019-12-07 16:14:18,279 INFO L78 Accepts]: Start accepts. Automaton has 222888 states and 926633 transitions. Word has length 16 [2019-12-07 16:14:18,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:18,280 INFO L462 AbstractCegarLoop]: Abstraction has 222888 states and 926633 transitions. [2019-12-07 16:14:18,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:18,280 INFO L276 IsEmpty]: Start isEmpty. Operand 222888 states and 926633 transitions. [2019-12-07 16:14:18,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 16:14:18,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:18,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:14:18,286 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:18,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:18,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-07 16:14:18,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:18,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035796123] [2019-12-07 16:14:18,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:18,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:18,338 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 16:14:18,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035796123] [2019-12-07 16:14:18,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:18,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:18,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677388137] [2019-12-07 16:14:18,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:18,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:18,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:18,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:18,339 INFO L87 Difference]: Start difference. First operand 222888 states and 926633 transitions. Second operand 5 states. [2019-12-07 16:14:20,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:20,397 INFO L93 Difference]: Finished difference Result 298473 states and 1226263 transitions. [2019-12-07 16:14:20,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 16:14:20,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 16:14:20,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:21,142 INFO L225 Difference]: With dead ends: 298473 [2019-12-07 16:14:21,142 INFO L226 Difference]: Without dead ends: 298473 [2019-12-07 16:14:21,142 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298473 states. [2019-12-07 16:14:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298473 to 237826. [2019-12-07 16:14:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237826 states. [2019-12-07 16:14:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237826 states to 237826 states and 988542 transitions. [2019-12-07 16:14:36,182 INFO L78 Accepts]: Start accepts. Automaton has 237826 states and 988542 transitions. Word has length 16 [2019-12-07 16:14:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:36,183 INFO L462 AbstractCegarLoop]: Abstraction has 237826 states and 988542 transitions. [2019-12-07 16:14:36,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 237826 states and 988542 transitions. [2019-12-07 16:14:36,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:14:36,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:36,194 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 16:14:36,194 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:36,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:36,194 INFO L82 PathProgramCache]: Analyzing trace with hash -504931817, now seen corresponding path program 1 times [2019-12-07 16:14:36,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:36,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317991434] [2019-12-07 16:14:36,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:36,236 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 16:14:36,236 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317991434] [2019-12-07 16:14:36,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:36,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:36,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805541292] [2019-12-07 16:14:36,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:36,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:36,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:36,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:36,238 INFO L87 Difference]: Start difference. First operand 237826 states and 988542 transitions. Second operand 3 states. [2019-12-07 16:14:37,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:37,625 INFO L93 Difference]: Finished difference Result 237826 states and 978678 transitions. [2019-12-07 16:14:37,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:37,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:14:37,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:38,238 INFO L225 Difference]: With dead ends: 237826 [2019-12-07 16:14:38,238 INFO L226 Difference]: Without dead ends: 237826 [2019-12-07 16:14:38,238 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 16:14:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237826 states. [2019-12-07 16:14:48,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237826 to 234480. [2019-12-07 16:14:48,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234480 states. [2019-12-07 16:14:48,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234480 states to 234480 states and 966258 transitions. [2019-12-07 16:14:48,692 INFO L78 Accepts]: Start accepts. Automaton has 234480 states and 966258 transitions. Word has length 18 [2019-12-07 16:14:48,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:48,692 INFO L462 AbstractCegarLoop]: Abstraction has 234480 states and 966258 transitions. [2019-12-07 16:14:48,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:48,692 INFO L276 IsEmpty]: Start isEmpty. Operand 234480 states and 966258 transitions. [2019-12-07 16:14:48,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 16:14:48,703 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:48,703 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 16:14:48,703 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:48,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:48,703 INFO L82 PathProgramCache]: Analyzing trace with hash 138207619, now seen corresponding path program 1 times [2019-12-07 16:14:48,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:48,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836821905] [2019-12-07 16:14:48,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:48,731 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 16:14:48,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836821905] [2019-12-07 16:14:48,731 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:48,731 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:48,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062960660] [2019-12-07 16:14:48,732 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:48,732 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:48,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:48,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:48,732 INFO L87 Difference]: Start difference. First operand 234480 states and 966258 transitions. Second operand 3 states. [2019-12-07 16:14:48,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:48,856 INFO L93 Difference]: Finished difference Result 42613 states and 138837 transitions. [2019-12-07 16:14:48,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:48,857 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 16:14:48,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:48,919 INFO L225 Difference]: With dead ends: 42613 [2019-12-07 16:14:48,919 INFO L226 Difference]: Without dead ends: 42613 [2019-12-07 16:14:48,920 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 16:14:49,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42613 states. [2019-12-07 16:14:49,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42613 to 42613. [2019-12-07 16:14:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42613 states. [2019-12-07 16:14:49,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42613 states to 42613 states and 138837 transitions. [2019-12-07 16:14:49,963 INFO L78 Accepts]: Start accepts. Automaton has 42613 states and 138837 transitions. Word has length 18 [2019-12-07 16:14:49,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:49,964 INFO L462 AbstractCegarLoop]: Abstraction has 42613 states and 138837 transitions. [2019-12-07 16:14:49,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:49,964 INFO L276 IsEmpty]: Start isEmpty. Operand 42613 states and 138837 transitions. [2019-12-07 16:14:49,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 16:14:49,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:49,970 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 16:14:49,970 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:49,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:49,970 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-07 16:14:49,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:49,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148307496] [2019-12-07 16:14:49,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:49,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:50,032 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 16:14:50,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148307496] [2019-12-07 16:14:50,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:50,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:14:50,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208656328] [2019-12-07 16:14:50,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:14:50,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:50,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:14:50,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 16:14:50,034 INFO L87 Difference]: Start difference. First operand 42613 states and 138837 transitions. Second operand 6 states. [2019-12-07 16:14:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:50,625 INFO L93 Difference]: Finished difference Result 65056 states and 205947 transitions. [2019-12-07 16:14:50,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 16:14:50,626 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 16:14:50,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:50,722 INFO L225 Difference]: With dead ends: 65056 [2019-12-07 16:14:50,722 INFO L226 Difference]: Without dead ends: 65042 [2019-12-07 16:14:50,723 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 16:14:51,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65042 states. [2019-12-07 16:14:51,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65042 to 42278. [2019-12-07 16:14:51,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42278 states. [2019-12-07 16:14:51,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42278 states to 42278 states and 137592 transitions. [2019-12-07 16:14:51,583 INFO L78 Accepts]: Start accepts. Automaton has 42278 states and 137592 transitions. Word has length 22 [2019-12-07 16:14:51,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:51,583 INFO L462 AbstractCegarLoop]: Abstraction has 42278 states and 137592 transitions. [2019-12-07 16:14:51,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:14:51,583 INFO L276 IsEmpty]: Start isEmpty. Operand 42278 states and 137592 transitions. [2019-12-07 16:14:51,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 16:14:51,593 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:51,593 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 16:14:51,593 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:51,593 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-07 16:14:51,594 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:51,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458876053] [2019-12-07 16:14:51,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:51,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:51,733 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 16:14:51,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458876053] [2019-12-07 16:14:51,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:51,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:14:51,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9462385] [2019-12-07 16:14:51,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:14:51,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:51,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:14:51,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:51,734 INFO L87 Difference]: Start difference. First operand 42278 states and 137592 transitions. Second operand 7 states. [2019-12-07 16:14:53,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:53,096 INFO L93 Difference]: Finished difference Result 59726 states and 189950 transitions. [2019-12-07 16:14:53,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 16:14:53,096 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2019-12-07 16:14:53,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:53,174 INFO L225 Difference]: With dead ends: 59726 [2019-12-07 16:14:53,174 INFO L226 Difference]: Without dead ends: 59700 [2019-12-07 16:14:53,174 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:14:53,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59700 states. [2019-12-07 16:14:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59700 to 50129. [2019-12-07 16:14:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50129 states. [2019-12-07 16:14:54,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50129 states to 50129 states and 162181 transitions. [2019-12-07 16:14:54,090 INFO L78 Accepts]: Start accepts. Automaton has 50129 states and 162181 transitions. Word has length 25 [2019-12-07 16:14:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 50129 states and 162181 transitions. [2019-12-07 16:14:54,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:14:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 50129 states and 162181 transitions. [2019-12-07 16:14:54,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 16:14:54,105 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:54,105 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] [2019-12-07 16:14:54,105 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:54,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:54,106 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-07 16:14:54,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:54,106 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338181639] [2019-12-07 16:14:54,106 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:54,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:54,196 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 16:14:54,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338181639] [2019-12-07 16:14:54,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:54,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 16:14:54,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298564577] [2019-12-07 16:14:54,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 16:14:54,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:54,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 16:14:54,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-07 16:14:54,197 INFO L87 Difference]: Start difference. First operand 50129 states and 162181 transitions. Second operand 8 states. [2019-12-07 16:14:54,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:54,796 INFO L93 Difference]: Finished difference Result 67015 states and 211902 transitions. [2019-12-07 16:14:54,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 16:14:54,796 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-07 16:14:54,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:54,898 INFO L225 Difference]: With dead ends: 67015 [2019-12-07 16:14:54,899 INFO L226 Difference]: Without dead ends: 66945 [2019-12-07 16:14:54,899 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-12-07 16:14:55,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66945 states. [2019-12-07 16:14:55,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66945 to 53724. [2019-12-07 16:14:55,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53724 states. [2019-12-07 16:14:56,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53724 states to 53724 states and 172706 transitions. [2019-12-07 16:14:56,014 INFO L78 Accepts]: Start accepts. Automaton has 53724 states and 172706 transitions. Word has length 27 [2019-12-07 16:14:56,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:56,015 INFO L462 AbstractCegarLoop]: Abstraction has 53724 states and 172706 transitions. [2019-12-07 16:14:56,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 16:14:56,015 INFO L276 IsEmpty]: Start isEmpty. Operand 53724 states and 172706 transitions. [2019-12-07 16:14:56,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 16:14:56,034 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:56,034 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] [2019-12-07 16:14:56,034 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:56,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:56,034 INFO L82 PathProgramCache]: Analyzing trace with hash -969078927, now seen corresponding path program 1 times [2019-12-07 16:14:56,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:56,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094631022] [2019-12-07 16:14:56,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:56,065 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 16:14:56,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094631022] [2019-12-07 16:14:56,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:56,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:56,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199951838] [2019-12-07 16:14:56,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:56,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:56,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:56,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:56,067 INFO L87 Difference]: Start difference. First operand 53724 states and 172706 transitions. Second operand 4 states. [2019-12-07 16:14:56,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:56,130 INFO L93 Difference]: Finished difference Result 20754 states and 64022 transitions. [2019-12-07 16:14:56,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:14:56,131 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 16:14:56,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:56,154 INFO L225 Difference]: With dead ends: 20754 [2019-12-07 16:14:56,155 INFO L226 Difference]: Without dead ends: 20754 [2019-12-07 16:14:56,155 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 16:14:56,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20754 states. [2019-12-07 16:14:56,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20754 to 19543. [2019-12-07 16:14:56,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19543 states. [2019-12-07 16:14:56,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19543 states to 19543 states and 60338 transitions. [2019-12-07 16:14:56,448 INFO L78 Accepts]: Start accepts. Automaton has 19543 states and 60338 transitions. Word has length 29 [2019-12-07 16:14:56,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:56,449 INFO L462 AbstractCegarLoop]: Abstraction has 19543 states and 60338 transitions. [2019-12-07 16:14:56,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:56,449 INFO L276 IsEmpty]: Start isEmpty. Operand 19543 states and 60338 transitions. [2019-12-07 16:14:56,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 16:14:56,467 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:56,467 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] [2019-12-07 16:14:56,467 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:56,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:56,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-07 16:14:56,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:56,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892091742] [2019-12-07 16:14:56,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:56,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:56,540 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 16:14:56,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892091742] [2019-12-07 16:14:56,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:56,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 16:14:56,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613845579] [2019-12-07 16:14:56,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 16:14:56,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:56,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 16:14:56,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 16:14:56,541 INFO L87 Difference]: Start difference. First operand 19543 states and 60338 transitions. Second operand 7 states. [2019-12-07 16:14:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:57,262 INFO L93 Difference]: Finished difference Result 27225 states and 81337 transitions. [2019-12-07 16:14:57,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 16:14:57,262 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 16:14:57,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:57,293 INFO L225 Difference]: With dead ends: 27225 [2019-12-07 16:14:57,293 INFO L226 Difference]: Without dead ends: 27225 [2019-12-07 16:14:57,293 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:14:57,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27225 states. [2019-12-07 16:14:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27225 to 19532. [2019-12-07 16:14:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19532 states. [2019-12-07 16:14:57,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19532 states to 19532 states and 60108 transitions. [2019-12-07 16:14:57,639 INFO L78 Accepts]: Start accepts. Automaton has 19532 states and 60108 transitions. Word has length 33 [2019-12-07 16:14:57,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:57,639 INFO L462 AbstractCegarLoop]: Abstraction has 19532 states and 60108 transitions. [2019-12-07 16:14:57,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 16:14:57,639 INFO L276 IsEmpty]: Start isEmpty. Operand 19532 states and 60108 transitions. [2019-12-07 16:14:57,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 16:14:57,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:57,655 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] [2019-12-07 16:14:57,655 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:57,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:57,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1293540528, now seen corresponding path program 1 times [2019-12-07 16:14:57,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:57,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29589069] [2019-12-07 16:14:57,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:57,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:57,705 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 16:14:57,705 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29589069] [2019-12-07 16:14:57,705 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:57,705 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:57,705 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758674236] [2019-12-07 16:14:57,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:57,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:57,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:57,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:57,706 INFO L87 Difference]: Start difference. First operand 19532 states and 60108 transitions. Second operand 3 states. [2019-12-07 16:14:57,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:57,757 INFO L93 Difference]: Finished difference Result 18664 states and 56622 transitions. [2019-12-07 16:14:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:57,758 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 16:14:57,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:57,779 INFO L225 Difference]: With dead ends: 18664 [2019-12-07 16:14:57,779 INFO L226 Difference]: Without dead ends: 18664 [2019-12-07 16:14:57,779 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 16:14:57,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18664 states. [2019-12-07 16:14:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18664 to 18390. [2019-12-07 16:14:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18390 states. [2019-12-07 16:14:58,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18390 states to 18390 states and 55854 transitions. [2019-12-07 16:14:58,040 INFO L78 Accepts]: Start accepts. Automaton has 18390 states and 55854 transitions. Word has length 40 [2019-12-07 16:14:58,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:58,040 INFO L462 AbstractCegarLoop]: Abstraction has 18390 states and 55854 transitions. [2019-12-07 16:14:58,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:58,041 INFO L276 IsEmpty]: Start isEmpty. Operand 18390 states and 55854 transitions. [2019-12-07 16:14:58,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 16:14:58,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:58,055 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] [2019-12-07 16:14:58,055 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:58,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:58,055 INFO L82 PathProgramCache]: Analyzing trace with hash -448595313, now seen corresponding path program 1 times [2019-12-07 16:14:58,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:58,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140253156] [2019-12-07 16:14:58,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:58,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:58,107 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 16:14:58,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140253156] [2019-12-07 16:14:58,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:58,108 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:14:58,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503569225] [2019-12-07 16:14:58,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 16:14:58,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:58,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 16:14:58,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:14:58,109 INFO L87 Difference]: Start difference. First operand 18390 states and 55854 transitions. Second operand 5 states. [2019-12-07 16:14:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:58,168 INFO L93 Difference]: Finished difference Result 16867 states and 52454 transitions. [2019-12-07 16:14:58,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:14:58,169 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 16:14:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:58,187 INFO L225 Difference]: With dead ends: 16867 [2019-12-07 16:14:58,187 INFO L226 Difference]: Without dead ends: 16867 [2019-12-07 16:14:58,187 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 16:14:58,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16867 states. [2019-12-07 16:14:58,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16867 to 15238. [2019-12-07 16:14:58,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15238 states. [2019-12-07 16:14:58,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15238 states to 15238 states and 47616 transitions. [2019-12-07 16:14:58,445 INFO L78 Accepts]: Start accepts. Automaton has 15238 states and 47616 transitions. Word has length 41 [2019-12-07 16:14:58,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:58,445 INFO L462 AbstractCegarLoop]: Abstraction has 15238 states and 47616 transitions. [2019-12-07 16:14:58,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 16:14:58,445 INFO L276 IsEmpty]: Start isEmpty. Operand 15238 states and 47616 transitions. [2019-12-07 16:14:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 16:14:58,458 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:58,459 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 16:14:58,459 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1623524162, now seen corresponding path program 1 times [2019-12-07 16:14:58,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:58,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209369153] [2019-12-07 16:14:58,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:58,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:58,495 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 16:14:58,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209369153] [2019-12-07 16:14:58,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:58,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:14:58,496 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604652161] [2019-12-07 16:14:58,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:14:58,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:58,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:14:58,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:14:58,496 INFO L87 Difference]: Start difference. First operand 15238 states and 47616 transitions. Second operand 3 states. [2019-12-07 16:14:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:58,583 INFO L93 Difference]: Finished difference Result 18380 states and 57153 transitions. [2019-12-07 16:14:58,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:14:58,583 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 16:14:58,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:58,603 INFO L225 Difference]: With dead ends: 18380 [2019-12-07 16:14:58,603 INFO L226 Difference]: Without dead ends: 18380 [2019-12-07 16:14:58,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 16:14:58,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18380 states. [2019-12-07 16:14:58,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18380 to 15494. [2019-12-07 16:14:58,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15494 states. [2019-12-07 16:14:58,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15494 states to 15494 states and 48492 transitions. [2019-12-07 16:14:58,853 INFO L78 Accepts]: Start accepts. Automaton has 15494 states and 48492 transitions. Word has length 66 [2019-12-07 16:14:58,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:58,854 INFO L462 AbstractCegarLoop]: Abstraction has 15494 states and 48492 transitions. [2019-12-07 16:14:58,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:14:58,854 INFO L276 IsEmpty]: Start isEmpty. Operand 15494 states and 48492 transitions. [2019-12-07 16:14:58,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:14:58,867 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:58,868 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, 1] [2019-12-07 16:14:58,868 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:58,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:58,868 INFO L82 PathProgramCache]: Analyzing trace with hash 600429612, now seen corresponding path program 1 times [2019-12-07 16:14:58,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:58,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054415615] [2019-12-07 16:14:58,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:58,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:14:58,910 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 16:14:58,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054415615] [2019-12-07 16:14:58,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:14:58,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:14:58,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922329899] [2019-12-07 16:14:58,911 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:14:58,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:14:58,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:14:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:14:58,911 INFO L87 Difference]: Start difference. First operand 15494 states and 48492 transitions. Second operand 4 states. [2019-12-07 16:14:59,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:14:59,009 INFO L93 Difference]: Finished difference Result 18353 states and 57063 transitions. [2019-12-07 16:14:59,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 16:14:59,010 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 16:14:59,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:14:59,030 INFO L225 Difference]: With dead ends: 18353 [2019-12-07 16:14:59,030 INFO L226 Difference]: Without dead ends: 18353 [2019-12-07 16:14:59,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 16:14:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18353 states. [2019-12-07 16:14:59,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18353 to 15150. [2019-12-07 16:14:59,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15150 states. [2019-12-07 16:14:59,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15150 states to 15150 states and 47431 transitions. [2019-12-07 16:14:59,280 INFO L78 Accepts]: Start accepts. Automaton has 15150 states and 47431 transitions. Word has length 67 [2019-12-07 16:14:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:14:59,280 INFO L462 AbstractCegarLoop]: Abstraction has 15150 states and 47431 transitions. [2019-12-07 16:14:59,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:14:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 15150 states and 47431 transitions. [2019-12-07 16:14:59,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:14:59,293 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:14:59,293 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, 1] [2019-12-07 16:14:59,293 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:14:59,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:14:59,293 INFO L82 PathProgramCache]: Analyzing trace with hash 384042528, now seen corresponding path program 1 times [2019-12-07 16:14:59,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:14:59,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369836239] [2019-12-07 16:14:59,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:14:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:00,084 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 16:15:00,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369836239] [2019-12-07 16:15:00,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:00,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-07 16:15:00,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344334119] [2019-12-07 16:15:00,085 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-07 16:15:00,085 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:00,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-07 16:15:00,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=298, Unknown=0, NotChecked=0, Total=342 [2019-12-07 16:15:00,085 INFO L87 Difference]: Start difference. First operand 15150 states and 47431 transitions. Second operand 19 states. [2019-12-07 16:15:07,992 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 28 [2019-12-07 16:15:08,184 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 22 [2019-12-07 16:15:08,354 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-12-07 16:15:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:13,186 INFO L93 Difference]: Finished difference Result 51625 states and 158752 transitions. [2019-12-07 16:15:13,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2019-12-07 16:15:13,187 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-07 16:15:13,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:13,248 INFO L225 Difference]: With dead ends: 51625 [2019-12-07 16:15:13,248 INFO L226 Difference]: Without dead ends: 40430 [2019-12-07 16:15:13,254 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7720 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=1942, Invalid=18650, Unknown=0, NotChecked=0, Total=20592 [2019-12-07 16:15:13,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40430 states. [2019-12-07 16:15:13,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40430 to 22031. [2019-12-07 16:15:13,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22031 states. [2019-12-07 16:15:13,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22031 states to 22031 states and 68906 transitions. [2019-12-07 16:15:13,724 INFO L78 Accepts]: Start accepts. Automaton has 22031 states and 68906 transitions. Word has length 67 [2019-12-07 16:15:13,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:13,725 INFO L462 AbstractCegarLoop]: Abstraction has 22031 states and 68906 transitions. [2019-12-07 16:15:13,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-07 16:15:13,725 INFO L276 IsEmpty]: Start isEmpty. Operand 22031 states and 68906 transitions. [2019-12-07 16:15:13,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:15:13,742 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:13,742 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, 1] [2019-12-07 16:15:13,743 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:13,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:13,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2126135770, now seen corresponding path program 2 times [2019-12-07 16:15:13,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:13,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992997400] [2019-12-07 16:15:13,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:14,350 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 21 [2019-12-07 16:15:14,550 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 15 [2019-12-07 16:15:14,805 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 16:15:14,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992997400] [2019-12-07 16:15:14,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:14,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 16:15:14,806 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174913274] [2019-12-07 16:15:14,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 16:15:14,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:14,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 16:15:14,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=265, Unknown=0, NotChecked=0, Total=306 [2019-12-07 16:15:14,807 INFO L87 Difference]: Start difference. First operand 22031 states and 68906 transitions. Second operand 18 states. [2019-12-07 16:15:19,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:19,467 INFO L93 Difference]: Finished difference Result 40846 states and 126004 transitions. [2019-12-07 16:15:19,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 16:15:19,467 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-07 16:15:19,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:19,513 INFO L225 Difference]: With dead ends: 40846 [2019-12-07 16:15:19,513 INFO L226 Difference]: Without dead ends: 37472 [2019-12-07 16:15:19,515 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 0 SyntacticMatches, 7 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1738 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=749, Invalid=5103, Unknown=0, NotChecked=0, Total=5852 [2019-12-07 16:15:19,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37472 states. [2019-12-07 16:15:19,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37472 to 20360. [2019-12-07 16:15:19,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2019-12-07 16:15:20,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 63539 transitions. [2019-12-07 16:15:20,007 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 63539 transitions. Word has length 67 [2019-12-07 16:15:20,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:20,007 INFO L462 AbstractCegarLoop]: Abstraction has 20360 states and 63539 transitions. [2019-12-07 16:15:20,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 16:15:20,008 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 63539 transitions. [2019-12-07 16:15:20,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:15:20,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:20,023 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, 1] [2019-12-07 16:15:20,023 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:20,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:20,024 INFO L82 PathProgramCache]: Analyzing trace with hash 117791840, now seen corresponding path program 3 times [2019-12-07 16:15:20,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:20,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289786749] [2019-12-07 16:15:20,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:15:20,201 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 16:15:20,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289786749] [2019-12-07 16:15:20,202 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:15:20,202 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 16:15:20,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727569959] [2019-12-07 16:15:20,202 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 16:15:20,202 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 16:15:20,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 16:15:20,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 16:15:20,203 INFO L87 Difference]: Start difference. First operand 20360 states and 63539 transitions. Second operand 11 states. [2019-12-07 16:15:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:15:21,275 INFO L93 Difference]: Finished difference Result 57311 states and 177448 transitions. [2019-12-07 16:15:21,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 16:15:21,276 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 16:15:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:15:21,316 INFO L225 Difference]: With dead ends: 57311 [2019-12-07 16:15:21,316 INFO L226 Difference]: Without dead ends: 33502 [2019-12-07 16:15:21,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=317, Invalid=1405, Unknown=0, NotChecked=0, Total=1722 [2019-12-07 16:15:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33502 states. [2019-12-07 16:15:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33502 to 18201. [2019-12-07 16:15:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18201 states. [2019-12-07 16:15:21,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18201 states to 18201 states and 56568 transitions. [2019-12-07 16:15:21,701 INFO L78 Accepts]: Start accepts. Automaton has 18201 states and 56568 transitions. Word has length 67 [2019-12-07 16:15:21,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:15:21,701 INFO L462 AbstractCegarLoop]: Abstraction has 18201 states and 56568 transitions. [2019-12-07 16:15:21,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 16:15:21,701 INFO L276 IsEmpty]: Start isEmpty. Operand 18201 states and 56568 transitions. [2019-12-07 16:15:21,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 16:15:21,717 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:15:21,717 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, 1] [2019-12-07 16:15:21,717 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:15:21,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:15:21,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 4 times [2019-12-07 16:15:21,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 16:15:21,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568389306] [2019-12-07 16:15:21,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:15:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:15:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:15:21,806 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 16:15:21,806 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:15:21,809 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-07 16:15:21,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-07 16:15:21,810 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:15:21,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1885753882 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1885753882 256)))) (or (and (= ~z~0_In1885753882 |P1Thread1of1ForFork2_#t~ite9_Out1885753882|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In1885753882 |P1Thread1of1ForFork2_#t~ite9_Out1885753882|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$w_buff1~0=~z$w_buff1~0_In1885753882, ~z~0=~z~0_In1885753882} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1885753882|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$w_buff1~0=~z$w_buff1~0_In1885753882, ~z~0=~z~0_In1885753882} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 16:15:21,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 16:15:21,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-07 16:15:21,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In333048851 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In333048851 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out333048851| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out333048851| ~z$w_buff0_used~0_In333048851)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In333048851, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In333048851} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In333048851, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out333048851|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In333048851} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:15:21,812 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1484081150 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1484081150 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1484081150 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1484081150 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1484081150 |P1Thread1of1ForFork2_#t~ite12_Out1484081150|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out1484081150| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1484081150|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 16:15:21,814 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1851830422 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1851830422 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1851830422| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1851830422| ~z$r_buff0_thd2~0_In1851830422) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851830422} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1851830422|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851830422} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 16:15:21,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1013475305 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-1013475305| |P2Thread1of1ForFork0_#t~ite26_Out-1013475305|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1013475305| ~z$w_buff0_used~0_In-1013475305)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1013475305 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1013475305 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1013475305 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1013475305 256) 0)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-1013475305| |P2Thread1of1ForFork0_#t~ite27_Out-1013475305|) (= |P2Thread1of1ForFork0_#t~ite26_Out-1013475305| ~z$w_buff0_used~0_In-1013475305)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1013475305|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013475305, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013475305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013475305, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013475305, ~weak$$choice2~0=~weak$$choice2~0_In-1013475305} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1013475305|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1013475305|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013475305, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013475305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013475305, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013475305, ~weak$$choice2~0=~weak$$choice2~0_In-1013475305} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 16:15:21,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:15:21,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-312449153 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-312449153 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-312449153|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-312449153 |P0Thread1of1ForFork1_#t~ite5_Out-312449153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-312449153} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-312449153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-312449153} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 16:15:21,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:15:21,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1484602651 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1484602651| |P2Thread1of1ForFork0_#t~ite39_Out1484602651|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1484602651 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1484602651| ~z~0_In1484602651) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1484602651| ~z$w_buff1~0_In1484602651) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1484602651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484602651, ~z$w_buff1~0=~z$w_buff1~0_In1484602651, ~z~0=~z~0_In1484602651} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1484602651|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1484602651|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1484602651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484602651, ~z$w_buff1~0=~z$w_buff1~0_In1484602651, ~z~0=~z~0_In1484602651} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 16:15:21,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-266967960 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-266967960 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-266967960| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-266967960| ~z$w_buff0_used~0_In-266967960)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-266967960, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-266967960} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-266967960, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-266967960|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-266967960} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 16:15:21,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In1289048642 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1289048642 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1289048642 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1289048642 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1289048642|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1289048642 |P2Thread1of1ForFork0_#t~ite41_Out1289048642|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1289048642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1289048642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1289048642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1289048642} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1289048642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1289048642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1289048642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1289048642, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1289048642|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 16:15:21,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1052821519 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1052821519 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1052821519|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1052821519| ~z$r_buff0_thd3~0_In-1052821519) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1052821519, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1052821519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1052821519, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1052821519, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1052821519|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:15:21,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1834842706 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1834842706 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1834842706 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1834842706 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1834842706 |P2Thread1of1ForFork0_#t~ite43_Out-1834842706|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1834842706|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834842706, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834842706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834842706, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834842706} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1834842706|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834842706, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834842706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834842706, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834842706} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 16:15:21,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:15:21,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1307786193 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1307786193 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1307786193 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1307786193 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1307786193| ~z$w_buff1_used~0_In-1307786193) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1307786193| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1307786193, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1307786193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1307786193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1307786193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1307786193, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1307786193|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1307786193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1307786193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1307786193} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:15:21,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_Out1154568952 ~z$r_buff0_thd1~0_In1154568952)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1154568952 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1154568952 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out1154568952 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1154568952, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1154568952} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1154568952, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1154568952|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1154568952} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:15:21,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-658878640 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-658878640 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-658878640 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-658878640 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-658878640| ~z$r_buff1_thd1~0_In-658878640) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out-658878640| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-658878640, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-658878640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-658878640, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-658878640} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-658878640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-658878640, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-658878640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-658878640, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-658878640} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:15:21,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:15:21,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In398745964 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In398745964 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In398745964 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In398745964 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out398745964|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In398745964 |P1Thread1of1ForFork2_#t~ite14_Out398745964|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In398745964, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In398745964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398745964, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In398745964} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In398745964, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In398745964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398745964, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out398745964|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In398745964} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:15:21,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 16:15:21,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:15:21,821 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-405469233| |ULTIMATE.start_main_#t~ite48_Out-405469233|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-405469233 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-405469233 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-405469233| ~z$w_buff1~0_In-405469233) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-405469233| ~z~0_In-405469233)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-405469233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-405469233, ~z$w_buff1~0=~z$w_buff1~0_In-405469233, ~z~0=~z~0_In-405469233} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-405469233, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-405469233|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-405469233, ~z$w_buff1~0=~z$w_buff1~0_In-405469233, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-405469233|, ~z~0=~z~0_In-405469233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 16:15:21,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1298049477 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1298049477 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1298049477|)) (and (= ~z$w_buff0_used~0_In1298049477 |ULTIMATE.start_main_#t~ite49_Out1298049477|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298049477, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298049477} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298049477, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298049477, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1298049477|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 16:15:21,822 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1816394258 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1816394258 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1816394258 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1816394258 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1816394258| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1816394258 |ULTIMATE.start_main_#t~ite50_Out1816394258|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1816394258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816394258, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1816394258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816394258} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1816394258|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1816394258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816394258, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1816394258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816394258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 16:15:21,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1970806802 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1970806802 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1970806802 |ULTIMATE.start_main_#t~ite51_Out1970806802|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1970806802| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1970806802, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970806802} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1970806802, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1970806802|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970806802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 16:15:21,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In218642557 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In218642557 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In218642557 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In218642557 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In218642557 |ULTIMATE.start_main_#t~ite52_Out218642557|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out218642557|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218642557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218642557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218642557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218642557} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out218642557|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218642557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218642557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218642557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218642557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 16:15:21,823 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:15:21,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:15:21 BasicIcfg [2019-12-07 16:15:21,890 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:15:21,890 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:15:21,890 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:15:21,890 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:15:21,891 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:13:07" (3/4) ... [2019-12-07 16:15:21,892 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:15:21,892 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= v_~main$tmp_guard1~0_48 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1309~0.base_23|) |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0)) |v_#memory_int_17|) (= 0 v_~z$r_buff0_thd3~0_416) (= (store .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23| 1) |v_#valid_60|) (= |v_ULTIMATE.start_main_~#t1309~0.offset_17| 0) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1309~0.base_23|)) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1309~0.base_23|) (= 0 v_~__unbuffered_p0_EAX~0_137) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1309~0.base_23| 4) |v_#length_21|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_14|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_17|, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_12|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1309~0.offset=|v_ULTIMATE.start_main_~#t1309~0.offset_17|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_19|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274, ULTIMATE.start_main_~#t1309~0.base=|v_ULTIMATE.start_main_~#t1309~0.base_23|} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1311~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t1311~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1310~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1309~0.offset, #NULL.base, ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ULTIMATE.start_main_~#t1309~0.base] because there is no mapped edge [2019-12-07 16:15:21,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1310~0.base_11| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1310~0.base_11| 4)) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1310~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1310~0.base_11|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1310~0.base_11|) |v_ULTIMATE.start_main_~#t1310~0.offset_9| 1)) |v_#memory_int_13|) (= 0 |v_ULTIMATE.start_main_~#t1310~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t1310~0.base=|v_ULTIMATE.start_main_~#t1310~0.base_11|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1310~0.offset=|v_ULTIMATE.start_main_~#t1310~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1310~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1310~0.offset] because there is no mapped edge [2019-12-07 16:15:21,893 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18 0)) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_18, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:15:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd2~0_In1885753882 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1885753882 256)))) (or (and (= ~z~0_In1885753882 |P1Thread1of1ForFork2_#t~ite9_Out1885753882|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In1885753882 |P1Thread1of1ForFork2_#t~ite9_Out1885753882|) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$w_buff1~0=~z$w_buff1~0_In1885753882, ~z~0=~z~0_In1885753882} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1885753882|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1885753882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1885753882, ~z$w_buff1~0=~z$w_buff1~0_In1885753882, ~z~0=~z~0_In1885753882} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-07 16:15:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_6|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_6|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_5|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_5|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-07 16:15:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1311~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1311~0.base_13|) |v_ULTIMATE.start_main_~#t1311~0.offset_11| 2)) |v_#memory_int_11|) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13|)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1311~0.base_13| 1)) (= |v_ULTIMATE.start_main_~#t1311~0.offset_11| 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1311~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1311~0.base=|v_ULTIMATE.start_main_~#t1311~0.base_13|, ULTIMATE.start_main_~#t1311~0.offset=|v_ULTIMATE.start_main_~#t1311~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1311~0.base, ULTIMATE.start_main_~#t1311~0.offset] because there is no mapped edge [2019-12-07 16:15:21,894 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In333048851 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In333048851 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_Out333048851| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out333048851| ~z$w_buff0_used~0_In333048851)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In333048851, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In333048851} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In333048851, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out333048851|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In333048851} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-07 16:15:21,895 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1484081150 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1484081150 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1484081150 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1484081150 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1484081150 |P1Thread1of1ForFork2_#t~ite12_Out1484081150|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork2_#t~ite12_Out1484081150| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1484081150, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1484081150, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484081150, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1484081150|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1484081150} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-07 16:15:21,897 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In1851830422 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1851830422 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite13_Out1851830422| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork2_#t~ite13_Out1851830422| ~z$r_buff0_thd2~0_In1851830422) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851830422} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1851830422, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1851830422|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1851830422} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-07 16:15:21,898 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1013475305 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite26_In-1013475305| |P2Thread1of1ForFork0_#t~ite26_Out-1013475305|) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite27_Out-1013475305| ~z$w_buff0_used~0_In-1013475305)) (and (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1013475305 256) 0))) (or (= 0 (mod ~z$w_buff0_used~0_In-1013475305 256)) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1013475305 256))) (and .cse1 (= (mod ~z$r_buff1_thd3~0_In-1013475305 256) 0)))) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out-1013475305| |P2Thread1of1ForFork0_#t~ite27_Out-1013475305|) (= |P2Thread1of1ForFork0_#t~ite26_Out-1013475305| ~z$w_buff0_used~0_In-1013475305)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1013475305|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013475305, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013475305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013475305, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013475305, ~weak$$choice2~0=~weak$$choice2~0_In-1013475305} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1013475305|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1013475305|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1013475305, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1013475305, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1013475305, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1013475305, ~weak$$choice2~0=~weak$$choice2~0_In-1013475305} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-07 16:15:21,899 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_7|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_6|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 16:15:21,900 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-312449153 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-312449153 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-312449153|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-312449153 |P0Thread1of1ForFork1_#t~ite5_Out-312449153|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-312449153} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-312449153|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-312449153, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-312449153} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-07 16:15:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_5|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-07 16:15:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1484602651 256) 0)) (.cse2 (= |P2Thread1of1ForFork0_#t~ite38_Out1484602651| |P2Thread1of1ForFork0_#t~ite39_Out1484602651|)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In1484602651 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out1484602651| ~z~0_In1484602651) (or .cse0 .cse1) .cse2) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out1484602651| ~z$w_buff1~0_In1484602651) .cse2 (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1484602651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484602651, ~z$w_buff1~0=~z$w_buff1~0_In1484602651, ~z~0=~z~0_In1484602651} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out1484602651|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out1484602651|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1484602651, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1484602651, ~z$w_buff1~0=~z$w_buff1~0_In1484602651, ~z~0=~z~0_In1484602651} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-07 16:15:21,901 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-266967960 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-266967960 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite40_Out-266967960| 0)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out-266967960| ~z$w_buff0_used~0_In-266967960)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-266967960, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-266967960} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-266967960, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-266967960|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-266967960} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-07 16:15:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd3~0_In1289048642 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In1289048642 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In1289048642 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1289048642 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out1289048642|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1289048642 |P2Thread1of1ForFork0_#t~ite41_Out1289048642|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1289048642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1289048642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1289048642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1289048642} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1289048642, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1289048642, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1289048642, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1289048642, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out1289048642|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-07 16:15:21,902 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1052821519 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1052821519 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1052821519|) (not .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1052821519| ~z$r_buff0_thd3~0_In-1052821519) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1052821519, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1052821519} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1052821519, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1052821519, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1052821519|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-07 16:15:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff1_used~0_In-1834842706 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-1834842706 256))) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-1834842706 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1834842706 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd3~0_In-1834842706 |P2Thread1of1ForFork0_#t~ite43_Out-1834842706|) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-1834842706|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834842706, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834842706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834842706, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834842706} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-1834842706|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1834842706, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1834842706, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1834842706, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1834842706} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-07 16:15:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_28|) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_27|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 16:15:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1307786193 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1307786193 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1307786193 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1307786193 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite6_Out-1307786193| ~z$w_buff1_used~0_In-1307786193) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork1_#t~ite6_Out-1307786193| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1307786193, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1307786193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1307786193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1307786193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1307786193, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1307786193|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1307786193, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1307786193, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1307786193} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 16:15:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse0 (= ~z$r_buff0_thd1~0_Out1154568952 ~z$r_buff0_thd1~0_In1154568952)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1154568952 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In1154568952 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse0) (and (not .cse1) (= ~z$r_buff0_thd1~0_Out1154568952 0) (not .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1154568952, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1154568952} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1154568952, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1154568952|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1154568952} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 16:15:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-658878640 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-658878640 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-658878640 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-658878640 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-658878640| ~z$r_buff1_thd1~0_In-658878640) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite8_Out-658878640| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-658878640, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-658878640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-658878640, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-658878640} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-658878640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-658878640, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-658878640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-658878640, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-658878640} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 16:15:21,903 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_42|) (= 0 |v_P0Thread1of1ForFork1_#res.base_3|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_41|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_3|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 16:15:21,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In398745964 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In398745964 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In398745964 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd2~0_In398745964 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out398745964|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~z$r_buff1_thd2~0_In398745964 |P1Thread1of1ForFork2_#t~ite14_Out398745964|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In398745964, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In398745964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398745964, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In398745964} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In398745964, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In398745964, ~z$w_buff1_used~0=~z$w_buff1_used~0_In398745964, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out398745964|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In398745964} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-07 16:15:21,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_32|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_32|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_31|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 16:15:21,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= v_~main$tmp_guard0~0_7 (ite (= (ite (= 3 v_~__unbuffered_cnt~0_14) 1 0) 0) 0 1)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 16:15:21,904 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite47_Out-405469233| |ULTIMATE.start_main_#t~ite48_Out-405469233|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-405469233 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-405469233 256) 0))) (or (and .cse0 (not .cse1) (= |ULTIMATE.start_main_#t~ite47_Out-405469233| ~z$w_buff1~0_In-405469233) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite47_Out-405469233| ~z~0_In-405469233)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-405469233, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-405469233, ~z$w_buff1~0=~z$w_buff1~0_In-405469233, ~z~0=~z~0_In-405469233} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-405469233, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-405469233|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-405469233, ~z$w_buff1~0=~z$w_buff1~0_In-405469233, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-405469233|, ~z~0=~z~0_In-405469233} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 16:15:21,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1298049477 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1298049477 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1298049477|)) (and (= ~z$w_buff0_used~0_In1298049477 |ULTIMATE.start_main_#t~ite49_Out1298049477|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298049477, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298049477} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298049477, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298049477, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1298049477|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 16:15:21,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~z$w_buff1_used~0_In1816394258 256) 0)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In1816394258 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1816394258 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1816394258 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out1816394258| 0)) (and (or .cse3 .cse2) (= ~z$w_buff1_used~0_In1816394258 |ULTIMATE.start_main_#t~ite50_Out1816394258|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1816394258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816394258, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1816394258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816394258} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1816394258|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1816394258, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1816394258, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1816394258, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1816394258} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 16:15:21,905 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1970806802 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1970806802 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In1970806802 |ULTIMATE.start_main_#t~ite51_Out1970806802|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out1970806802| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1970806802, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970806802} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1970806802, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1970806802|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1970806802} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 16:15:21,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In218642557 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In218642557 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In218642557 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In218642557 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff1_thd0~0_In218642557 |ULTIMATE.start_main_#t~ite52_Out218642557|) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out218642557|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218642557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218642557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218642557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218642557} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out218642557|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In218642557, ~z$w_buff0_used~0=~z$w_buff0_used~0_In218642557, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In218642557, ~z$w_buff1_used~0=~z$w_buff1_used~0_In218642557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 16:15:21,906 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_20 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_20 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 16:15:21,970 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b9d94a73-9f37-4a7d-bdc5-de6d74ee93a8/bin/uautomizer/witness.graphml [2019-12-07 16:15:21,970 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:15:21,971 INFO L168 Benchmark]: Toolchain (without parser) took 135388.53 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 935.5 MB in the beginning and 5.1 GB in the end (delta: -4.2 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 16:15:21,971 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:15:21,972 INFO L168 Benchmark]: CACSL2BoogieTranslator took 370.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:21,972 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:21,972 INFO L168 Benchmark]: Boogie Preprocessor took 24.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:15:21,973 INFO L168 Benchmark]: RCFGBuilder took 402.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:21,973 INFO L168 Benchmark]: TraceAbstraction took 134470.98 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-12-07 16:15:21,973 INFO L168 Benchmark]: Witness Printer took 79.86 ms. Allocated memory is still 6.6 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 16:15:21,975 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 370.98 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 935.5 MB in the beginning and 1.1 GB in the end (delta: -145.5 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 35.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.87 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 402.97 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 134470.98 ms. Allocated memory was 1.1 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.0 GB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 79.86 ms. Allocated memory is still 6.6 GB. Free memory was 5.1 GB in the beginning and 5.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.1s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1309, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1310, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1311, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 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) [L788] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 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)) [L789] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 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)) [L790] 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)) [L791] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 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)) [L793] 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 [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 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)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=7, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] 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}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=7, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=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] [L832] 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) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 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 [L835] 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 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 134.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 37.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4466 SDtfs, 6900 SDslu, 19455 SDs, 0 SdLazy, 20310 SolverSat, 461 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 373 GetRequests, 19 SyntacticMatches, 27 SemanticMatches, 327 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10032 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=237826occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 71.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 285232 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 713 NumberOfCodeBlocks, 713 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 627 ConstructedInterpolants, 0 QuantifiedInterpolants, 206793 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...