./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_rmo.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_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/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 6513be41311960d6a56653c4e3c74e99432f54f9 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:21:54,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 21:21:54,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 21:21:54,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 21:21:54,458 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 21:21:54,459 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 21:21:54,460 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 21:21:54,461 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 21:21:54,463 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 21:21:54,464 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 21:21:54,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 21:21:54,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 21:21:54,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 21:21:54,466 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 21:21:54,467 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 21:21:54,467 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 21:21:54,468 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 21:21:54,468 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 21:21:54,470 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 21:21:54,471 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 21:21:54,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 21:21:54,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 21:21:54,474 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 21:21:54,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 21:21:54,476 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 21:21:54,476 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 21:21:54,476 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 21:21:54,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 21:21:54,477 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 21:21:54,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 21:21:54,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 21:21:54,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 21:21:54,479 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 21:21:54,479 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 21:21:54,480 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 21:21:54,480 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 21:21:54,481 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 21:21:54,481 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 21:21:54,481 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 21:21:54,482 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 21:21:54,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 21:21:54,483 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 21:21:54,496 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 21:21:54,496 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 21:21:54,497 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 21:21:54,497 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 21:21:54,497 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 21:21:54,497 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 21:21:54,498 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 21:21:54,498 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 21:21:54,498 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 21:21:54,498 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 21:21:54,498 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 21:21:54,498 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 21:21:54,499 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 21:21:54,499 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 21:21:54,499 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 21:21:54,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 21:21:54,500 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 21:21:54,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 21:21:54,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 21:21:54,500 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 21:21:54,500 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 21:21:54,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 21:21:54,501 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 21:21:54,501 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 21:21:54,501 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 21:21:54,501 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 21:21:54,502 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 21:21:54,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 21:21:54,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 21:21:54,502 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 21:21:54,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 21:21:54,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 21:21:54,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 21:21:54,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 21:21:54,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 21:21:54,503 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 21:21:54,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 21:21:54,504 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 21:21:54,504 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 21:21:54,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 21:21:54,504 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_d7b3ecf1-129d-4815-9d58-a1be571f7092/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 -> 6513be41311960d6a56653c4e3c74e99432f54f9 [2019-12-07 21:21:54,603 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 21:21:54,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 21:21:54,613 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 21:21:54,614 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 21:21:54,614 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 21:21:54,615 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/mix008_rmo.opt.i [2019-12-07 21:21:54,650 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/data/18be00c90/b8994fab31ef4e29b3bf475b42a18a59/FLAG666fb243b [2019-12-07 21:21:55,119 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 21:21:55,120 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/sv-benchmarks/c/pthread-wmm/mix008_rmo.opt.i [2019-12-07 21:21:55,131 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/data/18be00c90/b8994fab31ef4e29b3bf475b42a18a59/FLAG666fb243b [2019-12-07 21:21:55,636 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/data/18be00c90/b8994fab31ef4e29b3bf475b42a18a59 [2019-12-07 21:21:55,638 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 21:21:55,639 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 21:21:55,640 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:55,640 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 21:21:55,643 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 21:21:55,644 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:55" (1/1) ... [2019-12-07 21:21:55,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a374d02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:55, skipping insertion in model container [2019-12-07 21:21:55,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 09:21:55" (1/1) ... [2019-12-07 21:21:55,652 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 21:21:55,683 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 21:21:55,938 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:55,945 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 21:21:55,990 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 21:21:56,036 INFO L208 MainTranslator]: Completed translation [2019-12-07 21:21:56,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56 WrapperNode [2019-12-07 21:21:56,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 21:21:56,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:56,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 21:21:56,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 21:21:56,042 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:21:56" (1/1) ... [2019-12-07 21:21:56,055 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:21:56" (1/1) ... [2019-12-07 21:21:56,075 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 21:21:56,076 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 21:21:56,076 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 21:21:56,076 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 21:21:56,082 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,082 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,086 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,086 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,094 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,099 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... [2019-12-07 21:21:56,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 21:21:56,103 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 21:21:56,103 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 21:21:56,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 21:21:56,104 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/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:21:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 21:21:56,146 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 21:21:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 21:21:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 21:21:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 21:21:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 21:21:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 21:21:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 21:21:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 21:21:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 21:21:56,147 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 21:21:56,147 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 21:21:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 21:21:56,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 21:21:56,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 21:21:56,149 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:21:56,562 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 21:21:56,562 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 21:21:56,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:56 BoogieIcfgContainer [2019-12-07 21:21:56,563 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 21:21:56,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 21:21:56,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 21:21:56,565 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 21:21:56,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 09:21:55" (1/3) ... [2019-12-07 21:21:56,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5626e316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:56, skipping insertion in model container [2019-12-07 21:21:56,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 09:21:56" (2/3) ... [2019-12-07 21:21:56,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5626e316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 09:21:56, skipping insertion in model container [2019-12-07 21:21:56,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:56" (3/3) ... [2019-12-07 21:21:56,567 INFO L109 eAbstractionObserver]: Analyzing ICFG mix008_rmo.opt.i [2019-12-07 21:21:56,573 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 21:21:56,574 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 21:21:56,578 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 21:21:56,579 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 21:21:56,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,607 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,608 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,608 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,609 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,610 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,611 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,615 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,616 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,617 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,618 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,619 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,620 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,621 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,622 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,623 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,624 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,626 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,626 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,626 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,626 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,627 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,627 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,628 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,629 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,630 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,631 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,632 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,633 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,634 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,635 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,636 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,637 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,638 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,639 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,640 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,641 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,642 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,643 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,644 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 21:21:56,657 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 21:21:56,669 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 21:21:56,669 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 21:21:56,669 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 21:21:56,669 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 21:21:56,670 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 21:21:56,670 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 21:21:56,670 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 21:21:56,670 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 21:21:56,680 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 21:21:56,681 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 21:21:56,746 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 21:21:56,746 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:21:56,762 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 940 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:21:56,784 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 21:21:56,820 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 21:21:56,821 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 21:21:56,829 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 940 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 21:21:56,855 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 21:21:56,856 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 21:22:00,224 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-07 21:22:00,421 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 21:22:00,533 INFO L206 etLargeBlockEncoding]: Checked pairs total: 147708 [2019-12-07 21:22:00,533 INFO L214 etLargeBlockEncoding]: Total number of compositions: 132 [2019-12-07 21:22:00,535 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 113 places, 134 transitions [2019-12-07 21:22:08,429 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92086 states. [2019-12-07 21:22:08,431 INFO L276 IsEmpty]: Start isEmpty. Operand 92086 states. [2019-12-07 21:22:08,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 21:22:08,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:08,436 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:08,436 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:22:08,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:08,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1095689236, now seen corresponding path program 1 times [2019-12-07 21:22:08,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:08,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929324995] [2019-12-07 21:22:08,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:08,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:08,608 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:22:08,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929324995] [2019-12-07 21:22:08,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:08,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 21:22:08,609 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286408445] [2019-12-07 21:22:08,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:22:08,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:08,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:22:08,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:22:08,623 INFO L87 Difference]: Start difference. First operand 92086 states. Second operand 3 states. [2019-12-07 21:22:09,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:09,469 INFO L93 Difference]: Finished difference Result 91382 states and 423776 transitions. [2019-12-07 21:22:09,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:22:09,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 21:22:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:09,976 INFO L225 Difference]: With dead ends: 91382 [2019-12-07 21:22:09,976 INFO L226 Difference]: Without dead ends: 85534 [2019-12-07 21:22:09,977 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:22:11,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85534 states. [2019-12-07 21:22:12,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85534 to 85534. [2019-12-07 21:22:12,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85534 states. [2019-12-07 21:22:14,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85534 states to 85534 states and 396416 transitions. [2019-12-07 21:22:14,581 INFO L78 Accepts]: Start accepts. Automaton has 85534 states and 396416 transitions. Word has length 9 [2019-12-07 21:22:14,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:14,582 INFO L462 AbstractCegarLoop]: Abstraction has 85534 states and 396416 transitions. [2019-12-07 21:22:14,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:22:14,583 INFO L276 IsEmpty]: Start isEmpty. Operand 85534 states and 396416 transitions. [2019-12-07 21:22:14,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 21:22:14,590 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:14,590 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:14,590 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:22:14,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:14,591 INFO L82 PathProgramCache]: Analyzing trace with hash -1576682706, now seen corresponding path program 1 times [2019-12-07 21:22:14,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:14,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437753862] [2019-12-07 21:22:14,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:14,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:14,665 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:22:14,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437753862] [2019-12-07 21:22:14,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:14,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:22:14,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132883762] [2019-12-07 21:22:14,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:22:14,667 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:14,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:22:14,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:22:14,667 INFO L87 Difference]: Start difference. First operand 85534 states and 396416 transitions. Second operand 4 states. [2019-12-07 21:22:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:15,566 INFO L93 Difference]: Finished difference Result 132766 states and 593324 transitions. [2019-12-07 21:22:15,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:22:15,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 21:22:15,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:15,946 INFO L225 Difference]: With dead ends: 132766 [2019-12-07 21:22:15,947 INFO L226 Difference]: Without dead ends: 132702 [2019-12-07 21:22:15,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:22:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132702 states. [2019-12-07 21:22:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132702 to 129166. [2019-12-07 21:22:19,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129166 states. [2019-12-07 21:22:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129166 states to 129166 states and 580344 transitions. [2019-12-07 21:22:19,994 INFO L78 Accepts]: Start accepts. Automaton has 129166 states and 580344 transitions. Word has length 15 [2019-12-07 21:22:19,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:19,994 INFO L462 AbstractCegarLoop]: Abstraction has 129166 states and 580344 transitions. [2019-12-07 21:22:19,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:22:19,994 INFO L276 IsEmpty]: Start isEmpty. Operand 129166 states and 580344 transitions. [2019-12-07 21:22:20,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 21:22:20,001 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:20,001 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:22:20,001 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:22:20,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:20,001 INFO L82 PathProgramCache]: Analyzing trace with hash -959167775, now seen corresponding path program 1 times [2019-12-07 21:22:20,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:20,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310029374] [2019-12-07 21:22:20,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:20,054 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:22:20,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310029374] [2019-12-07 21:22:20,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:20,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:22:20,055 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153632626] [2019-12-07 21:22:20,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:22:20,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:20,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:22:20,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:22:20,055 INFO L87 Difference]: Start difference. First operand 129166 states and 580344 transitions. Second operand 4 states. [2019-12-07 21:22:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:22,631 INFO L93 Difference]: Finished difference Result 166838 states and 738668 transitions. [2019-12-07 21:22:22,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:22:22,632 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 21:22:22,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:23,066 INFO L225 Difference]: With dead ends: 166838 [2019-12-07 21:22:23,066 INFO L226 Difference]: Without dead ends: 166782 [2019-12-07 21:22:23,066 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:22:24,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166782 states. [2019-12-07 21:22:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166782 to 149598. [2019-12-07 21:22:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149598 states. [2019-12-07 21:22:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149598 states to 149598 states and 668132 transitions. [2019-12-07 21:22:27,529 INFO L78 Accepts]: Start accepts. Automaton has 149598 states and 668132 transitions. Word has length 18 [2019-12-07 21:22:27,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:27,529 INFO L462 AbstractCegarLoop]: Abstraction has 149598 states and 668132 transitions. [2019-12-07 21:22:27,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:22:27,530 INFO L276 IsEmpty]: Start isEmpty. Operand 149598 states and 668132 transitions. [2019-12-07 21:22:27,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 21:22:27,539 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:27,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:27,539 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:22:27,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 330599914, now seen corresponding path program 1 times [2019-12-07 21:22:27,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:27,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390764586] [2019-12-07 21:22:27,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:27,567 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:22:27,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390764586] [2019-12-07 21:22:27,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:27,568 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:22:27,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270327062] [2019-12-07 21:22:27,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:22:27,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:27,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:22:27,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:22:27,569 INFO L87 Difference]: Start difference. First operand 149598 states and 668132 transitions. Second operand 3 states. [2019-12-07 21:22:29,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:29,216 INFO L93 Difference]: Finished difference Result 254938 states and 1095516 transitions. [2019-12-07 21:22:29,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:22:29,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 21:22:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:29,968 INFO L225 Difference]: With dead ends: 254938 [2019-12-07 21:22:29,968 INFO L226 Difference]: Without dead ends: 254938 [2019-12-07 21:22:29,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:22:32,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254938 states. [2019-12-07 21:22:38,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254938 to 226954. [2019-12-07 21:22:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226954 states. [2019-12-07 21:22:39,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226954 states to 226954 states and 987664 transitions. [2019-12-07 21:22:39,064 INFO L78 Accepts]: Start accepts. Automaton has 226954 states and 987664 transitions. Word has length 19 [2019-12-07 21:22:39,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:39,064 INFO L462 AbstractCegarLoop]: Abstraction has 226954 states and 987664 transitions. [2019-12-07 21:22:39,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:22:39,065 INFO L276 IsEmpty]: Start isEmpty. Operand 226954 states and 987664 transitions. [2019-12-07 21:22:39,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:22:39,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:39,078 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:22:39,078 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:22:39,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:39,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1619055659, now seen corresponding path program 1 times [2019-12-07 21:22:39,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:39,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33073619] [2019-12-07 21:22:39,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:39,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:39,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:22:39,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33073619] [2019-12-07 21:22:39,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:39,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:22:39,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300199425] [2019-12-07 21:22:39,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:22:39,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:39,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:22:39,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:22:39,133 INFO L87 Difference]: Start difference. First operand 226954 states and 987664 transitions. Second operand 3 states. [2019-12-07 21:22:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:40,676 INFO L93 Difference]: Finished difference Result 214362 states and 921788 transitions. [2019-12-07 21:22:40,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:22:40,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 21:22:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:41,261 INFO L225 Difference]: With dead ends: 214362 [2019-12-07 21:22:41,261 INFO L226 Difference]: Without dead ends: 214362 [2019-12-07 21:22:41,261 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:22:43,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214362 states. [2019-12-07 21:22:48,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214362 to 212474. [2019-12-07 21:22:48,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212474 states. [2019-12-07 21:22:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212474 states to 212474 states and 914524 transitions. [2019-12-07 21:22:49,525 INFO L78 Accepts]: Start accepts. Automaton has 212474 states and 914524 transitions. Word has length 20 [2019-12-07 21:22:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:49,525 INFO L462 AbstractCegarLoop]: Abstraction has 212474 states and 914524 transitions. [2019-12-07 21:22:49,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:22:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 212474 states and 914524 transitions. [2019-12-07 21:22:49,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 21:22:49,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:49,536 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:22:49,536 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:22:49,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:49,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1390487927, now seen corresponding path program 1 times [2019-12-07 21:22:49,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:49,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040077906] [2019-12-07 21:22:49,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:49,581 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:22:49,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040077906] [2019-12-07 21:22:49,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:49,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:22:49,581 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433066382] [2019-12-07 21:22:49,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:22:49,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:49,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:22:49,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:22:49,582 INFO L87 Difference]: Start difference. First operand 212474 states and 914524 transitions. Second operand 4 states. [2019-12-07 21:22:50,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:50,714 INFO L93 Difference]: Finished difference Result 177199 states and 701793 transitions. [2019-12-07 21:22:50,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:22:50,714 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 21:22:50,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:51,107 INFO L225 Difference]: With dead ends: 177199 [2019-12-07 21:22:51,107 INFO L226 Difference]: Without dead ends: 164703 [2019-12-07 21:22:51,107 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:22:52,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164703 states. [2019-12-07 21:22:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164703 to 164703. [2019-12-07 21:22:54,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164703 states. [2019-12-07 21:22:55,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164703 states to 164703 states and 655856 transitions. [2019-12-07 21:22:55,467 INFO L78 Accepts]: Start accepts. Automaton has 164703 states and 655856 transitions. Word has length 20 [2019-12-07 21:22:55,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:22:55,467 INFO L462 AbstractCegarLoop]: Abstraction has 164703 states and 655856 transitions. [2019-12-07 21:22:55,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:22:55,468 INFO L276 IsEmpty]: Start isEmpty. Operand 164703 states and 655856 transitions. [2019-12-07 21:22:55,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:22:55,476 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:22:55,477 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:22:55,477 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:22:55,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:22:55,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1863442791, now seen corresponding path program 1 times [2019-12-07 21:22:55,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:22:55,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20343593] [2019-12-07 21:22:55,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:22:55,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:22:55,546 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:22:55,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20343593] [2019-12-07 21:22:55,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:22:55,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:22:55,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375090979] [2019-12-07 21:22:55,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:22:55,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:22:55,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:22:55,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:22:55,548 INFO L87 Difference]: Start difference. First operand 164703 states and 655856 transitions. Second operand 4 states. [2019-12-07 21:22:57,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:22:57,403 INFO L93 Difference]: Finished difference Result 304206 states and 1201920 transitions. [2019-12-07 21:22:57,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:22:57,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:22:57,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:22:58,152 INFO L225 Difference]: With dead ends: 304206 [2019-12-07 21:22:58,152 INFO L226 Difference]: Without dead ends: 302832 [2019-12-07 21:22:58,153 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:23:02,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302832 states. [2019-12-07 21:23:06,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302832 to 297880. [2019-12-07 21:23:06,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297880 states. [2019-12-07 21:23:07,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297880 states to 297880 states and 1184475 transitions. [2019-12-07 21:23:07,832 INFO L78 Accepts]: Start accepts. Automaton has 297880 states and 1184475 transitions. Word has length 21 [2019-12-07 21:23:07,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:07,832 INFO L462 AbstractCegarLoop]: Abstraction has 297880 states and 1184475 transitions. [2019-12-07 21:23:07,832 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:07,832 INFO L276 IsEmpty]: Start isEmpty. Operand 297880 states and 1184475 transitions. [2019-12-07 21:23:07,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 21:23:07,848 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:07,848 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:23:07,848 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:23:07,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:07,848 INFO L82 PathProgramCache]: Analyzing trace with hash 2037270664, now seen corresponding path program 1 times [2019-12-07 21:23:07,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:07,848 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138651289] [2019-12-07 21:23:07,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:07,882 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:23:07,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138651289] [2019-12-07 21:23:07,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:07,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:07,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744916586] [2019-12-07 21:23:07,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:07,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:07,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:07,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:07,883 INFO L87 Difference]: Start difference. First operand 297880 states and 1184475 transitions. Second operand 4 states. [2019-12-07 21:23:10,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:10,068 INFO L93 Difference]: Finished difference Result 370550 states and 1456052 transitions. [2019-12-07 21:23:10,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:23:10,068 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 21:23:10,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:10,992 INFO L225 Difference]: With dead ends: 370550 [2019-12-07 21:23:10,992 INFO L226 Difference]: Without dead ends: 370387 [2019-12-07 21:23:10,993 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:23:14,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370387 states. [2019-12-07 21:23:21,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370387 to 301991. [2019-12-07 21:23:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301991 states. [2019-12-07 21:23:22,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301991 states to 301991 states and 1200739 transitions. [2019-12-07 21:23:22,446 INFO L78 Accepts]: Start accepts. Automaton has 301991 states and 1200739 transitions. Word has length 21 [2019-12-07 21:23:22,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:22,447 INFO L462 AbstractCegarLoop]: Abstraction has 301991 states and 1200739 transitions. [2019-12-07 21:23:22,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:22,447 INFO L276 IsEmpty]: Start isEmpty. Operand 301991 states and 1200739 transitions. [2019-12-07 21:23:22,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 21:23:22,466 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:22,466 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:23:22,466 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:23:22,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:22,467 INFO L82 PathProgramCache]: Analyzing trace with hash -254255263, now seen corresponding path program 1 times [2019-12-07 21:23:22,467 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:22,467 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806754738] [2019-12-07 21:23:22,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:22,515 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:23:22,516 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806754738] [2019-12-07 21:23:22,516 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:22,516 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:23:22,517 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467585714] [2019-12-07 21:23:22,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:22,517 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:22,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:22,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:22,518 INFO L87 Difference]: Start difference. First operand 301991 states and 1200739 transitions. Second operand 5 states. [2019-12-07 21:23:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:23,506 INFO L93 Difference]: Finished difference Result 139865 states and 476792 transitions. [2019-12-07 21:23:23,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 21:23:23,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 21:23:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:23,731 INFO L225 Difference]: With dead ends: 139865 [2019-12-07 21:23:23,731 INFO L226 Difference]: Without dead ends: 120688 [2019-12-07 21:23:23,731 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:23:24,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120688 states. [2019-12-07 21:23:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120688 to 116562. [2019-12-07 21:23:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116562 states. [2019-12-07 21:23:26,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116562 states to 116562 states and 390659 transitions. [2019-12-07 21:23:26,427 INFO L78 Accepts]: Start accepts. Automaton has 116562 states and 390659 transitions. Word has length 22 [2019-12-07 21:23:26,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:26,427 INFO L462 AbstractCegarLoop]: Abstraction has 116562 states and 390659 transitions. [2019-12-07 21:23:26,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:26,427 INFO L276 IsEmpty]: Start isEmpty. Operand 116562 states and 390659 transitions. [2019-12-07 21:23:26,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 21:23:26,436 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:26,436 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] [2019-12-07 21:23:26,436 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:23:26,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:26,436 INFO L82 PathProgramCache]: Analyzing trace with hash -897431110, now seen corresponding path program 1 times [2019-12-07 21:23:26,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:26,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803254212] [2019-12-07 21:23:26,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:26,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:26,496 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:23:26,497 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803254212] [2019-12-07 21:23:26,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:26,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 21:23:26,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441695761] [2019-12-07 21:23:26,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:26,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:26,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:26,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:26,498 INFO L87 Difference]: Start difference. First operand 116562 states and 390659 transitions. Second operand 4 states. [2019-12-07 21:23:26,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:26,892 INFO L93 Difference]: Finished difference Result 113869 states and 381178 transitions. [2019-12-07 21:23:26,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:26,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-12-07 21:23:26,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:27,098 INFO L225 Difference]: With dead ends: 113869 [2019-12-07 21:23:27,098 INFO L226 Difference]: Without dead ends: 113869 [2019-12-07 21:23:27,098 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:23:27,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113869 states. [2019-12-07 21:23:29,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113869 to 79457. [2019-12-07 21:23:29,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79457 states. [2019-12-07 21:23:29,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79457 states to 79457 states and 264981 transitions. [2019-12-07 21:23:29,207 INFO L78 Accepts]: Start accepts. Automaton has 79457 states and 264981 transitions. Word has length 23 [2019-12-07 21:23:29,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:29,207 INFO L462 AbstractCegarLoop]: Abstraction has 79457 states and 264981 transitions. [2019-12-07 21:23:29,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:29,207 INFO L276 IsEmpty]: Start isEmpty. Operand 79457 states and 264981 transitions. [2019-12-07 21:23:29,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 21:23:29,218 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:29,219 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] [2019-12-07 21:23:29,219 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:23:29,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:29,219 INFO L82 PathProgramCache]: Analyzing trace with hash -715410772, now seen corresponding path program 1 times [2019-12-07 21:23:29,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:29,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553215249] [2019-12-07 21:23:29,219 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:29,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:29,266 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:23:29,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553215249] [2019-12-07 21:23:29,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:29,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:29,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838629660] [2019-12-07 21:23:29,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:29,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:29,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:29,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:29,267 INFO L87 Difference]: Start difference. First operand 79457 states and 264981 transitions. Second operand 5 states. [2019-12-07 21:23:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:29,980 INFO L93 Difference]: Finished difference Result 111729 states and 363787 transitions. [2019-12-07 21:23:29,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 21:23:29,981 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 21:23:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:30,178 INFO L225 Difference]: With dead ends: 111729 [2019-12-07 21:23:30,178 INFO L226 Difference]: Without dead ends: 111713 [2019-12-07 21:23:30,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 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:23:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111713 states. [2019-12-07 21:23:32,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111713 to 89066. [2019-12-07 21:23:32,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89066 states. [2019-12-07 21:23:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89066 states to 89066 states and 295979 transitions. [2019-12-07 21:23:32,243 INFO L78 Accepts]: Start accepts. Automaton has 89066 states and 295979 transitions. Word has length 26 [2019-12-07 21:23:32,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:32,243 INFO L462 AbstractCegarLoop]: Abstraction has 89066 states and 295979 transitions. [2019-12-07 21:23:32,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:32,243 INFO L276 IsEmpty]: Start isEmpty. Operand 89066 states and 295979 transitions. [2019-12-07 21:23:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 21:23:32,266 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:32,266 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:32,266 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:23:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:32,266 INFO L82 PathProgramCache]: Analyzing trace with hash -420917345, now seen corresponding path program 1 times [2019-12-07 21:23:32,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:32,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986312237] [2019-12-07 21:23:32,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:32,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:32,319 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:23:32,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986312237] [2019-12-07 21:23:32,320 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:32,320 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:32,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347322377] [2019-12-07 21:23:32,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 21:23:32,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 21:23:32,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 21:23:32,321 INFO L87 Difference]: Start difference. First operand 89066 states and 295979 transitions. Second operand 6 states. [2019-12-07 21:23:32,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:32,450 INFO L93 Difference]: Finished difference Result 28397 states and 89992 transitions. [2019-12-07 21:23:32,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:23:32,451 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 21:23:32,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:32,483 INFO L225 Difference]: With dead ends: 28397 [2019-12-07 21:23:32,483 INFO L226 Difference]: Without dead ends: 22575 [2019-12-07 21:23:32,484 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:23:32,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22575 states. [2019-12-07 21:23:32,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22575 to 20217. [2019-12-07 21:23:32,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20217 states. [2019-12-07 21:23:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20217 states to 20217 states and 63405 transitions. [2019-12-07 21:23:32,761 INFO L78 Accepts]: Start accepts. Automaton has 20217 states and 63405 transitions. Word has length 29 [2019-12-07 21:23:32,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:32,762 INFO L462 AbstractCegarLoop]: Abstraction has 20217 states and 63405 transitions. [2019-12-07 21:23:32,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 21:23:32,762 INFO L276 IsEmpty]: Start isEmpty. Operand 20217 states and 63405 transitions. [2019-12-07 21:23:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 21:23:32,774 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:32,774 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:32,774 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:23:32,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:32,774 INFO L82 PathProgramCache]: Analyzing trace with hash 1941437234, now seen corresponding path program 1 times [2019-12-07 21:23:32,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:32,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870065076] [2019-12-07 21:23:32,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:32,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:32,799 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:23:32,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870065076] [2019-12-07 21:23:32,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:32,799 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:32,799 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337469816] [2019-12-07 21:23:32,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 21:23:32,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:32,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 21:23:32,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:32,800 INFO L87 Difference]: Start difference. First operand 20217 states and 63405 transitions. Second operand 3 states. [2019-12-07 21:23:32,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:32,904 INFO L93 Difference]: Finished difference Result 21679 states and 64228 transitions. [2019-12-07 21:23:32,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 21:23:32,905 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 21:23:32,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:32,929 INFO L225 Difference]: With dead ends: 21679 [2019-12-07 21:23:32,929 INFO L226 Difference]: Without dead ends: 21679 [2019-12-07 21:23:32,929 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 21:23:32,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21679 states. [2019-12-07 21:23:33,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21679 to 20586. [2019-12-07 21:23:33,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20586 states. [2019-12-07 21:23:33,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20586 states to 20586 states and 61636 transitions. [2019-12-07 21:23:33,205 INFO L78 Accepts]: Start accepts. Automaton has 20586 states and 61636 transitions. Word has length 37 [2019-12-07 21:23:33,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:33,205 INFO L462 AbstractCegarLoop]: Abstraction has 20586 states and 61636 transitions. [2019-12-07 21:23:33,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 21:23:33,206 INFO L276 IsEmpty]: Start isEmpty. Operand 20586 states and 61636 transitions. [2019-12-07 21:23:33,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 21:23:33,220 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:33,220 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 21:23:33,220 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:23:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:33,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1588768954, now seen corresponding path program 1 times [2019-12-07 21:23:33,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:33,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177236505] [2019-12-07 21:23:33,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:33,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:33,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 21:23:33,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177236505] [2019-12-07 21:23:33,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:33,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 21:23:33,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112933071] [2019-12-07 21:23:33,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:33,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:33,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:33,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:33,280 INFO L87 Difference]: Start difference. First operand 20586 states and 61636 transitions. Second operand 7 states. [2019-12-07 21:23:33,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:33,378 INFO L93 Difference]: Finished difference Result 17548 states and 55017 transitions. [2019-12-07 21:23:33,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 21:23:33,378 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-07 21:23:33,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:33,399 INFO L225 Difference]: With dead ends: 17548 [2019-12-07 21:23:33,399 INFO L226 Difference]: Without dead ends: 17140 [2019-12-07 21:23:33,399 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:23:33,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17140 states. [2019-12-07 21:23:33,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17140 to 13853. [2019-12-07 21:23:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13853 states. [2019-12-07 21:23:33,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13853 states to 13853 states and 45216 transitions. [2019-12-07 21:23:33,595 INFO L78 Accepts]: Start accepts. Automaton has 13853 states and 45216 transitions. Word has length 40 [2019-12-07 21:23:33,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:33,595 INFO L462 AbstractCegarLoop]: Abstraction has 13853 states and 45216 transitions. [2019-12-07 21:23:33,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 13853 states and 45216 transitions. [2019-12-07 21:23:33,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:23:33,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:33,608 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:23:33,608 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:23:33,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:33,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1288247543, now seen corresponding path program 1 times [2019-12-07 21:23:33,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:33,609 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021144094] [2019-12-07 21:23:33,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:33,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:33,689 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:23:33,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021144094] [2019-12-07 21:23:33,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:33,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 21:23:33,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772149409] [2019-12-07 21:23:33,690 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 21:23:33,690 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 21:23:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 21:23:33,690 INFO L87 Difference]: Start difference. First operand 13853 states and 45216 transitions. Second operand 5 states. [2019-12-07 21:23:33,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:33,856 INFO L93 Difference]: Finished difference Result 25012 states and 77733 transitions. [2019-12-07 21:23:33,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 21:23:33,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-07 21:23:33,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:33,871 INFO L225 Difference]: With dead ends: 25012 [2019-12-07 21:23:33,871 INFO L226 Difference]: Without dead ends: 12092 [2019-12-07 21:23:33,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:33,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12092 states. [2019-12-07 21:23:33,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12092 to 8097. [2019-12-07 21:23:33,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8097 states. [2019-12-07 21:23:33,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8097 states to 8097 states and 23935 transitions. [2019-12-07 21:23:33,989 INFO L78 Accepts]: Start accepts. Automaton has 8097 states and 23935 transitions. Word has length 65 [2019-12-07 21:23:33,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:33,989 INFO L462 AbstractCegarLoop]: Abstraction has 8097 states and 23935 transitions. [2019-12-07 21:23:33,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 21:23:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 8097 states and 23935 transitions. [2019-12-07 21:23:33,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-07 21:23:33,999 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:33,999 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:23:33,999 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:23:33,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:33,999 INFO L82 PathProgramCache]: Analyzing trace with hash 460132387, now seen corresponding path program 2 times [2019-12-07 21:23:33,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:34,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872896793] [2019-12-07 21:23:34,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:34,092 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:23:34,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872896793] [2019-12-07 21:23:34,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:34,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 21:23:34,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664074851] [2019-12-07 21:23:34,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 21:23:34,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:34,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 21:23:34,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 21:23:34,093 INFO L87 Difference]: Start difference. First operand 8097 states and 23935 transitions. Second operand 7 states. [2019-12-07 21:23:34,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:34,290 INFO L93 Difference]: Finished difference Result 22425 states and 66731 transitions. [2019-12-07 21:23:34,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 21:23:34,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-07 21:23:34,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:34,304 INFO L225 Difference]: With dead ends: 22425 [2019-12-07 21:23:34,304 INFO L226 Difference]: Without dead ends: 13213 [2019-12-07 21:23:34,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2019-12-07 21:23:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13213 states. [2019-12-07 21:23:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13213 to 8583. [2019-12-07 21:23:34,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8583 states. [2019-12-07 21:23:34,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8583 states to 8583 states and 25186 transitions. [2019-12-07 21:23:34,427 INFO L78 Accepts]: Start accepts. Automaton has 8583 states and 25186 transitions. Word has length 65 [2019-12-07 21:23:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:34,427 INFO L462 AbstractCegarLoop]: Abstraction has 8583 states and 25186 transitions. [2019-12-07 21:23:34,427 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 21:23:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 8583 states and 25186 transitions. [2019-12-07 21:23:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:34,435 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:34,435 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:23:34,435 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:23:34,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:34,435 INFO L82 PathProgramCache]: Analyzing trace with hash 957130744, now seen corresponding path program 1 times [2019-12-07 21:23:34,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:34,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224405791] [2019-12-07 21:23:34,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:34,494 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:23:34,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224405791] [2019-12-07 21:23:34,495 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:34,495 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:34,495 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731906338] [2019-12-07 21:23:34,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:34,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:34,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:34,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:34,495 INFO L87 Difference]: Start difference. First operand 8583 states and 25186 transitions. Second operand 4 states. [2019-12-07 21:23:34,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:34,539 INFO L93 Difference]: Finished difference Result 13267 states and 36520 transitions. [2019-12-07 21:23:34,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:34,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 21:23:34,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:34,545 INFO L225 Difference]: With dead ends: 13267 [2019-12-07 21:23:34,545 INFO L226 Difference]: Without dead ends: 5635 [2019-12-07 21:23:34,546 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:23:34,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5635 states. [2019-12-07 21:23:34,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5635 to 5191. [2019-12-07 21:23:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5191 states. [2019-12-07 21:23:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5191 states to 5191 states and 13279 transitions. [2019-12-07 21:23:34,602 INFO L78 Accepts]: Start accepts. Automaton has 5191 states and 13279 transitions. Word has length 66 [2019-12-07 21:23:34,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:34,603 INFO L462 AbstractCegarLoop]: Abstraction has 5191 states and 13279 transitions. [2019-12-07 21:23:34,603 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:34,603 INFO L276 IsEmpty]: Start isEmpty. Operand 5191 states and 13279 transitions. [2019-12-07 21:23:34,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:34,606 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:34,606 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:23:34,606 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:23:34,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:34,607 INFO L82 PathProgramCache]: Analyzing trace with hash -2016132092, now seen corresponding path program 2 times [2019-12-07 21:23:34,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:34,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825265257] [2019-12-07 21:23:34,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:34,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:34,658 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:23:34,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825265257] [2019-12-07 21:23:34,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:34,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 21:23:34,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624613091] [2019-12-07 21:23:34,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 21:23:34,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:34,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 21:23:34,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 21:23:34,659 INFO L87 Difference]: Start difference. First operand 5191 states and 13279 transitions. Second operand 4 states. [2019-12-07 21:23:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:34,686 INFO L93 Difference]: Finished difference Result 6126 states and 15738 transitions. [2019-12-07 21:23:34,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 21:23:34,687 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-07 21:23:34,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:34,687 INFO L225 Difference]: With dead ends: 6126 [2019-12-07 21:23:34,687 INFO L226 Difference]: Without dead ends: 575 [2019-12-07 21:23:34,688 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:23:34,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2019-12-07 21:23:34,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 575. [2019-12-07 21:23:34,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 575 states. [2019-12-07 21:23:34,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 1182 transitions. [2019-12-07 21:23:34,692 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 1182 transitions. Word has length 66 [2019-12-07 21:23:34,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:34,693 INFO L462 AbstractCegarLoop]: Abstraction has 575 states and 1182 transitions. [2019-12-07 21:23:34,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 21:23:34,693 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 1182 transitions. [2019-12-07 21:23:34,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:34,693 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:34,693 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:23:34,693 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:23:34,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:34,694 INFO L82 PathProgramCache]: Analyzing trace with hash -888097270, now seen corresponding path program 3 times [2019-12-07 21:23:34,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:34,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539032322] [2019-12-07 21:23:34,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:34,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 21:23:34,748 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:23:34,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539032322] [2019-12-07 21:23:34,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 21:23:34,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 21:23:34,748 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995170565] [2019-12-07 21:23:34,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 21:23:34,749 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 21:23:34,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 21:23:34,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 21:23:34,749 INFO L87 Difference]: Start difference. First operand 575 states and 1182 transitions. Second operand 8 states. [2019-12-07 21:23:34,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 21:23:34,874 INFO L93 Difference]: Finished difference Result 997 states and 2018 transitions. [2019-12-07 21:23:34,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 21:23:34,874 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 66 [2019-12-07 21:23:34,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 21:23:34,875 INFO L225 Difference]: With dead ends: 997 [2019-12-07 21:23:34,875 INFO L226 Difference]: Without dead ends: 682 [2019-12-07 21:23:34,875 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-07 21:23:34,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2019-12-07 21:23:34,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 636. [2019-12-07 21:23:34,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 636 states. [2019-12-07 21:23:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 636 states to 636 states and 1271 transitions. [2019-12-07 21:23:34,880 INFO L78 Accepts]: Start accepts. Automaton has 636 states and 1271 transitions. Word has length 66 [2019-12-07 21:23:34,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 21:23:34,880 INFO L462 AbstractCegarLoop]: Abstraction has 636 states and 1271 transitions. [2019-12-07 21:23:34,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 21:23:34,880 INFO L276 IsEmpty]: Start isEmpty. Operand 636 states and 1271 transitions. [2019-12-07 21:23:34,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 21:23:34,881 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 21:23:34,881 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:23:34,881 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:23:34,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 21:23:34,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1740782390, now seen corresponding path program 4 times [2019-12-07 21:23:34,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 21:23:34,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459551190] [2019-12-07 21:23:34,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 21:23:34,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:23:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 21:23:34,984 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 21:23:34,984 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 21:23:34,986 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t229~0.offset_44|) (= v_~z$r_buff1_thd2~0_128 0) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t229~0.base_70|)) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t229~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t229~0.base_70|) |v_ULTIMATE.start_main_~#t229~0.offset_44| 0)) |v_#memory_int_23|) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= (store .cse0 |v_ULTIMATE.start_main_~#t229~0.base_70| 1) |v_#valid_120|) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t229~0.base_70|) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t229~0.base_70| 4) |v_#length_29|) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 v_~weak$$choice0~0_170) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ULTIMATE.start_main_~#t230~0.offset=|v_ULTIMATE.start_main_~#t230~0.offset_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t230~0.base=|v_ULTIMATE.start_main_~#t230~0.base_62|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ULTIMATE.start_main_~#t231~0.base=|v_ULTIMATE.start_main_~#t231~0.base_24|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ULTIMATE.start_main_~#t232~0.base=|v_ULTIMATE.start_main_~#t232~0.base_24|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~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_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ULTIMATE.start_main_~#t231~0.offset=|v_ULTIMATE.start_main_~#t231~0.offset_18|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t229~0.base=|v_ULTIMATE.start_main_~#t229~0.base_70|, ULTIMATE.start_main_~#t229~0.offset=|v_ULTIMATE.start_main_~#t229~0.offset_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_~#t232~0.offset=|v_ULTIMATE.start_main_~#t232~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t230~0.offset, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t230~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t231~0.base, ~__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, ULTIMATE.start_main_~#t232~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t231~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t229~0.base, ULTIMATE.start_main_~#t229~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t232~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:23:34,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t230~0.base_11| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t230~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t230~0.base_11|) |v_ULTIMATE.start_main_~#t230~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t230~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t230~0.offset_10| 0) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t230~0.base_11|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t230~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t230~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t230~0.offset=|v_ULTIMATE.start_main_~#t230~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t230~0.base=|v_ULTIMATE.start_main_~#t230~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t230~0.offset, #length, ULTIMATE.start_main_~#t230~0.base] because there is no mapped edge [2019-12-07 21:23:34,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= |v_ULTIMATE.start_main_~#t231~0.offset_11| 0) (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t231~0.base_13| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t231~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t231~0.base_13|) |v_ULTIMATE.start_main_~#t231~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t231~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t231~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t231~0.base_13|)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t231~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t231~0.base=|v_ULTIMATE.start_main_~#t231~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t231~0.offset=|v_ULTIMATE.start_main_~#t231~0.offset_11|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t231~0.base, ULTIMATE.start_main_~#t231~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 21:23:34,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t232~0.base_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t232~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t232~0.base_10|) |v_ULTIMATE.start_main_~#t232~0.offset_9| 3))) (not (= |v_ULTIMATE.start_main_~#t232~0.base_10| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t232~0.base_10| 4) |v_#length_17|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t232~0.base_10|)) (= |v_ULTIMATE.start_main_~#t232~0.offset_9| 0) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t232~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t232~0.offset=|v_ULTIMATE.start_main_~#t232~0.offset_9|, ULTIMATE.start_main_~#t232~0.base=|v_ULTIMATE.start_main_~#t232~0.base_10|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t232~0.offset, ULTIMATE.start_main_~#t232~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:23:34,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_103 256) 0)) (not (= (mod v_~z$w_buff1_used~0_58 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_10| v_P3Thread1of1ForFork2_~arg.offset_8) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 0)) (= v_P3Thread1of1ForFork2_~arg.base_8 |v_P3Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_8, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} 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:23:34,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In227906982 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In227906982 256)))) (or (and (= ~z$w_buff0~0_In227906982 |P3Thread1of1ForFork2_#t~ite28_Out227906982|) (not .cse0) (not .cse1)) (and (= ~z$w_buff1~0_In227906982 |P3Thread1of1ForFork2_#t~ite28_Out227906982|) (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In227906982, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227906982, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In227906982, ~z$w_buff1~0=~z$w_buff1~0_In227906982} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out227906982|, ~z$w_buff0~0=~z$w_buff0~0_In227906982, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227906982, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In227906982, ~z$w_buff1~0=~z$w_buff1~0_In227906982} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:23:34,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_10|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_10|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_5|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_9|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-07 21:23:34,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_7|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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:23:34,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In57823115 256) 0))) (or (and (= ~z$mem_tmp~0_In57823115 |P3Thread1of1ForFork2_#t~ite48_Out57823115|) (not .cse0)) (and (= ~z~0_In57823115 |P3Thread1of1ForFork2_#t~ite48_Out57823115|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In57823115, ~z$flush_delayed~0=~z$flush_delayed~0_In57823115, ~z~0=~z~0_In57823115} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In57823115, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out57823115|, ~z$flush_delayed~0=~z$flush_delayed~0_In57823115, ~z~0=~z~0_In57823115} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:23:34,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_P0Thread1of1ForFork3_~arg.base_6 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_6) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_6, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_6, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 21:23:34,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_51 1) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_25} 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:23:35,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1659670332 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1659670332| ~z~0_In-1659670332) .cse0) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1659670332| ~z$mem_tmp~0_In-1659670332) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1659670332, ~z$flush_delayed~0=~z$flush_delayed~0_In-1659670332, ~z~0=~z~0_In-1659670332} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1659670332, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1659670332|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1659670332, ~z~0=~z~0_In-1659670332} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:23:35,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_50|) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_49|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, 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:23:35,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In584664249 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In584664249 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In584664249 |P3Thread1of1ForFork2_#t~ite51_Out584664249|)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out584664249| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In584664249, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In584664249} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out584664249|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In584664249, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In584664249} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:23:35,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1234116470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1234116470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1234116470 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1234116470 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1234116470|)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite52_Out-1234116470| ~z$w_buff1_used~0_In-1234116470) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1234116470|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:23:35,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1852177104 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1852177104 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-1852177104 ~z$r_buff0_thd4~0_In-1852177104))) (or (and (= ~z$r_buff0_thd4~0_Out-1852177104 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852177104, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852177104} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1852177104|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852177104, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1852177104} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:23:35,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1363146195 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1363146195 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1363146195 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1363146195 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out1363146195| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite54_Out1363146195| ~z$r_buff1_thd4~0_In1363146195)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1363146195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363146195, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1363146195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1363146195} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1363146195|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1363146195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363146195, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1363146195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1363146195} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:23:35,001 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= |v_P3Thread1of1ForFork2_#t~ite54_28| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_27|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} 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:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2116432660 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In2116432660 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In2116432660 |ULTIMATE.start_main_#t~ite59_Out2116432660|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out2116432660| ~z~0_In2116432660) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2116432660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116432660, ~z$w_buff1~0=~z$w_buff1~0_In2116432660, ~z~0=~z~0_In2116432660} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2116432660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116432660, ~z$w_buff1~0=~z$w_buff1~0_In2116432660, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2116432660|, ~z~0=~z~0_In2116432660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 21:23:35,002 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-686745835 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-686745835 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-686745835| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-686745835| ~z$w_buff0_used~0_In-686745835) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686745835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686745835} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686745835, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-686745835|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686745835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:23:35,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603636104 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1603636104 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1603636104 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1603636104 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1603636104| ~z$w_buff1_used~0_In1603636104) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1603636104|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1603636104|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:23:35,003 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-238968068 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-238968068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-238968068| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-238968068| ~z$r_buff0_thd0~0_In-238968068) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-238968068, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-238968068} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-238968068|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-238968068, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-238968068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:23:35,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1040609227 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1040609227 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1040609227 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1040609227 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite64_Out1040609227|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite64_Out1040609227| ~z$r_buff1_thd0~0_In1040609227) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1040609227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1040609227, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1040609227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1040609227} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1040609227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1040609227, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1040609227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1040609227, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1040609227|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:23:35,004 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} 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:23:35,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 09:23:35 BasicIcfg [2019-12-07 21:23:35,067 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 21:23:35,067 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 21:23:35,067 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 21:23:35,067 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 21:23:35,068 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 09:21:56" (3/4) ... [2019-12-07 21:23:35,069 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 21:23:35,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1057] [1057] ULTIMATE.startENTRY-->L854: Formula: (let ((.cse0 (store |v_#valid_122| 0 0))) (and (= 0 |v_ULTIMATE.start_main_~#t229~0.offset_44|) (= v_~z$r_buff1_thd2~0_128 0) (= 0 v_~z$flush_delayed~0_241) (= v_~z$r_buff0_thd1~0_60 0) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_6| 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t229~0.base_70|)) (= v_~z$w_buff1_used~0_546 0) (= 0 v_~__unbuffered_p3_EAX~0_92) (= v_~__unbuffered_cnt~0_193 0) (= v_~z$read_delayed~0_6 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t229~0.base_70| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t229~0.base_70|) |v_ULTIMATE.start_main_~#t229~0.offset_44| 0)) |v_#memory_int_23|) (= v_~z$r_buff1_thd0~0_247 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff0~0_267 0) (= 0 v_~__unbuffered_p2_EAX~0_115) (= v_~main$tmp_guard0~0_28 0) (= 0 v_~z$r_buff1_thd4~0_282) (= (store .cse0 |v_ULTIMATE.start_main_~#t229~0.base_70| 1) |v_#valid_120|) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd2~0_59 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t229~0.base_70|) (= 0 v_~__unbuffered_p3_EBX~0_87) (= v_~y~0_120 0) (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t229~0.base_70| 4) |v_#length_29|) (= v_~z$r_buff1_thd1~0_131 0) (= v_~z$w_buff0_used~0_794 0) (< 0 |v_#StackHeapBarrier_20|) (= v_~a~0_35 0) (= v_~z$r_buff0_thd0~0_129 0) (= v_~z~0_291 0) (= v_~x~0_99 0) (= 0 v_~z$r_buff0_thd3~0_336) (= 0 v_~z$r_buff1_thd3~0_316) (= 0 v_~z$r_buff0_thd4~0_443) (= v_~weak$$choice2~0_248 0) (= 0 v_~z$mem_tmp~0_180) (= 0 v_~weak$$choice0~0_170) (= v_~main$tmp_guard1~0_88 0) (= v_~z$w_buff1~0_199 0) (= v_~__unbuffered_p2_EBX~0_117 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_122|, #memory_int=|v_#memory_int_24|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_9|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_8|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_128, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_171|, ~a~0=v_~a~0_35, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_129, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_443, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_92, #length=|v_#length_29|, ULTIMATE.start_main_~#t230~0.offset=|v_ULTIMATE.start_main_~#t230~0.offset_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_115, ULTIMATE.start_main_~#t230~0.base=|v_ULTIMATE.start_main_~#t230~0.base_62|, ~z$mem_tmp~0=v_~z$mem_tmp~0_180, ULTIMATE.start_main_~#t231~0.base=|v_ULTIMATE.start_main_~#t231~0.base_24|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_117, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_546, ~z$flush_delayed~0=v_~z$flush_delayed~0_241, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_28|, ~weak$$choice0~0=v_~weak$$choice0~0_170, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_150|, ULTIMATE.start_main_~#t232~0.base=|v_ULTIMATE.start_main_~#t232~0.base_24|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_131, ~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_336, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_193, ~x~0=v_~x~0_99, ULTIMATE.start_main_~#t231~0.offset=|v_ULTIMATE.start_main_~#t231~0.offset_18|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_282, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_15|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_9|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_88, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_~#t229~0.base=|v_ULTIMATE.start_main_~#t229~0.base_70|, ULTIMATE.start_main_~#t229~0.offset=|v_ULTIMATE.start_main_~#t229~0.offset_44|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_247, ~y~0=v_~y~0_120, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_59, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_794, ~z$w_buff0~0=v_~z$w_buff0~0_267, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_316, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_28, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_87, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_174|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_45|, ULTIMATE.start_main_~#t232~0.offset=|v_ULTIMATE.start_main_~#t232~0.offset_18|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_45|, #valid=|v_#valid_120|, #memory_int=|v_#memory_int_23|, ~z~0=v_~z~0_291, ~weak$$choice2~0=v_~weak$$choice2~0_248, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_60} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_~#t230~0.offset, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t230~0.base, ~z$mem_tmp~0, ULTIMATE.start_main_~#t231~0.base, ~__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, ULTIMATE.start_main_~#t232~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t231~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_~#t229~0.base, ULTIMATE.start_main_~#t229~0.offset, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_~#t232~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:23:35,070 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L854-1-->L856: Formula: (and (= (store |v_#valid_51| |v_ULTIMATE.start_main_~#t230~0.base_11| 1) |v_#valid_50|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t230~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t230~0.base_11|) |v_ULTIMATE.start_main_~#t230~0.offset_10| 1)) |v_#memory_int_15|) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t230~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t230~0.offset_10| 0) (= (select |v_#valid_51| |v_ULTIMATE.start_main_~#t230~0.base_11|) 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t230~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t230~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t230~0.offset=|v_ULTIMATE.start_main_~#t230~0.offset_10|, #length=|v_#length_21|, ULTIMATE.start_main_~#t230~0.base=|v_ULTIMATE.start_main_~#t230~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t230~0.offset, #length, ULTIMATE.start_main_~#t230~0.base] because there is no mapped edge [2019-12-07 21:23:35,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1035] [1035] L856-1-->L858: Formula: (and (= |v_ULTIMATE.start_main_~#t231~0.offset_11| 0) (= |v_#valid_52| (store |v_#valid_53| |v_ULTIMATE.start_main_~#t231~0.base_13| 1)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t231~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t231~0.base_13|) |v_ULTIMATE.start_main_~#t231~0.offset_11| 2)) |v_#memory_int_17|) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t231~0.base_13| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t231~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t231~0.base_13|)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t231~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t231~0.base=|v_ULTIMATE.start_main_~#t231~0.base_13|, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_~#t231~0.offset=|v_ULTIMATE.start_main_~#t231~0.offset_11|, #valid=|v_#valid_52|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_17|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t231~0.base, ULTIMATE.start_main_~#t231~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-07 21:23:35,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L858-1-->L860: Formula: (and (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t232~0.base_10|) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t232~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t232~0.base_10|) |v_ULTIMATE.start_main_~#t232~0.offset_9| 3))) (not (= |v_ULTIMATE.start_main_~#t232~0.base_10| 0)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t232~0.base_10| 4) |v_#length_17|) (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t232~0.base_10|)) (= |v_ULTIMATE.start_main_~#t232~0.offset_9| 0) (= |v_#valid_37| (store |v_#valid_38| |v_ULTIMATE.start_main_~#t232~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t232~0.offset=|v_ULTIMATE.start_main_~#t232~0.offset_9|, ULTIMATE.start_main_~#t232~0.base=|v_ULTIMATE.start_main_~#t232~0.base_10|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_5|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t232~0.offset, ULTIMATE.start_main_~#t232~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, #length] because there is no mapped edge [2019-12-07 21:23:35,071 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] P3ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0~0_33 v_~z$w_buff1~0_25) (= (ite (not (and (not (= (mod v_~z$w_buff0_used~0_103 256) 0)) (not (= (mod v_~z$w_buff1_used~0_58 256) 0)))) 1 0) |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= |v_P3Thread1of1ForFork2_#in~arg.offset_10| v_P3Thread1of1ForFork2_~arg.offset_8) (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 |v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|) (= v_~z$w_buff0_used~0_104 v_~z$w_buff1_used~0_58) (= v_~z$w_buff0_used~0_103 1) (not (= v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10 0)) (= v_P3Thread1of1ForFork2_~arg.base_8 |v_P3Thread1of1ForFork2_#in~arg.base_10|) (= 1 v_~z$w_buff0~0_32)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_104, ~z$w_buff0~0=v_~z$w_buff0~0_33, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} OutVars{P3Thread1of1ForFork2___VERIFIER_assert_~expression=v_P3Thread1of1ForFork2___VERIFIER_assert_~expression_10, P3Thread1of1ForFork2_~arg.offset=v_P3Thread1of1ForFork2_~arg.offset_8, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_103, ~z$w_buff0~0=v_~z$w_buff0~0_32, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_58, P3Thread1of1ForFork2_#in~arg.offset=|v_P3Thread1of1ForFork2_#in~arg.offset_10|, ~z$w_buff1~0=v_~z$w_buff1~0_25, P3Thread1of1ForFork2___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork2___VERIFIER_assert_#in~expression_8|, P3Thread1of1ForFork2_~arg.base=v_P3Thread1of1ForFork2_~arg.base_8, P3Thread1of1ForFork2_#in~arg.base=|v_P3Thread1of1ForFork2_#in~arg.base_10|} 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:23:35,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L816-2-->L816-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In227906982 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In227906982 256)))) (or (and (= ~z$w_buff0~0_In227906982 |P3Thread1of1ForFork2_#t~ite28_Out227906982|) (not .cse0) (not .cse1)) (and (= ~z$w_buff1~0_In227906982 |P3Thread1of1ForFork2_#t~ite28_Out227906982|) (or .cse0 .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In227906982, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227906982, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In227906982, ~z$w_buff1~0=~z$w_buff1~0_In227906982} OutVars{P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out227906982|, ~z$w_buff0~0=~z$w_buff0~0_In227906982, ~z$w_buff0_used~0=~z$w_buff0_used~0_In227906982, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In227906982, ~z$w_buff1~0=~z$w_buff1~0_In227906982} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 21:23:35,072 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [909] [909] L816-4-->L817: Formula: (= v_~z~0_22 |v_P3Thread1of1ForFork2_#t~ite28_10|) InVars {P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_10|} OutVars{P3Thread1of1ForFork2_#t~ite29=|v_P3Thread1of1ForFork2_#t~ite29_5|, P3Thread1of1ForFork2_#t~ite28=|v_P3Thread1of1ForFork2_#t~ite28_9|, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28, ~z~0] because there is no mapped edge [2019-12-07 21:23:35,075 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L821-->L822: Formula: (and (= v_~z$r_buff0_thd4~0_68 v_~z$r_buff0_thd4~0_67) (not (= (mod v_~weak$$choice2~0_34 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_68, ~weak$$choice2~0=v_~weak$$choice2~0_34} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_6|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_7|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_67, ~weak$$choice2~0=v_~weak$$choice2~0_34} 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:23:35,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] L824-->L824-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In57823115 256) 0))) (or (and (= ~z$mem_tmp~0_In57823115 |P3Thread1of1ForFork2_#t~ite48_Out57823115|) (not .cse0)) (and (= ~z~0_In57823115 |P3Thread1of1ForFork2_#t~ite48_Out57823115|) .cse0))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In57823115, ~z$flush_delayed~0=~z$flush_delayed~0_In57823115, ~z~0=~z~0_In57823115} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In57823115, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out57823115|, ~z$flush_delayed~0=~z$flush_delayed~0_In57823115, ~z~0=~z~0_In57823115} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 21:23:35,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= v_P0Thread1of1ForFork3_~arg.base_6 |v_P0Thread1of1ForFork3_#in~arg.base_8|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_8| v_P0Thread1of1ForFork3_~arg.offset_6) (= v_~a~0_12 1) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_28 1)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|} OutVars{~a~0=v_~a~0_12, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_8|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_6, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_6, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_8|, ~x~0=v_~x~0_28} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset, ~x~0] because there is no mapped edge [2019-12-07 21:23:35,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] P1ENTRY-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_57 1) v_~__unbuffered_cnt~0_56) (= v_~x~0_25 2) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_9|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~y~0_51 1) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_9|)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_57} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_9|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_56, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, ~y~0=v_~y~0_51, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|, ~x~0=v_~x~0_25} 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:23:35,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1659670332 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1659670332| ~z~0_In-1659670332) .cse0) (and (= |P2Thread1of1ForFork1_#t~ite25_Out-1659670332| ~z$mem_tmp~0_In-1659670332) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1659670332, ~z$flush_delayed~0=~z$flush_delayed~0_In-1659670332, ~z~0=~z~0_In-1659670332} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1659670332, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1659670332|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1659670332, ~z~0=~z~0_In-1659670332} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 21:23:35,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= v_~z~0_173 |v_P2Thread1of1ForFork1_#t~ite25_50|) (= 0 v_~z$flush_delayed~0_183)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_50|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_49|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, ~z$flush_delayed~0=v_~z$flush_delayed~0_183, ~z~0=v_~z~0_173, 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:23:35,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L832-->L832-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In584664249 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In584664249 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In584664249 |P3Thread1of1ForFork2_#t~ite51_Out584664249|)) (and (= |P3Thread1of1ForFork2_#t~ite51_Out584664249| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In584664249, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In584664249} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out584664249|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In584664249, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In584664249} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 21:23:35,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L833-->L833-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In-1234116470 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1234116470 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd4~0_In-1234116470 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-1234116470 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork2_#t~ite52_Out-1234116470|)) (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite52_Out-1234116470| ~z$w_buff1_used~0_In-1234116470) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1234116470|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1234116470, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1234116470, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1234116470, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1234116470} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 21:23:35,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L834-->L835: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1852177104 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1852177104 256))) (.cse2 (= ~z$r_buff0_thd4~0_Out-1852177104 ~z$r_buff0_thd4~0_In-1852177104))) (or (and (= ~z$r_buff0_thd4~0_Out-1852177104 0) (not .cse0) (not .cse1)) (and .cse2 .cse0) (and .cse1 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852177104, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1852177104} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out-1852177104|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1852177104, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1852177104} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 21:23:35,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L835-->L835-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In1363146195 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1363146195 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In1363146195 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1363146195 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out1363146195| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P3Thread1of1ForFork2_#t~ite54_Out1363146195| ~z$r_buff1_thd4~0_In1363146195)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1363146195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363146195, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1363146195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1363146195} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out1363146195|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1363146195, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1363146195, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1363146195, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1363146195} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 21:23:35,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1026] [1026] L835-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_70 1) v_~__unbuffered_cnt~0_69) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= |v_P3Thread1of1ForFork2_#t~ite54_28| v_~z$r_buff1_thd4~0_234) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_27|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_234, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69} 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:23:35,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [925] [925] L864-->L866-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_175 256)) (= (mod v_~z$r_buff0_thd0~0_16 256) 0)) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_16, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_175, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 21:23:35,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L866-2-->L866-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2116432660 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In2116432660 256) 0))) (or (and (not .cse0) (= ~z$w_buff1~0_In2116432660 |ULTIMATE.start_main_#t~ite59_Out2116432660|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out2116432660| ~z~0_In2116432660) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2116432660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116432660, ~z$w_buff1~0=~z$w_buff1~0_In2116432660, ~z~0=~z~0_In2116432660} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2116432660, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2116432660, ~z$w_buff1~0=~z$w_buff1~0_In2116432660, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out2116432660|, ~z~0=~z~0_In2116432660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 21:23:35,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L866-4-->L867: Formula: (= v_~z~0_76 |v_ULTIMATE.start_main_#t~ite59_14|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_14|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~z~0=v_~z~0_76} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 21:23:35,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L867-->L867-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In-686745835 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-686745835 256)))) (or (and (= |ULTIMATE.start_main_#t~ite61_Out-686745835| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite61_Out-686745835| ~z$w_buff0_used~0_In-686745835) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686745835, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686745835} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-686745835, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-686745835|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-686745835} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 21:23:35,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [998] [998] L868-->L868-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1603636104 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1603636104 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1603636104 256))) (.cse2 (= (mod ~z$r_buff0_thd0~0_In1603636104 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out1603636104| ~z$w_buff1_used~0_In1603636104) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite62_Out1603636104|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out1603636104|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1603636104, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1603636104, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1603636104, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1603636104} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 21:23:35,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L869-->L869-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-238968068 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-238968068 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-238968068| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite63_Out-238968068| ~z$r_buff0_thd0~0_In-238968068) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-238968068, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-238968068} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-238968068|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-238968068, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-238968068} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 21:23:35,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L870-->L870-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1040609227 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In1040609227 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1040609227 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1040609227 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite64_Out1040609227|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite64_Out1040609227| ~z$r_buff1_thd0~0_In1040609227) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1040609227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1040609227, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1040609227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1040609227} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1040609227, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1040609227, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1040609227, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1040609227, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1040609227|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 21:23:35,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L870-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= (ite (= (ite (not (and (= v_~x~0_57 2) (= v_~__unbuffered_p2_EBX~0_70 0) (= 2 v_~__unbuffered_p2_EAX~0_76) (= 0 v_~__unbuffered_p3_EBX~0_50) (= v_~y~0_81 2) (= 1 v_~__unbuffered_p3_EAX~0_55))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_46) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_19| (mod v_~main$tmp_guard1~0_46 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_27 0) (= v_~z$r_buff1_thd0~0_198 |v_ULTIMATE.start_main_#t~ite64_91|)) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_91|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_27, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_70, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_198, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_55, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_46, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_76, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ~y~0=v_~y~0_81, ~x~0=v_~x~0_57, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_90|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_19|} 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:23:35,156 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d7b3ecf1-129d-4815-9d58-a1be571f7092/bin/utaipan/witness.graphml [2019-12-07 21:23:35,156 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 21:23:35,157 INFO L168 Benchmark]: Toolchain (without parser) took 99518.28 ms. Allocated memory was 1.0 GB in the beginning and 8.7 GB in the end (delta: 7.7 GB). Free memory was 937.1 MB in the beginning and 4.1 GB in the end (delta: -3.2 GB). Peak memory consumption was 4.5 GB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,158 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:35,158 INFO L168 Benchmark]: CACSL2BoogieTranslator took 396.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,158 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 21:23:35,158 INFO L168 Benchmark]: Boogie Preprocessor took 27.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,159 INFO L168 Benchmark]: RCFGBuilder took 459.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,159 INFO L168 Benchmark]: TraceAbstraction took 98503.73 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.6 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 4.4 GB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,159 INFO L168 Benchmark]: Witness Printer took 89.20 ms. Allocated memory is still 8.7 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. [2019-12-07 21:23:35,161 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 396.21 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -128.0 MB). Peak memory consumption was 18.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.96 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 27.02 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 459.80 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 98503.73 ms. Allocated memory was 1.1 GB in the beginning and 8.7 GB in the end (delta: 7.6 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 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 89.20 ms. Allocated memory is still 8.7 GB. Free memory was 4.2 GB in the beginning and 4.1 GB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 211 ProgramPointsBefore, 113 ProgramPointsAfterwards, 254 TransitionsBefore, 134 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 27 ChoiceCompositions, 10992 VarBasedMoverChecksPositive, 301 VarBasedMoverChecksNegative, 70 SemBasedMoverChecksPositive, 323 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 147708 CheckedPairsTotal, 132 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L854] FCALL, FORK 0 pthread_create(&t229, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L856] FCALL, FORK 0 pthread_create(&t230, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L858] FCALL, FORK 0 pthread_create(&t231, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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] [L860] FCALL, FORK 0 pthread_create(&t232, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=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] [L804] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L805] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L806] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L807] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L808] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L809] 4 z$r_buff0_thd4 = (_Bool)1 [L812] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L813] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L814] 4 z$flush_delayed = weak$$choice2 [L815] 4 z$mem_tmp = z VAL [__unbuffered_cnt=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] [L816] 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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] [L817] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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] [L817] 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)) [L818] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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] [L818] 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)) [L819] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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_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)) [L820] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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_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)) [L822] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_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$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)) [L823] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=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] [L824] 4 z = z$flush_delayed ? z$mem_tmp : z [L825] 4 z$flush_delayed = (_Bool)0 [L828] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=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] [L831] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_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] [L768] 3 y = 2 [L771] 3 __unbuffered_p2_EAX = y [L774] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 3 z$flush_delayed = weak$$choice2 [L777] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z = !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) [L779] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$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)) [L780] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 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)) [L781] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 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)) [L782] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 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)) [L783] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L783] 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)) [L784] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p2_EAX=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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 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)) [L785] 3 __unbuffered_p2_EBX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __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=2, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L831] 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) [L832] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L833] 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 [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __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=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L868] 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 [L869] 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, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 98.3s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3907 SDtfs, 5826 SDslu, 6739 SDs, 0 SdLazy, 1495 SolverSat, 228 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 106 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301991occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 63.8s AutomataMinimizationTime, 19 MinimizatonAttempts, 200978 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 714 NumberOfCodeBlocks, 714 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 211015 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...