./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 03bd54420cb2063ae0fda825a0f80376f3e690c8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 21:08:54,377 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:08:54,378 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:08:54,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:08:54,387 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:08:54,387 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:08:54,388 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:08:54,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:08:54,391 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:08:54,392 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:08:54,393 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:08:54,394 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:08:54,394 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:08:54,395 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:08:54,396 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:08:54,397 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:08:54,398 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:08:54,399 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:08:54,400 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:08:54,401 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:08:54,403 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:08:54,403 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:08:54,404 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:08:54,404 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:08:54,406 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:08:54,406 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:08:54,406 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:08:54,407 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:08:54,407 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:08:54,408 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:08:54,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:08:54,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:08:54,409 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:08:54,410 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:08:54,411 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:08:54,411 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:08:54,411 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:08:54,412 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:08:54,412 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:08:54,413 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:08:54,413 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:08:54,414 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:08:54,427 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:08:54,427 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:08:54,428 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:08:54,428 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:08:54,428 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:08:54,429 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:08:54,429 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:08:54,429 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:08:54,429 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:08:54,429 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:08:54,429 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:08:54,430 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:08:54,430 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:08:54,430 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:08:54,430 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:08:54,431 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:08:54,431 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:08:54,431 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:08:54,431 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:08:54,432 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:08:54,432 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:08:54,432 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:08:54,432 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:08:54,432 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:08:54,432 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:08:54,433 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:08:54,433 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:08:54,433 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:08:54,433 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:08:54,433 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:08:54,433 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:08:54,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:08:54,434 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:08:54,434 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:08:54,434 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:08:54,434 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:08:54,434 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:08:54,434 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:08:54,435 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:08:54,435 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:08:54,435 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan 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 -> Taipan 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 -> 03bd54420cb2063ae0fda825a0f80376f3e690c8 [2019-12-07 21:08:54,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:08:54,554 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:08:54,556 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:08:54,557 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:08:54,557 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:08:54,558 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i [2019-12-07 21:08:54,598 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/data/df049a2fc/6f2979c4225d40b281350262b278fd3a/FLAG37fafadd4 [2019-12-07 21:08:55,060 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:08:55,061 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/sv-benchmarks/c/pthread-wmm/mix007_pso.opt.i [2019-12-07 21:08:55,071 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/data/df049a2fc/6f2979c4225d40b281350262b278fd3a/FLAG37fafadd4 [2019-12-07 21:08:55,080 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/data/df049a2fc/6f2979c4225d40b281350262b278fd3a [2019-12-07 21:08:55,082 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:08:55,083 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:08:55,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:08:55,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:08:55,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:08:55,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,088 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55, skipping insertion in model container [2019-12-07 21:08:55,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,093 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:08:55,122 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:08:55,406 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:08:55,415 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:08:55,458 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:08:55,502 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:08:55,503 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55 WrapperNode [2019-12-07 21:08:55,503 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:08:55,503 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:08:55,503 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:08:55,504 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:08:55,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,522 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,542 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:08:55,543 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:08:55,543 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:08:55,543 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:08:55,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,553 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,553 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,561 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,564 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... [2019-12-07 21:08:55,570 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:08:55,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:08:55,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:08:55,571 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:08:55,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/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 21:08:55,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:08:55,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:08:55,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:08:55,612 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:08:55,612 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 21:08:55,613 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 21:08:55,613 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:08:55,613 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:08:55,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:08:55,614 WARN L205 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 21:08:56,025 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:08:56,025 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:08:56,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:08:56 BoogieIcfgContainer [2019-12-07 21:08:56,026 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:08:56,027 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:08:56,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:08:56,029 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:08:56,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:08:55" (1/3) ... [2019-12-07 21:08:56,029 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d72ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:08:56, skipping insertion in model container [2019-12-07 21:08:56,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:08:55" (2/3) ... [2019-12-07 21:08:56,030 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12d72ae2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:08:56, skipping insertion in model container [2019-12-07 21:08:56,030 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:08:56" (3/3) ... [2019-12-07 21:08:56,031 INFO L109 eAbstractionObserver]: Analyzing ICFG mix007_pso.opt.i [2019-12-07 21:08:56,037 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:08:56,037 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:08:56,042 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:08:56,042 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:08:56,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,071 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,072 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,072 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,073 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,074 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,075 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,076 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,077 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,078 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,079 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,080 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,081 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,082 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,083 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,084 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,085 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,086 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,087 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,088 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,089 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,090 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,091 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,092 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,093 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,094 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,095 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:08:56,107 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 21:08:56,119 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:08:56,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:08:56,120 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:08:56,120 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:08:56,120 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:08:56,120 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:08:56,120 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:08:56,120 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:08:56,131 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 212 places, 255 transitions [2019-12-07 21:08:56,132 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 21:08:56,201 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 21:08:56,201 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:08:56,214 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:08:56,237 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 212 places, 255 transitions [2019-12-07 21:08:56,275 INFO L134 PetriNetUnfolder]: 56/251 cut-off events. [2019-12-07 21:08:56,276 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:08:56,284 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 251 events. 56/251 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 941 event pairs. 12/205 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:08:56,310 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 21:08:56,311 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:08:59,925 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 21:09:00,119 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-07 21:09:00,242 INFO L206 etLargeBlockEncoding]: Checked pairs total: 141939 [2019-12-07 21:09:00,242 INFO L214 etLargeBlockEncoding]: Total number of compositions: 133 [2019-12-07 21:09:00,244 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 132 transitions [2019-12-07 21:09:07,543 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85966 states. [2019-12-07 21:09:07,544 INFO L276 IsEmpty]: Start isEmpty. Operand 85966 states. [2019-12-07 21:09:07,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:09:07,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:07,550 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:09:07,550 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:07,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:07,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1287441752, now seen corresponding path program 1 times [2019-12-07 21:09:07,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:07,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407583361] [2019-12-07 21:09:07,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:07,721 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 21:09:07,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407583361] [2019-12-07 21:09:07,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:07,723 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:09:07,723 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936008079] [2019-12-07 21:09:07,726 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:09:07,726 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:07,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:09:07,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:09:07,737 INFO L87 Difference]: Start difference. First operand 85966 states. Second operand 3 states. [2019-12-07 21:09:08,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:08,426 INFO L93 Difference]: Finished difference Result 85406 states and 393472 transitions. [2019-12-07 21:09:08,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:09:08,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:09:08,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:08,894 INFO L225 Difference]: With dead ends: 85406 [2019-12-07 21:09:08,894 INFO L226 Difference]: Without dead ends: 79558 [2019-12-07 21:09:08,895 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 21:09:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79558 states. [2019-12-07 21:09:11,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79558 to 79558. [2019-12-07 21:09:11,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79558 states. [2019-12-07 21:09:11,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79558 states to 79558 states and 366284 transitions. [2019-12-07 21:09:11,649 INFO L78 Accepts]: Start accepts. Automaton has 79558 states and 366284 transitions. Word has length 9 [2019-12-07 21:09:11,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:11,650 INFO L462 AbstractCegarLoop]: Abstraction has 79558 states and 366284 transitions. [2019-12-07 21:09:11,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:09:11,651 INFO L276 IsEmpty]: Start isEmpty. Operand 79558 states and 366284 transitions. [2019-12-07 21:09:11,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:09:11,656 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:11,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:09:11,656 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:11,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:11,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1721975953, now seen corresponding path program 1 times [2019-12-07 21:09:11,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:11,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280328835] [2019-12-07 21:09:11,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:11,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:11,716 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 21:09:11,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280328835] [2019-12-07 21:09:11,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:11,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:09:11,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007964196] [2019-12-07 21:09:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:09:11,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:09:11,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:11,718 INFO L87 Difference]: Start difference. First operand 79558 states and 366284 transitions. Second operand 4 states. [2019-12-07 21:09:14,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:14,025 INFO L93 Difference]: Finished difference Result 126790 states and 563012 transitions. [2019-12-07 21:09:14,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:09:14,025 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:09:14,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:14,410 INFO L225 Difference]: With dead ends: 126790 [2019-12-07 21:09:14,410 INFO L226 Difference]: Without dead ends: 126726 [2019-12-07 21:09:14,411 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:09:15,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126726 states. [2019-12-07 21:09:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126726 to 123582. [2019-12-07 21:09:17,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123582 states. [2019-12-07 21:09:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123582 states to 123582 states and 551516 transitions. [2019-12-07 21:09:17,964 INFO L78 Accepts]: Start accepts. Automaton has 123582 states and 551516 transitions. Word has length 15 [2019-12-07 21:09:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:17,965 INFO L462 AbstractCegarLoop]: Abstraction has 123582 states and 551516 transitions. [2019-12-07 21:09:17,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:09:17,965 INFO L276 IsEmpty]: Start isEmpty. Operand 123582 states and 551516 transitions. [2019-12-07 21:09:17,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:09:17,970 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:17,970 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 21:09:17,971 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:17,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:17,971 INFO L82 PathProgramCache]: Analyzing trace with hash -1760528869, now seen corresponding path program 1 times [2019-12-07 21:09:17,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:17,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239186752] [2019-12-07 21:09:17,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:18,014 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 21:09:18,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239186752] [2019-12-07 21:09:18,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:18,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:09:18,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127553228] [2019-12-07 21:09:18,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:09:18,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:18,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:09:18,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:18,016 INFO L87 Difference]: Start difference. First operand 123582 states and 551516 transitions. Second operand 4 states. [2019-12-07 21:09:19,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:19,210 INFO L93 Difference]: Finished difference Result 159910 states and 703928 transitions. [2019-12-07 21:09:19,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:09:19,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 21:09:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:19,681 INFO L225 Difference]: With dead ends: 159910 [2019-12-07 21:09:19,681 INFO L226 Difference]: Without dead ends: 159850 [2019-12-07 21:09:19,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:09:21,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159850 states. [2019-12-07 21:09:25,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159850 to 141658. [2019-12-07 21:09:25,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141658 states. [2019-12-07 21:09:25,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141658 states to 141658 states and 629312 transitions. [2019-12-07 21:09:25,765 INFO L78 Accepts]: Start accepts. Automaton has 141658 states and 629312 transitions. Word has length 18 [2019-12-07 21:09:25,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:25,765 INFO L462 AbstractCegarLoop]: Abstraction has 141658 states and 629312 transitions. [2019-12-07 21:09:25,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:09:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 141658 states and 629312 transitions. [2019-12-07 21:09:25,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:09:25,777 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:25,777 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:09:25,777 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:25,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:25,777 INFO L82 PathProgramCache]: Analyzing trace with hash 176800759, now seen corresponding path program 1 times [2019-12-07 21:09:25,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:25,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984834981] [2019-12-07 21:09:25,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:25,845 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 21:09:25,846 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984834981] [2019-12-07 21:09:25,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:25,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:09:25,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880381714] [2019-12-07 21:09:25,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:09:25,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:25,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:09:25,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:09:25,847 INFO L87 Difference]: Start difference. First operand 141658 states and 629312 transitions. Second operand 3 states. [2019-12-07 21:09:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:26,787 INFO L93 Difference]: Finished difference Result 211830 states and 899709 transitions. [2019-12-07 21:09:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:09:26,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:09:26,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:27,376 INFO L225 Difference]: With dead ends: 211830 [2019-12-07 21:09:27,376 INFO L226 Difference]: Without dead ends: 211290 [2019-12-07 21:09:27,376 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:09:29,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211290 states. [2019-12-07 21:09:34,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211290 to 205249. [2019-12-07 21:09:34,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205249 states. [2019-12-07 21:09:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205249 states to 205249 states and 879959 transitions. [2019-12-07 21:09:35,292 INFO L78 Accepts]: Start accepts. Automaton has 205249 states and 879959 transitions. Word has length 20 [2019-12-07 21:09:35,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:35,292 INFO L462 AbstractCegarLoop]: Abstraction has 205249 states and 879959 transitions. [2019-12-07 21:09:35,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:09:35,292 INFO L276 IsEmpty]: Start isEmpty. Operand 205249 states and 879959 transitions. [2019-12-07 21:09:35,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:09:35,310 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:35,310 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:09:35,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:35,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:35,310 INFO L82 PathProgramCache]: Analyzing trace with hash -489613445, now seen corresponding path program 1 times [2019-12-07 21:09:35,311 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:35,311 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646049645] [2019-12-07 21:09:35,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:35,380 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 21:09:35,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646049645] [2019-12-07 21:09:35,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:35,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:09:35,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924707754] [2019-12-07 21:09:35,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:09:35,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:35,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:09:35,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:35,382 INFO L87 Difference]: Start difference. First operand 205249 states and 879959 transitions. Second operand 4 states. [2019-12-07 21:09:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:36,768 INFO L93 Difference]: Finished difference Result 211059 states and 896953 transitions. [2019-12-07 21:09:36,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:09:36,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:09:36,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:37,333 INFO L225 Difference]: With dead ends: 211059 [2019-12-07 21:09:37,333 INFO L226 Difference]: Without dead ends: 211059 [2019-12-07 21:09:37,333 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211059 states. [2019-12-07 21:09:42,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211059 to 205134. [2019-12-07 21:09:42,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205134 states. [2019-12-07 21:09:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205134 states to 205134 states and 879454 transitions. [2019-12-07 21:09:43,029 INFO L78 Accepts]: Start accepts. Automaton has 205134 states and 879454 transitions. Word has length 21 [2019-12-07 21:09:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:43,029 INFO L462 AbstractCegarLoop]: Abstraction has 205134 states and 879454 transitions. [2019-12-07 21:09:43,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:09:43,029 INFO L276 IsEmpty]: Start isEmpty. Operand 205134 states and 879454 transitions. [2019-12-07 21:09:43,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:09:43,047 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:43,047 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:09:43,047 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:43,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:43,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1444973627, now seen corresponding path program 1 times [2019-12-07 21:09:43,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:43,048 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158236051] [2019-12-07 21:09:43,048 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:43,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:43,090 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 21:09:43,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158236051] [2019-12-07 21:09:43,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:43,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:09:43,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445291806] [2019-12-07 21:09:43,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:09:43,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:43,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:09:43,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:43,091 INFO L87 Difference]: Start difference. First operand 205134 states and 879454 transitions. Second operand 4 states. [2019-12-07 21:09:44,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:44,223 INFO L93 Difference]: Finished difference Result 183140 states and 735847 transitions. [2019-12-07 21:09:44,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:09:44,224 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:09:44,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:44,655 INFO L225 Difference]: With dead ends: 183140 [2019-12-07 21:09:44,656 INFO L226 Difference]: Without dead ends: 170432 [2019-12-07 21:09:44,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:09:45,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170432 states. [2019-12-07 21:09:50,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170432 to 170432. [2019-12-07 21:09:50,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170432 states. [2019-12-07 21:09:50,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170432 states to 170432 states and 691309 transitions. [2019-12-07 21:09:50,908 INFO L78 Accepts]: Start accepts. Automaton has 170432 states and 691309 transitions. Word has length 21 [2019-12-07 21:09:50,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:50,909 INFO L462 AbstractCegarLoop]: Abstraction has 170432 states and 691309 transitions. [2019-12-07 21:09:50,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:09:50,909 INFO L276 IsEmpty]: Start isEmpty. Operand 170432 states and 691309 transitions. [2019-12-07 21:09:50,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:09:50,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:50,923 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 21:09:50,924 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:50,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:50,924 INFO L82 PathProgramCache]: Analyzing trace with hash -628977471, now seen corresponding path program 1 times [2019-12-07 21:09:50,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:50,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251298376] [2019-12-07 21:09:50,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:50,954 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 21:09:50,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251298376] [2019-12-07 21:09:50,955 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:50,955 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:09:50,955 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819759548] [2019-12-07 21:09:50,955 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:09:50,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:50,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:09:50,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:09:50,956 INFO L87 Difference]: Start difference. First operand 170432 states and 691309 transitions. Second operand 3 states. [2019-12-07 21:09:51,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:51,661 INFO L93 Difference]: Finished difference Result 170432 states and 683772 transitions. [2019-12-07 21:09:51,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:09:51,662 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 21:09:51,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:52,454 INFO L225 Difference]: With dead ends: 170432 [2019-12-07 21:09:52,454 INFO L226 Difference]: Without dead ends: 170432 [2019-12-07 21:09:52,455 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 21:09:53,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170432 states. [2019-12-07 21:09:56,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170432 to 169865. [2019-12-07 21:09:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169865 states. [2019-12-07 21:09:56,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169865 states to 169865 states and 681882 transitions. [2019-12-07 21:09:56,511 INFO L78 Accepts]: Start accepts. Automaton has 169865 states and 681882 transitions. Word has length 22 [2019-12-07 21:09:56,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:09:56,512 INFO L462 AbstractCegarLoop]: Abstraction has 169865 states and 681882 transitions. [2019-12-07 21:09:56,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:09:56,512 INFO L276 IsEmpty]: Start isEmpty. Operand 169865 states and 681882 transitions. [2019-12-07 21:09:56,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:09:56,524 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:09:56,524 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 21:09:56,524 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:09:56,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:09:56,525 INFO L82 PathProgramCache]: Analyzing trace with hash 556520531, now seen corresponding path program 1 times [2019-12-07 21:09:56,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:09:56,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949640528] [2019-12-07 21:09:56,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:09:56,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:09:56,589 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 21:09:56,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949640528] [2019-12-07 21:09:56,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:09:56,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:09:56,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672576793] [2019-12-07 21:09:56,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:09:56,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:09:56,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:09:56,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:56,590 INFO L87 Difference]: Start difference. First operand 169865 states and 681882 transitions. Second operand 4 states. [2019-12-07 21:09:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:09:57,271 INFO L93 Difference]: Finished difference Result 164672 states and 658149 transitions. [2019-12-07 21:09:57,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:09:57,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-12-07 21:09:57,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:09:57,652 INFO L225 Difference]: With dead ends: 164672 [2019-12-07 21:09:57,653 INFO L226 Difference]: Without dead ends: 164672 [2019-12-07 21:09:57,653 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:09:59,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164672 states. [2019-12-07 21:10:00,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164672 to 119962. [2019-12-07 21:10:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119962 states. [2019-12-07 21:10:01,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119962 states to 119962 states and 480911 transitions. [2019-12-07 21:10:01,241 INFO L78 Accepts]: Start accepts. Automaton has 119962 states and 480911 transitions. Word has length 22 [2019-12-07 21:10:01,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:01,241 INFO L462 AbstractCegarLoop]: Abstraction has 119962 states and 480911 transitions. [2019-12-07 21:10:01,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:10:01,241 INFO L276 IsEmpty]: Start isEmpty. Operand 119962 states and 480911 transitions. [2019-12-07 21:10:01,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 21:10:01,260 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:01,261 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 21:10:01,261 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:01,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:01,261 INFO L82 PathProgramCache]: Analyzing trace with hash -1096679272, now seen corresponding path program 1 times [2019-12-07 21:10:01,261 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:01,261 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278647264] [2019-12-07 21:10:01,261 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:01,306 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 21:10:01,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278647264] [2019-12-07 21:10:01,307 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:01,307 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:10:01,307 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787691389] [2019-12-07 21:10:01,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:10:01,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:01,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:10:01,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:10:01,308 INFO L87 Difference]: Start difference. First operand 119962 states and 480911 transitions. Second operand 5 states. [2019-12-07 21:10:02,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:02,475 INFO L93 Difference]: Finished difference Result 144276 states and 570909 transitions. [2019-12-07 21:10:02,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:10:02,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 21:10:02,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:02,807 INFO L225 Difference]: With dead ends: 144276 [2019-12-07 21:10:02,807 INFO L226 Difference]: Without dead ends: 144191 [2019-12-07 21:10:02,807 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:10:03,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144191 states. [2019-12-07 21:10:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144191 to 120256. [2019-12-07 21:10:07,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120256 states. [2019-12-07 21:10:07,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120256 states to 120256 states and 482041 transitions. [2019-12-07 21:10:07,527 INFO L78 Accepts]: Start accepts. Automaton has 120256 states and 482041 transitions. Word has length 25 [2019-12-07 21:10:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:07,527 INFO L462 AbstractCegarLoop]: Abstraction has 120256 states and 482041 transitions. [2019-12-07 21:10:07,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:10:07,527 INFO L276 IsEmpty]: Start isEmpty. Operand 120256 states and 482041 transitions. [2019-12-07 21:10:07,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-07 21:10:07,629 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:07,629 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:07,629 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:07,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:07,629 INFO L82 PathProgramCache]: Analyzing trace with hash 590197647, now seen corresponding path program 1 times [2019-12-07 21:10:07,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:07,630 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254063112] [2019-12-07 21:10:07,630 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:07,687 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 21:10:07,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254063112] [2019-12-07 21:10:07,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:07,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:10:07,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099074412] [2019-12-07 21:10:07,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:10:07,688 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:07,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:10:07,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:10:07,689 INFO L87 Difference]: Start difference. First operand 120256 states and 482041 transitions. Second operand 4 states. [2019-12-07 21:10:08,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:08,372 INFO L93 Difference]: Finished difference Result 183925 states and 729131 transitions. [2019-12-07 21:10:08,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:10:08,373 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-07 21:10:08,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:08,611 INFO L225 Difference]: With dead ends: 183925 [2019-12-07 21:10:08,611 INFO L226 Difference]: Without dead ends: 104234 [2019-12-07 21:10:08,612 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 21:10:09,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104234 states. [2019-12-07 21:10:11,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104234 to 102865. [2019-12-07 21:10:11,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102865 states. [2019-12-07 21:10:11,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102865 states to 102865 states and 384117 transitions. [2019-12-07 21:10:11,268 INFO L78 Accepts]: Start accepts. Automaton has 102865 states and 384117 transitions. Word has length 36 [2019-12-07 21:10:11,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:11,269 INFO L462 AbstractCegarLoop]: Abstraction has 102865 states and 384117 transitions. [2019-12-07 21:10:11,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:10:11,269 INFO L276 IsEmpty]: Start isEmpty. Operand 102865 states and 384117 transitions. [2019-12-07 21:10:11,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:10:11,355 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:11,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:11,356 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:11,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:11,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1265576290, now seen corresponding path program 1 times [2019-12-07 21:10:11,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:11,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251515540] [2019-12-07 21:10:11,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:11,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:11,404 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 21:10:11,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251515540] [2019-12-07 21:10:11,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:11,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:10:11,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036384266] [2019-12-07 21:10:11,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:10:11,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:11,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:10:11,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:10:11,405 INFO L87 Difference]: Start difference. First operand 102865 states and 384117 transitions. Second operand 4 states. [2019-12-07 21:10:11,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:11,995 INFO L93 Difference]: Finished difference Result 120742 states and 448213 transitions. [2019-12-07 21:10:11,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:10:11,995 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-07 21:10:11,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:12,563 INFO L225 Difference]: With dead ends: 120742 [2019-12-07 21:10:12,563 INFO L226 Difference]: Without dead ends: 120742 [2019-12-07 21:10:12,563 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:10:13,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120742 states. [2019-12-07 21:10:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120742 to 117760. [2019-12-07 21:10:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117760 states. [2019-12-07 21:10:15,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117760 states to 117760 states and 437740 transitions. [2019-12-07 21:10:15,677 INFO L78 Accepts]: Start accepts. Automaton has 117760 states and 437740 transitions. Word has length 37 [2019-12-07 21:10:15,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:15,677 INFO L462 AbstractCegarLoop]: Abstraction has 117760 states and 437740 transitions. [2019-12-07 21:10:15,677 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:10:15,677 INFO L276 IsEmpty]: Start isEmpty. Operand 117760 states and 437740 transitions. [2019-12-07 21:10:15,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:10:15,776 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:15,776 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:15,777 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:15,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:15,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1791187932, now seen corresponding path program 2 times [2019-12-07 21:10:15,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:15,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989044694] [2019-12-07 21:10:15,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:15,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:15,871 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 21:10:15,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989044694] [2019-12-07 21:10:15,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:15,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:10:15,871 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162980178] [2019-12-07 21:10:15,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:10:15,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:15,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:10:15,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:10:15,872 INFO L87 Difference]: Start difference. First operand 117760 states and 437740 transitions. Second operand 8 states. [2019-12-07 21:10:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:17,289 INFO L93 Difference]: Finished difference Result 175403 states and 653129 transitions. [2019-12-07 21:10:17,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 21:10:17,290 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 37 [2019-12-07 21:10:17,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:17,671 INFO L225 Difference]: With dead ends: 175403 [2019-12-07 21:10:17,671 INFO L226 Difference]: Without dead ends: 175403 [2019-12-07 21:10:17,671 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=311, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:10:19,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175403 states. [2019-12-07 21:10:21,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175403 to 161125. [2019-12-07 21:10:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161125 states. [2019-12-07 21:10:22,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161125 states to 161125 states and 603055 transitions. [2019-12-07 21:10:22,034 INFO L78 Accepts]: Start accepts. Automaton has 161125 states and 603055 transitions. Word has length 37 [2019-12-07 21:10:22,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:22,035 INFO L462 AbstractCegarLoop]: Abstraction has 161125 states and 603055 transitions. [2019-12-07 21:10:22,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:10:22,035 INFO L276 IsEmpty]: Start isEmpty. Operand 161125 states and 603055 transitions. [2019-12-07 21:10:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:10:22,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:22,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:22,202 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:22,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:22,202 INFO L82 PathProgramCache]: Analyzing trace with hash 1145409926, now seen corresponding path program 3 times [2019-12-07 21:10:22,202 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:22,202 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250533679] [2019-12-07 21:10:22,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:22,322 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 21:10:22,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250533679] [2019-12-07 21:10:22,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:22,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 21:10:22,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886273912] [2019-12-07 21:10:22,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 21:10:22,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:22,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 21:10:22,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 21:10:22,324 INFO L87 Difference]: Start difference. First operand 161125 states and 603055 transitions. Second operand 10 states. [2019-12-07 21:10:23,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:23,862 INFO L93 Difference]: Finished difference Result 188875 states and 700809 transitions. [2019-12-07 21:10:23,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 21:10:23,862 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 37 [2019-12-07 21:10:23,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:24,190 INFO L225 Difference]: With dead ends: 188875 [2019-12-07 21:10:24,190 INFO L226 Difference]: Without dead ends: 168590 [2019-12-07 21:10:24,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2019-12-07 21:10:25,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168590 states. [2019-12-07 21:10:29,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168590 to 157621. [2019-12-07 21:10:29,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157621 states. [2019-12-07 21:10:29,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157621 states to 157621 states and 589647 transitions. [2019-12-07 21:10:29,525 INFO L78 Accepts]: Start accepts. Automaton has 157621 states and 589647 transitions. Word has length 37 [2019-12-07 21:10:29,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:29,526 INFO L462 AbstractCegarLoop]: Abstraction has 157621 states and 589647 transitions. [2019-12-07 21:10:29,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 21:10:29,526 INFO L276 IsEmpty]: Start isEmpty. Operand 157621 states and 589647 transitions. [2019-12-07 21:10:29,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-07 21:10:29,706 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:29,706 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:29,706 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:29,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:29,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1086732783, now seen corresponding path program 1 times [2019-12-07 21:10:29,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:29,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210547644] [2019-12-07 21:10:29,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:29,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:29,755 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 21:10:29,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210547644] [2019-12-07 21:10:29,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:29,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:10:29,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759505371] [2019-12-07 21:10:29,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:10:29,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:29,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:10:29,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:10:29,756 INFO L87 Difference]: Start difference. First operand 157621 states and 589647 transitions. Second operand 5 states. [2019-12-07 21:10:29,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:29,995 INFO L93 Difference]: Finished difference Result 68665 states and 230306 transitions. [2019-12-07 21:10:29,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:10:29,996 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 38 [2019-12-07 21:10:29,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:30,089 INFO L225 Difference]: With dead ends: 68665 [2019-12-07 21:10:30,089 INFO L226 Difference]: Without dead ends: 61537 [2019-12-07 21:10:30,089 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 21:10:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61537 states. [2019-12-07 21:10:31,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61537 to 61537. [2019-12-07 21:10:31,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61537 states. [2019-12-07 21:10:31,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61537 states to 61537 states and 205703 transitions. [2019-12-07 21:10:31,472 INFO L78 Accepts]: Start accepts. Automaton has 61537 states and 205703 transitions. Word has length 38 [2019-12-07 21:10:31,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:31,472 INFO L462 AbstractCegarLoop]: Abstraction has 61537 states and 205703 transitions. [2019-12-07 21:10:31,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:10:31,472 INFO L276 IsEmpty]: Start isEmpty. Operand 61537 states and 205703 transitions. [2019-12-07 21:10:31,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-07 21:10:31,521 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:31,521 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] [2019-12-07 21:10:31,521 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:31,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:31,522 INFO L82 PathProgramCache]: Analyzing trace with hash -1377430370, now seen corresponding path program 1 times [2019-12-07 21:10:31,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:31,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452547736] [2019-12-07 21:10:31,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:31,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:31,568 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 21:10:31,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452547736] [2019-12-07 21:10:31,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:31,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:10:31,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278779647] [2019-12-07 21:10:31,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:10:31,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:31,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:10:31,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:10:31,570 INFO L87 Difference]: Start difference. First operand 61537 states and 205703 transitions. Second operand 6 states. [2019-12-07 21:10:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:31,650 INFO L93 Difference]: Finished difference Result 13754 states and 40921 transitions. [2019-12-07 21:10:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:10:31,650 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2019-12-07 21:10:31,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:31,662 INFO L225 Difference]: With dead ends: 13754 [2019-12-07 21:10:31,663 INFO L226 Difference]: Without dead ends: 11152 [2019-12-07 21:10:31,663 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-07 21:10:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11152 states. [2019-12-07 21:10:31,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11152 to 11128. [2019-12-07 21:10:31,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11128 states. [2019-12-07 21:10:31,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11128 states to 11128 states and 32123 transitions. [2019-12-07 21:10:31,795 INFO L78 Accepts]: Start accepts. Automaton has 11128 states and 32123 transitions. Word has length 39 [2019-12-07 21:10:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:31,796 INFO L462 AbstractCegarLoop]: Abstraction has 11128 states and 32123 transitions. [2019-12-07 21:10:31,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:10:31,796 INFO L276 IsEmpty]: Start isEmpty. Operand 11128 states and 32123 transitions. [2019-12-07 21:10:31,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 21:10:31,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:31,805 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:31,805 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:31,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:31,805 INFO L82 PathProgramCache]: Analyzing trace with hash 654156702, now seen corresponding path program 1 times [2019-12-07 21:10:31,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:31,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311015404] [2019-12-07 21:10:31,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:31,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:31,854 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 21:10:31,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311015404] [2019-12-07 21:10:31,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:31,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:10:31,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845783212] [2019-12-07 21:10:31,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:10:31,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:31,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:10:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:10:31,855 INFO L87 Difference]: Start difference. First operand 11128 states and 32123 transitions. Second operand 4 states. [2019-12-07 21:10:31,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:31,893 INFO L93 Difference]: Finished difference Result 12877 states and 36091 transitions. [2019-12-07 21:10:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:10:31,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 21:10:31,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:31,902 INFO L225 Difference]: With dead ends: 12877 [2019-12-07 21:10:31,903 INFO L226 Difference]: Without dead ends: 9343 [2019-12-07 21:10:31,903 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:10:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9343 states. [2019-12-07 21:10:31,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9343 to 9326. [2019-12-07 21:10:31,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9326 states. [2019-12-07 21:10:32,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9326 states to 9326 states and 25632 transitions. [2019-12-07 21:10:32,011 INFO L78 Accepts]: Start accepts. Automaton has 9326 states and 25632 transitions. Word has length 50 [2019-12-07 21:10:32,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:32,011 INFO L462 AbstractCegarLoop]: Abstraction has 9326 states and 25632 transitions. [2019-12-07 21:10:32,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:10:32,011 INFO L276 IsEmpty]: Start isEmpty. Operand 9326 states and 25632 transitions. [2019-12-07 21:10:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 21:10:32,018 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:32,018 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:32,018 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:32,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:32,018 INFO L82 PathProgramCache]: Analyzing trace with hash 101485776, now seen corresponding path program 2 times [2019-12-07 21:10:32,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:32,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986312971] [2019-12-07 21:10:32,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:32,087 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 21:10:32,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986312971] [2019-12-07 21:10:32,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:32,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:10:32,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567842818] [2019-12-07 21:10:32,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:10:32,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:32,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:10:32,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:10:32,089 INFO L87 Difference]: Start difference. First operand 9326 states and 25632 transitions. Second operand 7 states. [2019-12-07 21:10:32,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:32,176 INFO L93 Difference]: Finished difference Result 7890 states and 22377 transitions. [2019-12-07 21:10:32,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:10:32,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 21:10:32,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:32,180 INFO L225 Difference]: With dead ends: 7890 [2019-12-07 21:10:32,181 INFO L226 Difference]: Without dead ends: 3009 [2019-12-07 21:10:32,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 21:10:32,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3009 states. [2019-12-07 21:10:32,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3009 to 2997. [2019-12-07 21:10:32,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2997 states. [2019-12-07 21:10:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2997 states to 2997 states and 7847 transitions. [2019-12-07 21:10:32,223 INFO L78 Accepts]: Start accepts. Automaton has 2997 states and 7847 transitions. Word has length 50 [2019-12-07 21:10:32,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:32,223 INFO L462 AbstractCegarLoop]: Abstraction has 2997 states and 7847 transitions. [2019-12-07 21:10:32,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:10:32,223 INFO L276 IsEmpty]: Start isEmpty. Operand 2997 states and 7847 transitions. [2019-12-07 21:10:32,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:10:32,225 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:32,225 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:10:32,225 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1453583801, now seen corresponding path program 1 times [2019-12-07 21:10:32,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:32,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452363978] [2019-12-07 21:10:32,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:32,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:32,267 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 21:10:32,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452363978] [2019-12-07 21:10:32,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:32,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:10:32,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780223688] [2019-12-07 21:10:32,268 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:10:32,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:32,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:10:32,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:10:32,269 INFO L87 Difference]: Start difference. First operand 2997 states and 7847 transitions. Second operand 4 states. [2019-12-07 21:10:32,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:32,289 INFO L93 Difference]: Finished difference Result 3416 states and 8806 transitions. [2019-12-07 21:10:32,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:10:32,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-07 21:10:32,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:32,290 INFO L225 Difference]: With dead ends: 3416 [2019-12-07 21:10:32,291 INFO L226 Difference]: Without dead ends: 484 [2019-12-07 21:10:32,291 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:10:32,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2019-12-07 21:10:32,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2019-12-07 21:10:32,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 484 states. [2019-12-07 21:10:32,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 1057 transitions. [2019-12-07 21:10:32,297 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 1057 transitions. Word has length 65 [2019-12-07 21:10:32,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:32,297 INFO L462 AbstractCegarLoop]: Abstraction has 484 states and 1057 transitions. [2019-12-07 21:10:32,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:10:32,297 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 1057 transitions. [2019-12-07 21:10:32,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:10:32,298 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:32,298 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 21:10:32,298 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:32,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:32,299 INFO L82 PathProgramCache]: Analyzing trace with hash 1736859180, now seen corresponding path program 1 times [2019-12-07 21:10:32,299 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:32,299 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113524193] [2019-12-07 21:10:32,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:32,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:10:32,381 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 21:10:32,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113524193] [2019-12-07 21:10:32,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:10:32,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:10:32,382 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728586152] [2019-12-07 21:10:32,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:10:32,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:10:32,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:10:32,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:10:32,382 INFO L87 Difference]: Start difference. First operand 484 states and 1057 transitions. Second operand 7 states. [2019-12-07 21:10:32,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:10:32,558 INFO L93 Difference]: Finished difference Result 989 states and 2125 transitions. [2019-12-07 21:10:32,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 21:10:32,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 21:10:32,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:10:32,559 INFO L225 Difference]: With dead ends: 989 [2019-12-07 21:10:32,559 INFO L226 Difference]: Without dead ends: 738 [2019-12-07 21:10:32,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 21:10:32,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2019-12-07 21:10:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 550. [2019-12-07 21:10:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-12-07 21:10:32,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1174 transitions. [2019-12-07 21:10:32,565 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1174 transitions. Word has length 66 [2019-12-07 21:10:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:10:32,565 INFO L462 AbstractCegarLoop]: Abstraction has 550 states and 1174 transitions. [2019-12-07 21:10:32,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:10:32,565 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1174 transitions. [2019-12-07 21:10:32,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:10:32,565 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:10:32,565 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 21:10:32,566 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 21:10:32,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:10:32,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1869585708, now seen corresponding path program 2 times [2019-12-07 21:10:32,566 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:10:32,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573823041] [2019-12-07 21:10:32,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:10:32,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:10:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:10:32,638 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:10:32,639 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:10:32,641 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 |v_ULTIMATE.start_main_~#t189~0.offset_28|) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44| 1)) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t189~0.base_44| 4)) (= v_~z$w_buff0~0_341 0) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44|) |v_ULTIMATE.start_main_~#t189~0.offset_28| 0)) |v_#memory_int_29|) (= 0 v_~weak$$choice0~0_191) (= (select .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44|) 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t189~0.base_44|) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_36|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~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_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t189~0.base=|v_ULTIMATE.start_main_~#t189~0.base_44|, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_24|, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_23|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_~#t189~0.offset=|v_ULTIMATE.start_main_~#t189~0.offset_28|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_24|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t189~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t190~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t191~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t192~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t189~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t191~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:10:32,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t190~0.base_11|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t190~0.base_11|)) (= |v_ULTIMATE.start_main_~#t190~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t190~0.base_11| 4) |v_#length_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11|) |v_ULTIMATE.start_main_~#t190~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t190~0.offset, #length] because there is no mapped edge [2019-12-07 21:10:32,642 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t191~0.base_12| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t191~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12|) |v_ULTIMATE.start_main_~#t191~0.offset_11| 2)) |v_#memory_int_21|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12|) 0) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t191~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t191~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t191~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t191~0.base] because there is no mapped edge [2019-12-07 21:10:32,643 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t192~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t192~0.base_13| 4) |v_#length_23|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13|) |v_ULTIMATE.start_main_~#t192~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t192~0.base_13|) (= |v_ULTIMATE.start_main_~#t192~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_~#t192~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:10:32,644 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 21:10:32,645 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-457427318| |P3Thread1of1ForFork2_#t~ite29_Out-457427318|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-457427318 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-457427318 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-457427318| ~z$w_buff1~0_In-457427318) .cse0 (or .cse1 .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-457427318| ~z$w_buff0~0_In-457427318) .cse0 (not .cse1) (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-457427318, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-457427318, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-457427318, ~z$w_buff1~0=~z$w_buff1~0_In-457427318} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-457427318|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-457427318|, ~z$w_buff0~0=~z$w_buff0~0_In-457427318, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-457427318, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-457427318, ~z$w_buff1~0=~z$w_buff1~0_In-457427318} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:10:32,648 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:10:32,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1262605330 256) 0))) (or (and .cse0 (= ~z~0_In1262605330 |P3Thread1of1ForFork2_#t~ite48_Out1262605330|)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1262605330| ~z$mem_tmp~0_In1262605330) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1262605330, ~z$flush_delayed~0=~z$flush_delayed~0_In1262605330, ~z~0=~z~0_In1262605330} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1262605330, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1262605330|, ~z$flush_delayed~0=~z$flush_delayed~0_In1262605330, ~z~0=~z~0_In1262605330} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:10:32,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 21:10:32,649 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 21:10:32,656 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In509218685 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In509218685 |P2Thread1of1ForFork1_#t~ite25_Out509218685|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out509218685| ~z~0_In509218685)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In509218685, ~z$flush_delayed~0=~z$flush_delayed~0_In509218685, ~z~0=~z~0_In509218685} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In509218685, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out509218685|, ~z$flush_delayed~0=~z$flush_delayed~0_In509218685, ~z~0=~z~0_In509218685} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:10:32,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2138364957 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In2138364957 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out2138364957|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In2138364957 |P3Thread1of1ForFork2_#t~ite51_Out2138364957|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2138364957, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2138364957} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out2138364957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2138364957, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2138364957} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:10:32,657 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1485499863 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1485499863 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1485499863 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1485499863 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1485499863 |P3Thread1of1ForFork2_#t~ite52_Out-1485499863|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1485499863|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1485499863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1485499863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1485499863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1485499863} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1485499863|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1485499863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1485499863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1485499863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1485499863} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:10:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-978198162 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-978198162 ~z$r_buff0_thd4~0_In-978198162)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-978198162 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-978198162)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-978198162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-978198162} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-978198162|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-978198162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-978198162} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:10:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-463916567 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-463916567 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-463916567 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-463916567 256)))) (or (and (= ~z$r_buff1_thd4~0_In-463916567 |P3Thread1of1ForFork2_#t~ite54_Out-463916567|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-463916567|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-463916567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-463916567, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-463916567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-463916567} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-463916567|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-463916567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-463916567, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-463916567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-463916567} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:10:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:10:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:10:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:10:32,658 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out277047977| |ULTIMATE.start_main_#t~ite60_Out277047977|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In277047977 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In277047977 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite59_Out277047977| ~z~0_In277047977)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out277047977| ~z$w_buff1~0_In277047977)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In277047977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In277047977, ~z$w_buff1~0=~z$w_buff1~0_In277047977, ~z~0=~z~0_In277047977} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out277047977|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In277047977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In277047977, ~z$w_buff1~0=~z$w_buff1~0_In277047977, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out277047977|, ~z~0=~z~0_In277047977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:10:32,659 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-888000713 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-888000713 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-888000713|)) (and (= ~z$w_buff0_used~0_In-888000713 |ULTIMATE.start_main_#t~ite61_Out-888000713|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-888000713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888000713} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-888000713, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-888000713|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888000713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:10:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1799310765 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1799310765 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1799310765 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1799310765 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1799310765 |ULTIMATE.start_main_#t~ite62_Out-1799310765|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite62_Out-1799310765| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1799310765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799310765, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1799310765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799310765} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1799310765|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1799310765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799310765, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1799310765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799310765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:10:32,660 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In860965771 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In860965771 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out860965771| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out860965771| ~z$r_buff0_thd0~0_In860965771)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In860965771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In860965771} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out860965771|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In860965771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In860965771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:10:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-163857163 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-163857163 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-163857163 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-163857163 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out-163857163| ~z$r_buff1_thd0~0_In-163857163)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite64_Out-163857163| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163857163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163857163, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-163857163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163857163} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163857163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163857163, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-163857163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163857163, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-163857163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:10:32,661 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:10:32,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:10:32 BasicIcfg [2019-12-07 21:10:32,735 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:10:32,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:10:32,736 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:10:32,736 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:10:32,736 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:08:56" (3/4) ... [2019-12-07 21:10:32,738 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:10:32,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L856: Formula: (let ((.cse0 (store |v_#valid_90| 0 0))) (and (= v_~__unbuffered_cnt~0_147 0) (= 0 v_~__unbuffered_p0_EAX~0_62) (= v_~z$r_buff0_thd1~0_96 0) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~z$mem_tmp~0_203) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 |v_ULTIMATE.start_main_~#t189~0.offset_28|) (= v_~z$r_buff1_thd1~0_165 0) (= v_~__unbuffered_p2_EBX~0_79 0) (= 0 v_~z$flush_delayed~0_235) (= 0 v_~z$r_buff0_thd4~0_512) (= 0 v_~z$r_buff0_thd3~0_418) (= |v_#valid_88| (store .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44| 1)) (= v_~z$w_buff0_used~0_907 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~weak$$choice2~0_286 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p3_EBX~0_60) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t189~0.base_44| 4)) (= v_~z$w_buff0~0_341 0) (= 0 v_~__unbuffered_p3_EAX~0_66) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff0_thd0~0_165 0) (= v_~a~0_32 0) (= |v_#NULL.offset_5| 0) (= 0 v_~z$r_buff1_thd3~0_405) (= v_~z$r_buff0_thd2~0_96 0) (= v_~y~0_94 0) (= (store |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44| (store (select |v_#memory_int_30| |v_ULTIMATE.start_main_~#t189~0.base_44|) |v_ULTIMATE.start_main_~#t189~0.offset_28| 0)) |v_#memory_int_29|) (= 0 v_~weak$$choice0~0_191) (= (select .cse0 |v_ULTIMATE.start_main_~#t189~0.base_44|) 0) (= v_~z$w_buff1~0_234 0) (= v_~x~0_46 0) (= v_~main$tmp_guard1~0_52 0) (= v_~z$w_buff1_used~0_667 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t189~0.base_44|) (= v_~z$r_buff1_thd2~0_165 0) (= 0 |v_#NULL.base_5|) (= 0 v_~z$r_buff1_thd4~0_334) (= v_~z~0_304 0) (= v_~z$r_buff1_thd0~0_255 0) (= v_~main$tmp_guard0~0_37 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_90|, #memory_int=|v_#memory_int_30|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_8|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_36|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_165, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_104|, ~a~0=v_~a~0_32, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_165, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_62, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_512, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_66, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~z$mem_tmp~0=v_~z$mem_tmp~0_203, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_79, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_667, ~z$flush_delayed~0=v_~z$flush_delayed~0_235, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_191, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_206|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_165, ~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_418, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t189~0.base=|v_ULTIMATE.start_main_~#t189~0.base_44|, ~x~0=v_~x~0_46, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_334, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_21|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_8|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_24|, ~z$w_buff1~0=v_~z$w_buff1~0_234, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_52, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_255, ~y~0=v_~y~0_94, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_23|, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_96, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_18|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_907, ~z$w_buff0~0=v_~z$w_buff0~0_341, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_405, ULTIMATE.start_main_~#t189~0.offset=|v_ULTIMATE.start_main_~#t189~0.offset_28|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_68|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_37, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_60, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_80|, ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_24|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_97|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_27|, #valid=|v_#valid_88|, #memory_int=|v_#memory_int_29|, ~z~0=v_~z~0_304, ~weak$$choice2~0=v_~weak$$choice2~0_286, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t189~0.base, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t190~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ~y~0, ULTIMATE.start_main_~#t191~0.base, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t192~0.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t189~0.offset, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t191~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 21:10:32,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1033] [1033] L856-1-->L858: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t190~0.base_11|) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11|)) (not (= 0 |v_ULTIMATE.start_main_~#t190~0.base_11|)) (= |v_ULTIMATE.start_main_~#t190~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t190~0.base_11| 4) |v_#length_19|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t190~0.base_11| 1)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t190~0.base_11|) |v_ULTIMATE.start_main_~#t190~0.offset_10| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_20|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t190~0.base=|v_ULTIMATE.start_main_~#t190~0.base_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t190~0.offset=|v_ULTIMATE.start_main_~#t190~0.offset_10|, #length=|v_#length_19|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t190~0.base, ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t190~0.offset, #length] because there is no mapped edge [2019-12-07 21:10:32,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L858-1-->L860: Formula: (and (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t191~0.base_12| 4)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t191~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t191~0.base_12|) |v_ULTIMATE.start_main_~#t191~0.offset_11| 2)) |v_#memory_int_21|) (= (select |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12|) 0) (= |v_#valid_48| (store |v_#valid_49| |v_ULTIMATE.start_main_~#t191~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t191~0.offset_11| 0) (not (= |v_ULTIMATE.start_main_~#t191~0.base_12| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t191~0.offset=|v_ULTIMATE.start_main_~#t191~0.offset_11|, #valid=|v_#valid_48|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_21|, #length=|v_#length_21|, ULTIMATE.start_main_~#t191~0.base=|v_ULTIMATE.start_main_~#t191~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t191~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length, ULTIMATE.start_main_~#t191~0.base] because there is no mapped edge [2019-12-07 21:10:32,739 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L860-1-->L862: Formula: (and (= 0 (select |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13|)) (not (= 0 |v_ULTIMATE.start_main_~#t192~0.base_13|)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t192~0.base_13| 4) |v_#length_23|) (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t192~0.base_13| 1) |v_#valid_50|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t192~0.base_13|) |v_ULTIMATE.start_main_~#t192~0.offset_11| 3)) |v_#memory_int_23|) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t192~0.base_13|) (= |v_ULTIMATE.start_main_~#t192~0.offset_11| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t192~0.base=|v_ULTIMATE.start_main_~#t192~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t192~0.offset=|v_ULTIMATE.start_main_~#t192~0.offset_11|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t192~0.base, ULTIMATE.start_main_~#t192~0.offset, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:10:32,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [907] [907] P3ENTRY-->L4-3: Formula: (and (= 1 v_~z$w_buff0~0_34) (= v_~z$w_buff0~0_35 v_~z$w_buff1~0_22) (= |v_P3Thread1of1ForFork2_#in~arg.offset_9| v_P3Thread1of1ForFork2_~arg.offset_7) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_105 256) 0)) (not (= (mod v_~z$w_buff1_used~0_57 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 0)) (= v_P3Thread1of1ForFork2_~arg.base_7 |v_P3Thread1of1ForFork2_#in~arg.base_9|) (= v_~z$w_buff0_used~0_106 v_~z$w_buff1_used~0_57) (= v_~z$w_buff0_used~0_105 1) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_106, ~z$w_buff0~0=v_~z$w_buff0~0_35, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_9, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_7, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_105, ~z$w_buff0~0=v_~z$w_buff0~0_34, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_57, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_9|, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_7|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_7, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_9|} AuxVars[] AssignedVars[P3Thread1of1ForFork2___VERIFIER_assert_~expression, P3Thread1of1ForFork2_~arg.offset, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression, P3Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-07 21:10:32,740 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L818-2-->L818-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-457427318| |P3Thread1of1ForFork2_#t~ite29_Out-457427318|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-457427318 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-457427318 256)))) (or (and (= |P3Thread1of1ForFork2_#t~ite28_Out-457427318| ~z$w_buff1~0_In-457427318) .cse0 (or .cse1 .cse2)) (and (= |P3Thread1of1ForFork2_#t~ite28_Out-457427318| ~z$w_buff0~0_In-457427318) .cse0 (not .cse1) (not .cse2)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-457427318, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-457427318, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-457427318, ~z$w_buff1~0=~z$w_buff1~0_In-457427318} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-457427318|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-457427318|, ~z$w_buff0~0=~z$w_buff0~0_In-457427318, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-457427318, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-457427318, ~z$w_buff1~0=~z$w_buff1~0_In-457427318} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:10:32,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L823-->L824: Formula: (and (= v_~z$r_buff0_thd4~0_105 v_~z$r_buff0_thd4~0_104) (not (= 0 (mod v_~weak$$choice2~0_68 256)))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_68} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_104, ~weak$$choice2~0=v_~weak$$choice2~0_68} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:10:32,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L826-->L826-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1262605330 256) 0))) (or (and .cse0 (= ~z~0_In1262605330 |P3Thread1of1ForFork2_#t~ite48_Out1262605330|)) (and (= |P3Thread1of1ForFork2_#t~ite48_Out1262605330| ~z$mem_tmp~0_In1262605330) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1262605330, ~z$flush_delayed~0=~z$flush_delayed~0_In1262605330, ~z~0=~z~0_In1262605330} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1262605330, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1262605330|, ~z$flush_delayed~0=~z$flush_delayed~0_In1262605330, ~z~0=~z~0_In1262605330} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:10:32,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~x~0_14 v_~__unbuffered_p0_EAX~0_18) (= v_~a~0_16 1) (= |v_P0Thread1of1ForFork3_#in~arg.offset_10| v_P0Thread1of1ForFork3_~arg.offset_8) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_P0Thread1of1ForFork3_~arg.base_8 |v_P0Thread1of1ForFork3_#in~arg.base_10|)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} OutVars{~a~0=v_~a~0_16, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_18, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_10|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_8, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_8, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_10|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 21:10:32,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= (+ v_~__unbuffered_cnt~0_66 1) v_~__unbuffered_cnt~0_65) (= v_~y~0_39 1) (= v_~x~0_11 1) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_65, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_39, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 21:10:32,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L788-->L788-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In509218685 256) 0))) (or (and (not .cse0) (= ~z$mem_tmp~0_In509218685 |P2Thread1of1ForFork1_#t~ite25_Out509218685|)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out509218685| ~z~0_In509218685)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In509218685, ~z$flush_delayed~0=~z$flush_delayed~0_In509218685, ~z~0=~z~0_In509218685} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In509218685, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out509218685|, ~z$flush_delayed~0=~z$flush_delayed~0_In509218685, ~z~0=~z~0_In509218685} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:10:32,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L834-->L834-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2138364957 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In2138364957 256) 0))) (or (and (= 0 |P3Thread1of1ForFork2_#t~ite51_Out2138364957|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In2138364957 |P3Thread1of1ForFork2_#t~ite51_Out2138364957|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2138364957, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2138364957} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out2138364957|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2138364957, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In2138364957} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:10:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L835-->L835-2: Formula: (let ((.cse3 (= (mod ~z$w_buff0_used~0_In-1485499863 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd4~0_In-1485499863 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1485499863 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In-1485499863 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1485499863 |P3Thread1of1ForFork2_#t~ite52_Out-1485499863|) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1485499863|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1485499863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1485499863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1485499863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1485499863} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1485499863|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1485499863, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1485499863, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1485499863, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1485499863} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:10:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L836-->L837: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-978198162 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-978198162 ~z$r_buff0_thd4~0_In-978198162)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-978198162 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out-978198162)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-978198162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-978198162} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-978198162|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-978198162, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-978198162} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:10:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L837-->L837-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-463916567 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-463916567 256) 0)) (.cse2 (= (mod ~z$r_buff0_thd4~0_In-463916567 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-463916567 256)))) (or (and (= ~z$r_buff1_thd4~0_In-463916567 |P3Thread1of1ForFork2_#t~ite54_Out-463916567|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P3Thread1of1ForFork2_#t~ite54_Out-463916567|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-463916567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-463916567, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-463916567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-463916567} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-463916567|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-463916567, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-463916567, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-463916567, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-463916567} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:10:32,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L837-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork2_#t~ite54_30| v_~z$r_buff1_thd4~0_260) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_29|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_260, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 21:10:32,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L788-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_189) (= v_~z~0_189 |v_P2Thread1of1ForFork1_#t~ite25_44|) (= (+ v_~__unbuffered_cnt~0_56 1) v_~__unbuffered_cnt~0_55) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_43|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ~z$flush_delayed~0=v_~z$flush_delayed~0_189, ~z~0=v_~z~0_189, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 21:10:32,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [908] [908] L866-->L868-2: Formula: (and (or (= (mod v_~z$w_buff0_used~0_107 256) 0) (= 0 (mod v_~z$r_buff0_thd0~0_14 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_14, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_107, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:10:32,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L868-2-->L868-5: Formula: (let ((.cse0 (= |ULTIMATE.start_main_#t~ite59_Out277047977| |ULTIMATE.start_main_#t~ite60_Out277047977|)) (.cse2 (= (mod ~z$r_buff1_thd0~0_In277047977 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In277047977 256)))) (or (and .cse0 (or .cse1 .cse2) (= |ULTIMATE.start_main_#t~ite59_Out277047977| ~z~0_In277047977)) (and .cse0 (not .cse2) (not .cse1) (= |ULTIMATE.start_main_#t~ite59_Out277047977| ~z$w_buff1~0_In277047977)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In277047977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In277047977, ~z$w_buff1~0=~z$w_buff1~0_In277047977, ~z~0=~z~0_In277047977} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out277047977|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In277047977, ~z$w_buff1_used~0=~z$w_buff1_used~0_In277047977, ~z$w_buff1~0=~z$w_buff1~0_In277047977, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out277047977|, ~z~0=~z~0_In277047977} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:10:32,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L869-->L869-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-888000713 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-888000713 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite61_Out-888000713|)) (and (= ~z$w_buff0_used~0_In-888000713 |ULTIMATE.start_main_#t~ite61_Out-888000713|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-888000713, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888000713} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-888000713, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-888000713|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-888000713} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:10:32,755 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L870-->L870-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-1799310765 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1799310765 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In-1799310765 256) 0)) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1799310765 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1799310765 |ULTIMATE.start_main_#t~ite62_Out-1799310765|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite62_Out-1799310765| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1799310765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799310765, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1799310765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799310765} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1799310765|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1799310765, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1799310765, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1799310765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1799310765} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:10:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L871-->L871-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In860965771 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In860965771 256)))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out860965771| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite63_Out860965771| ~z$r_buff0_thd0~0_In860965771)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In860965771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In860965771} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out860965771|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In860965771, ~z$w_buff0_used~0=~z$w_buff0_used~0_In860965771} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:10:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L872-->L872-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-163857163 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-163857163 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-163857163 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-163857163 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out-163857163| ~z$r_buff1_thd0~0_In-163857163)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite64_Out-163857163| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163857163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163857163, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-163857163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163857163} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-163857163, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-163857163, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-163857163, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-163857163, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-163857163|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:10:32,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L872-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_18 256)) (= v_~main$tmp_guard1~0_18 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_26) (= 1 v_~__unbuffered_p3_EAX~0_28) (= 0 v_~__unbuffered_p3_EBX~0_24) (= v_~__unbuffered_p2_EBX~0_43 0) (= v_~y~0_52 2) (= 2 v_~__unbuffered_p2_EAX~0_41))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~z$r_buff1_thd0~0_221 |v_ULTIMATE.start_main_#t~ite64_41|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_221, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_28, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_41, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_24, ~y~0=v_~y~0_52, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 21:10:32,817 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_21a81d63-d3ce-41d5-811f-74809a2ef9db/bin/utaipan/witness.graphml [2019-12-07 21:10:32,818 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:10:32,819 INFO L168 Benchmark]: Toolchain (without parser) took 97735.65 ms. Allocated memory was 1.0 GB in the beginning and 7.5 GB in the end (delta: 6.5 GB). Free memory was 940.9 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2019-12-07 21:10:32,819 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:10:32,819 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:10:32,819 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:10:32,820 INFO L168 Benchmark]: Boogie Preprocessor took 27.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:10:32,820 INFO L168 Benchmark]: RCFGBuilder took 455.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. [2019-12-07 21:10:32,820 INFO L168 Benchmark]: TraceAbstraction took 96708.49 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.4 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2019-12-07 21:10:32,821 INFO L168 Benchmark]: Witness Printer took 82.23 ms. Allocated memory is still 7.5 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 21:10:32,822 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.7 MB). Free memory was 940.9 MB in the beginning and 1.1 GB in the end (delta: -144.1 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.67 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.2 MB). Peak memory consumption was 62.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 96708.49 ms. Allocated memory was 1.2 GB in the beginning and 7.5 GB in the end (delta: 6.4 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 82.23 ms. Allocated memory is still 7.5 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 212 ProgramPointsBefore, 112 ProgramPointsAfterwards, 255 TransitionsBefore, 132 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 48 ConcurrentYvCompositions, 28 ChoiceCompositions, 11185 VarBasedMoverChecksPositive, 321 VarBasedMoverChecksNegative, 83 SemBasedMoverChecksPositive, 338 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.2s, 0 MoverChecksTotal, 141939 CheckedPairsTotal, 133 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L856] FCALL, FORK 0 pthread_create(&t189, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] FCALL, FORK 0 pthread_create(&t190, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] FCALL, FORK 0 pthread_create(&t191, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] FCALL, FORK 0 pthread_create(&t192, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L806] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L807] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L808] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L809] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L810] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L811] 4 z$r_buff0_thd4 = (_Bool)1 [L814] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L815] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L816] 4 z$flush_delayed = weak$$choice2 [L817] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L819] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L820] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L821] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L822] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L822] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L824] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L825] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L826] 4 z = z$flush_delayed ? z$mem_tmp : z [L827] 4 z$flush_delayed = (_Bool)0 [L830] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 2 [L773] 3 __unbuffered_p2_EAX = y [L776] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L777] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L778] 3 z$flush_delayed = weak$$choice2 [L779] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 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) [L781] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 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)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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)) [L783] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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)) [L784] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 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)) [L785] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L786] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 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)) [L787] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L833] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L834] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L835] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L864] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 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) [L869] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L870] 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 [L871] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 200 locations, 2 error locations. Result: UNSAFE, OverallTime: 96.5s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3955 SDtfs, 6103 SDslu, 7447 SDs, 0 SdLazy, 2794 SolverSat, 196 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 170 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=205249occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 61.7s AutomataMinimizationTime, 19 MinimizatonAttempts, 132353 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 694 NumberOfCodeBlocks, 694 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 115751 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...