./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/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 94642e44943c2d0baa9ed6d5be6510be0c52488d ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 13:07:13,365 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 13:07:13,367 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 13:07:13,374 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 13:07:13,375 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 13:07:13,375 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 13:07:13,376 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 13:07:13,377 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 13:07:13,379 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 13:07:13,380 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 13:07:13,380 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 13:07:13,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 13:07:13,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 13:07:13,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 13:07:13,383 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 13:07:13,384 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 13:07:13,384 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 13:07:13,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 13:07:13,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 13:07:13,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 13:07:13,389 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 13:07:13,390 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 13:07:13,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 13:07:13,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 13:07:13,392 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 13:07:13,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 13:07:13,393 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 13:07:13,393 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 13:07:13,393 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 13:07:13,394 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 13:07:13,394 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 13:07:13,395 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 13:07:13,395 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 13:07:13,396 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 13:07:13,397 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 13:07:13,397 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 13:07:13,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 13:07:13,398 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 13:07:13,398 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 13:07:13,399 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 13:07:13,399 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 13:07:13,400 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 13:07:13,413 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 13:07:13,413 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 13:07:13,414 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 13:07:13,414 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 13:07:13,414 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 13:07:13,414 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 13:07:13,414 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 13:07:13,414 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 13:07:13,414 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 13:07:13,415 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 13:07:13,415 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 13:07:13,415 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 13:07:13,415 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 13:07:13,415 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 13:07:13,415 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 13:07:13,416 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 13:07:13,416 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 13:07:13,416 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 13:07:13,416 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 13:07:13,416 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 13:07:13,416 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 13:07:13,417 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 13:07:13,418 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 13:07:13,418 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 13:07:13,418 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 13:07:13,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 13:07:13,418 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 13:07:13,418 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 13:07:13,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 13:07:13,419 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 13:07:13,419 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 13:07:13,419 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 13:07:13,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 13:07:13,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 13:07:13,419 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_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/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 -> 94642e44943c2d0baa9ed6d5be6510be0c52488d [2019-12-07 13:07:13,519 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 13:07:13,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 13:07:13,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 13:07:13,534 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 13:07:13,534 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 13:07:13,535 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/../../sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i [2019-12-07 13:07:13,574 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/data/4c460ad86/67d4e0f3bf104265ab8f63b043369621/FLAGfd5e686f5 [2019-12-07 13:07:13,955 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 13:07:13,956 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/sv-benchmarks/c/pthread-wmm/rfi009_tso.oepc.i [2019-12-07 13:07:13,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/data/4c460ad86/67d4e0f3bf104265ab8f63b043369621/FLAGfd5e686f5 [2019-12-07 13:07:13,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/data/4c460ad86/67d4e0f3bf104265ab8f63b043369621 [2019-12-07 13:07:13,981 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 13:07:13,982 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 13:07:13,983 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 13:07:13,983 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 13:07:13,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 13:07:13,986 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:07:13" (1/1) ... [2019-12-07 13:07:13,989 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25138a46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:13, skipping insertion in model container [2019-12-07 13:07:13,989 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 01:07:13" (1/1) ... [2019-12-07 13:07:13,995 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 13:07:14,036 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 13:07:14,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:07:14,300 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 13:07:14,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 13:07:14,390 INFO L208 MainTranslator]: Completed translation [2019-12-07 13:07:14,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14 WrapperNode [2019-12-07 13:07:14,391 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 13:07:14,391 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 13:07:14,391 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 13:07:14,391 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 13:07:14,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,414 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,440 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 13:07:14,440 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 13:07:14,440 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 13:07:14,440 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 13:07:14,447 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,447 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,450 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,451 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,459 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... [2019-12-07 13:07:14,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 13:07:14,469 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 13:07:14,469 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 13:07:14,470 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 13:07:14,470 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/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 13:07:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 13:07:14,514 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 13:07:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 13:07:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 13:07:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 13:07:14,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 13:07:14,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 13:07:14,517 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 13:07:14,934 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 13:07:14,934 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 13:07:14,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:07:14 BoogieIcfgContainer [2019-12-07 13:07:14,935 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 13:07:14,936 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 13:07:14,936 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 13:07:14,938 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 13:07:14,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 01:07:13" (1/3) ... [2019-12-07 13:07:14,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2c86c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:07:14, skipping insertion in model container [2019-12-07 13:07:14,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 01:07:14" (2/3) ... [2019-12-07 13:07:14,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c2c86c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 01:07:14, skipping insertion in model container [2019-12-07 13:07:14,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:07:14" (3/3) ... [2019-12-07 13:07:14,940 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi009_tso.oepc.i [2019-12-07 13:07:14,947 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 13:07:14,947 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 13:07:14,952 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 13:07:14,953 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 13:07:14,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,984 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,985 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,989 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,990 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,991 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,997 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,998 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:14,999 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,000 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,001 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,002 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,003 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,004 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,005 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,006 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,007 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,008 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,009 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,010 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,011 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,012 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,013 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,013 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,014 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,015 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,016 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,017 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 13:07:15,031 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 13:07:15,043 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 13:07:15,043 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 13:07:15,043 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 13:07:15,043 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 13:07:15,043 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 13:07:15,043 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 13:07:15,043 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 13:07:15,043 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 13:07:15,054 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 206 places, 258 transitions [2019-12-07 13:07:15,055 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 206 places, 258 transitions [2019-12-07 13:07:15,137 INFO L134 PetriNetUnfolder]: 62/255 cut-off events. [2019-12-07 13:07:15,137 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:07:15,150 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 255 events. 62/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1110 event pairs. 9/200 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-07 13:07:15,177 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 206 places, 258 transitions [2019-12-07 13:07:15,218 INFO L134 PetriNetUnfolder]: 62/255 cut-off events. [2019-12-07 13:07:15,218 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 13:07:15,229 INFO L76 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 255 events. 62/255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1110 event pairs. 9/200 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-07 13:07:15,259 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 32698 [2019-12-07 13:07:15,260 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 13:07:18,768 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-12-07 13:07:18,938 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-07 13:07:19,041 INFO L206 etLargeBlockEncoding]: Checked pairs total: 172435 [2019-12-07 13:07:19,041 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-07 13:07:19,044 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 119 places, 140 transitions [2019-12-07 13:09:01,966 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 326552 states. [2019-12-07 13:09:01,967 INFO L276 IsEmpty]: Start isEmpty. Operand 326552 states. [2019-12-07 13:09:01,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 13:09:01,972 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:01,972 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 13:09:01,972 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash 1079128557, now seen corresponding path program 1 times [2019-12-07 13:09:01,982 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:01,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622559397] [2019-12-07 13:09:01,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:02,129 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 13:09:02,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622559397] [2019-12-07 13:09:02,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:02,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 13:09:02,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563754316] [2019-12-07 13:09:02,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:09:02,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:02,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:09:02,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:09:02,143 INFO L87 Difference]: Start difference. First operand 326552 states. Second operand 3 states. [2019-12-07 13:09:05,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:05,891 INFO L93 Difference]: Finished difference Result 325136 states and 1487916 transitions. [2019-12-07 13:09:05,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:09:05,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 13:09:05,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:06,881 INFO L225 Difference]: With dead ends: 325136 [2019-12-07 13:09:06,882 INFO L226 Difference]: Without dead ends: 304556 [2019-12-07 13:09:06,883 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 13:09:44,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304556 states. [2019-12-07 13:09:48,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304556 to 304556. [2019-12-07 13:09:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 304556 states. [2019-12-07 13:09:49,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304556 states to 304556 states and 1392758 transitions. [2019-12-07 13:09:49,763 INFO L78 Accepts]: Start accepts. Automaton has 304556 states and 1392758 transitions. Word has length 5 [2019-12-07 13:09:49,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:09:49,763 INFO L462 AbstractCegarLoop]: Abstraction has 304556 states and 1392758 transitions. [2019-12-07 13:09:49,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:09:49,764 INFO L276 IsEmpty]: Start isEmpty. Operand 304556 states and 1392758 transitions. [2019-12-07 13:09:49,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:09:49,769 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:09:49,770 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:09:49,770 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:09:49,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:09:49,770 INFO L82 PathProgramCache]: Analyzing trace with hash -201706173, now seen corresponding path program 1 times [2019-12-07 13:09:49,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:09:49,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661285429] [2019-12-07 13:09:49,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:09:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:09:49,841 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 13:09:49,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661285429] [2019-12-07 13:09:49,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:09:49,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:09:49,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526937713] [2019-12-07 13:09:49,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:09:49,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:09:49,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:09:49,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:09:49,844 INFO L87 Difference]: Start difference. First operand 304556 states and 1392758 transitions. Second operand 4 states. [2019-12-07 13:09:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:09:53,041 INFO L93 Difference]: Finished difference Result 474194 states and 2086526 transitions. [2019-12-07 13:09:53,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:09:53,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:09:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:09:54,437 INFO L225 Difference]: With dead ends: 474194 [2019-12-07 13:09:54,437 INFO L226 Difference]: Without dead ends: 474082 [2019-12-07 13:09:54,438 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 13:10:37,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474082 states. [2019-12-07 13:10:44,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474082 to 458686. [2019-12-07 13:10:44,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458686 states. [2019-12-07 13:10:46,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458686 states to 458686 states and 2030109 transitions. [2019-12-07 13:10:46,632 INFO L78 Accepts]: Start accepts. Automaton has 458686 states and 2030109 transitions. Word has length 13 [2019-12-07 13:10:46,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:10:46,632 INFO L462 AbstractCegarLoop]: Abstraction has 458686 states and 2030109 transitions. [2019-12-07 13:10:46,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:10:46,633 INFO L276 IsEmpty]: Start isEmpty. Operand 458686 states and 2030109 transitions. [2019-12-07 13:10:46,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 13:10:46,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:10:46,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:10:46,635 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:10:46,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:10:46,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1643785693, now seen corresponding path program 1 times [2019-12-07 13:10:46,636 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:10:46,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755837541] [2019-12-07 13:10:46,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:10:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:10:46,688 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 13:10:46,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755837541] [2019-12-07 13:10:46,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:10:46,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:10:46,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313968749] [2019-12-07 13:10:46,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:10:46,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:10:46,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:10:46,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:10:46,689 INFO L87 Difference]: Start difference. First operand 458686 states and 2030109 transitions. Second operand 4 states. [2019-12-07 13:10:47,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:10:47,205 INFO L93 Difference]: Finished difference Result 115019 states and 428115 transitions. [2019-12-07 13:10:47,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:10:47,206 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 13:10:47,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:10:47,371 INFO L225 Difference]: With dead ends: 115019 [2019-12-07 13:10:47,372 INFO L226 Difference]: Without dead ends: 82567 [2019-12-07 13:10:47,372 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 13:10:48,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82567 states. [2019-12-07 13:10:49,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82567 to 82495. [2019-12-07 13:10:49,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82495 states. [2019-12-07 13:10:49,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82495 states to 82495 states and 287763 transitions. [2019-12-07 13:10:49,819 INFO L78 Accepts]: Start accepts. Automaton has 82495 states and 287763 transitions. Word has length 13 [2019-12-07 13:10:49,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:10:49,819 INFO L462 AbstractCegarLoop]: Abstraction has 82495 states and 287763 transitions. [2019-12-07 13:10:49,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:10:49,819 INFO L276 IsEmpty]: Start isEmpty. Operand 82495 states and 287763 transitions. [2019-12-07 13:10:49,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 13:10:49,821 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:10:49,821 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:10:49,821 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:10:49,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:10:49,821 INFO L82 PathProgramCache]: Analyzing trace with hash 29254760, now seen corresponding path program 1 times [2019-12-07 13:10:49,822 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:10:49,822 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255203469] [2019-12-07 13:10:49,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:10:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:10:49,867 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 13:10:49,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255203469] [2019-12-07 13:10:49,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:10:49,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:10:49,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510149627] [2019-12-07 13:10:49,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:10:49,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:10:49,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:10:49,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:10:49,868 INFO L87 Difference]: Start difference. First operand 82495 states and 287763 transitions. Second operand 4 states. [2019-12-07 13:10:50,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:10:50,404 INFO L93 Difference]: Finished difference Result 108159 states and 370529 transitions. [2019-12-07 13:10:50,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:10:50,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 13:10:50,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:10:50,603 INFO L225 Difference]: With dead ends: 108159 [2019-12-07 13:10:50,604 INFO L226 Difference]: Without dead ends: 108025 [2019-12-07 13:10:50,604 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 13:10:51,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108025 states. [2019-12-07 13:10:53,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108025 to 96538. [2019-12-07 13:10:53,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96538 states. [2019-12-07 13:10:53,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96538 states to 96538 states and 333789 transitions. [2019-12-07 13:10:53,340 INFO L78 Accepts]: Start accepts. Automaton has 96538 states and 333789 transitions. Word has length 14 [2019-12-07 13:10:53,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:10:53,341 INFO L462 AbstractCegarLoop]: Abstraction has 96538 states and 333789 transitions. [2019-12-07 13:10:53,341 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:10:53,341 INFO L276 IsEmpty]: Start isEmpty. Operand 96538 states and 333789 transitions. [2019-12-07 13:10:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 13:10:53,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:10:53,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:10:53,343 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:10:53,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:10:53,343 INFO L82 PathProgramCache]: Analyzing trace with hash 906926037, now seen corresponding path program 1 times [2019-12-07 13:10:53,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:10:53,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329878807] [2019-12-07 13:10:53,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:10:53,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:10:53,369 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 13:10:53,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329878807] [2019-12-07 13:10:53,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:10:53,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:10:53,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779586708] [2019-12-07 13:10:53,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:10:53,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:10:53,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:10:53,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:10:53,370 INFO L87 Difference]: Start difference. First operand 96538 states and 333789 transitions. Second operand 3 states. [2019-12-07 13:10:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:10:53,975 INFO L93 Difference]: Finished difference Result 169674 states and 562322 transitions. [2019-12-07 13:10:53,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:10:53,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 13:10:53,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:10:54,894 INFO L225 Difference]: With dead ends: 169674 [2019-12-07 13:10:54,894 INFO L226 Difference]: Without dead ends: 169674 [2019-12-07 13:10:54,895 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 13:10:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169674 states. [2019-12-07 13:11:00,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169674 to 152576. [2019-12-07 13:11:00,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152576 states. [2019-12-07 13:11:00,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152576 states to 152576 states and 511923 transitions. [2019-12-07 13:11:00,420 INFO L78 Accepts]: Start accepts. Automaton has 152576 states and 511923 transitions. Word has length 15 [2019-12-07 13:11:00,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:00,421 INFO L462 AbstractCegarLoop]: Abstraction has 152576 states and 511923 transitions. [2019-12-07 13:11:00,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:11:00,421 INFO L276 IsEmpty]: Start isEmpty. Operand 152576 states and 511923 transitions. [2019-12-07 13:11:00,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 13:11:00,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:00,426 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:00,426 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:00,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:00,426 INFO L82 PathProgramCache]: Analyzing trace with hash -2045798406, now seen corresponding path program 1 times [2019-12-07 13:11:00,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:00,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589138860] [2019-12-07 13:11:00,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:00,469 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 13:11:00,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589138860] [2019-12-07 13:11:00,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:00,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:11:00,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349672817] [2019-12-07 13:11:00,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:11:00,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:00,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:11:00,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:11:00,470 INFO L87 Difference]: Start difference. First operand 152576 states and 511923 transitions. Second operand 4 states. [2019-12-07 13:11:01,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:01,316 INFO L93 Difference]: Finished difference Result 190212 states and 629311 transitions. [2019-12-07 13:11:01,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:11:01,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 13:11:01,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:01,661 INFO L225 Difference]: With dead ends: 190212 [2019-12-07 13:11:01,661 INFO L226 Difference]: Without dead ends: 190051 [2019-12-07 13:11:01,661 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 13:11:03,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190051 states. [2019-12-07 13:11:05,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190051 to 154722. [2019-12-07 13:11:05,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154722 states. [2019-12-07 13:11:05,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154722 states to 154722 states and 518709 transitions. [2019-12-07 13:11:05,401 INFO L78 Accepts]: Start accepts. Automaton has 154722 states and 518709 transitions. Word has length 17 [2019-12-07 13:11:05,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:05,401 INFO L462 AbstractCegarLoop]: Abstraction has 154722 states and 518709 transitions. [2019-12-07 13:11:05,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:11:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 154722 states and 518709 transitions. [2019-12-07 13:11:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 13:11:05,412 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:05,412 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 13:11:05,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:05,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1582777682, now seen corresponding path program 1 times [2019-12-07 13:11:05,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:05,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361744385] [2019-12-07 13:11:05,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:05,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:05,466 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 13:11:05,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361744385] [2019-12-07 13:11:05,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:05,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:11:05,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100407816] [2019-12-07 13:11:05,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:05,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:05,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:05,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:11:05,468 INFO L87 Difference]: Start difference. First operand 154722 states and 518709 transitions. Second operand 5 states. [2019-12-07 13:11:06,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:06,673 INFO L93 Difference]: Finished difference Result 222114 states and 728738 transitions. [2019-12-07 13:11:06,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:06,674 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-07 13:11:06,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:07,115 INFO L225 Difference]: With dead ends: 222114 [2019-12-07 13:11:07,116 INFO L226 Difference]: Without dead ends: 221918 [2019-12-07 13:11:07,116 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:11:08,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221918 states. [2019-12-07 13:11:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221918 to 164758. [2019-12-07 13:11:10,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164758 states. [2019-12-07 13:11:11,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164758 states to 164758 states and 550520 transitions. [2019-12-07 13:11:11,352 INFO L78 Accepts]: Start accepts. Automaton has 164758 states and 550520 transitions. Word has length 22 [2019-12-07 13:11:11,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:11,353 INFO L462 AbstractCegarLoop]: Abstraction has 164758 states and 550520 transitions. [2019-12-07 13:11:11,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:11,353 INFO L276 IsEmpty]: Start isEmpty. Operand 164758 states and 550520 transitions. [2019-12-07 13:11:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:11:11,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:11,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:11,373 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:11,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:11,373 INFO L82 PathProgramCache]: Analyzing trace with hash 682956496, now seen corresponding path program 1 times [2019-12-07 13:11:11,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:11,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572533222] [2019-12-07 13:11:11,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:11,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:11,436 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 13:11:11,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572533222] [2019-12-07 13:11:11,436 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:11,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:11:11,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549446422] [2019-12-07 13:11:11,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:11,437 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:11,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:11:11,438 INFO L87 Difference]: Start difference. First operand 164758 states and 550520 transitions. Second operand 5 states. [2019-12-07 13:11:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:13,026 INFO L93 Difference]: Finished difference Result 229808 states and 752837 transitions. [2019-12-07 13:11:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 13:11:13,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:11:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:13,437 INFO L225 Difference]: With dead ends: 229808 [2019-12-07 13:11:13,438 INFO L226 Difference]: Without dead ends: 229409 [2019-12-07 13:11:13,438 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 13:11:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229409 states. [2019-12-07 13:11:18,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229409 to 154602. [2019-12-07 13:11:18,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154602 states. [2019-12-07 13:11:19,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154602 states to 154602 states and 518065 transitions. [2019-12-07 13:11:19,263 INFO L78 Accepts]: Start accepts. Automaton has 154602 states and 518065 transitions. Word has length 25 [2019-12-07 13:11:19,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:19,264 INFO L462 AbstractCegarLoop]: Abstraction has 154602 states and 518065 transitions. [2019-12-07 13:11:19,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:19,264 INFO L276 IsEmpty]: Start isEmpty. Operand 154602 states and 518065 transitions. [2019-12-07 13:11:19,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 13:11:19,286 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:19,286 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:19,286 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash -1129174222, now seen corresponding path program 1 times [2019-12-07 13:11:19,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:19,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445182581] [2019-12-07 13:11:19,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:19,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:19,332 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 13:11:19,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445182581] [2019-12-07 13:11:19,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:19,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:11:19,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167614815] [2019-12-07 13:11:19,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:19,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:19,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:19,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:11:19,333 INFO L87 Difference]: Start difference. First operand 154602 states and 518065 transitions. Second operand 5 states. [2019-12-07 13:11:19,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:19,633 INFO L93 Difference]: Finished difference Result 82515 states and 267742 transitions. [2019-12-07 13:11:19,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:11:19,633 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 13:11:19,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:19,762 INFO L225 Difference]: With dead ends: 82515 [2019-12-07 13:11:19,762 INFO L226 Difference]: Without dead ends: 73963 [2019-12-07 13:11:19,763 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 13:11:20,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73963 states. [2019-12-07 13:11:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73963 to 73015. [2019-12-07 13:11:21,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73015 states. [2019-12-07 13:11:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73015 states to 73015 states and 237418 transitions. [2019-12-07 13:11:21,314 INFO L78 Accepts]: Start accepts. Automaton has 73015 states and 237418 transitions. Word has length 25 [2019-12-07 13:11:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:21,314 INFO L462 AbstractCegarLoop]: Abstraction has 73015 states and 237418 transitions. [2019-12-07 13:11:21,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:21,315 INFO L276 IsEmpty]: Start isEmpty. Operand 73015 states and 237418 transitions. [2019-12-07 13:11:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 13:11:21,397 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:21,397 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] [2019-12-07 13:11:21,397 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash -726628599, now seen corresponding path program 1 times [2019-12-07 13:11:21,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:21,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246364850] [2019-12-07 13:11:21,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:21,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:21,457 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 13:11:21,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246364850] [2019-12-07 13:11:21,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:21,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:11:21,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785025225] [2019-12-07 13:11:21,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 13:11:21,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:21,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 13:11:21,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:11:21,459 INFO L87 Difference]: Start difference. First operand 73015 states and 237418 transitions. Second operand 6 states. [2019-12-07 13:11:21,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:21,730 INFO L93 Difference]: Finished difference Result 70949 states and 232478 transitions. [2019-12-07 13:11:21,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:11:21,731 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 13:11:21,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:21,840 INFO L225 Difference]: With dead ends: 70949 [2019-12-07 13:11:21,840 INFO L226 Difference]: Without dead ends: 70654 [2019-12-07 13:11:21,841 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 13:11:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70654 states. [2019-12-07 13:11:23,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70654 to 68447. [2019-12-07 13:11:23,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68447 states. [2019-12-07 13:11:23,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68447 states to 68447 states and 225687 transitions. [2019-12-07 13:11:23,360 INFO L78 Accepts]: Start accepts. Automaton has 68447 states and 225687 transitions. Word has length 42 [2019-12-07 13:11:23,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:23,361 INFO L462 AbstractCegarLoop]: Abstraction has 68447 states and 225687 transitions. [2019-12-07 13:11:23,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 13:11:23,361 INFO L276 IsEmpty]: Start isEmpty. Operand 68447 states and 225687 transitions. [2019-12-07 13:11:23,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 13:11:23,441 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:23,441 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:23,441 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:23,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:23,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2012604765, now seen corresponding path program 1 times [2019-12-07 13:11:23,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:23,442 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115200227] [2019-12-07 13:11:23,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:23,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:23,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 13:11:23,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115200227] [2019-12-07 13:11:23,496 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:23,496 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:11:23,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860022140] [2019-12-07 13:11:23,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:11:23,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:23,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:11:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:11:23,497 INFO L87 Difference]: Start difference. First operand 68447 states and 225687 transitions. Second operand 3 states. [2019-12-07 13:11:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:23,689 INFO L93 Difference]: Finished difference Result 64969 states and 211447 transitions. [2019-12-07 13:11:23,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:11:23,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 13:11:23,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:23,794 INFO L225 Difference]: With dead ends: 64969 [2019-12-07 13:11:23,794 INFO L226 Difference]: Without dead ends: 64969 [2019-12-07 13:11:23,794 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 13:11:24,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64969 states. [2019-12-07 13:11:25,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64969 to 64969. [2019-12-07 13:11:25,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64969 states. [2019-12-07 13:11:25,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64969 states to 64969 states and 211447 transitions. [2019-12-07 13:11:25,130 INFO L78 Accepts]: Start accepts. Automaton has 64969 states and 211447 transitions. Word has length 71 [2019-12-07 13:11:25,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:25,131 INFO L462 AbstractCegarLoop]: Abstraction has 64969 states and 211447 transitions. [2019-12-07 13:11:25,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:11:25,131 INFO L276 IsEmpty]: Start isEmpty. Operand 64969 states and 211447 transitions. [2019-12-07 13:11:25,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 13:11:25,202 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:25,202 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:25,202 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:25,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:25,202 INFO L82 PathProgramCache]: Analyzing trace with hash -272764284, now seen corresponding path program 1 times [2019-12-07 13:11:25,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:25,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985799402] [2019-12-07 13:11:25,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:25,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:25,272 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 13:11:25,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985799402] [2019-12-07 13:11:25,273 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:25,273 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 13:11:25,273 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614376711] [2019-12-07 13:11:25,273 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:25,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:25,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:11:25,274 INFO L87 Difference]: Start difference. First operand 64969 states and 211447 transitions. Second operand 5 states. [2019-12-07 13:11:25,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:25,754 INFO L93 Difference]: Finished difference Result 75278 states and 241968 transitions. [2019-12-07 13:11:25,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:11:25,755 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-07 13:11:25,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:25,857 INFO L225 Difference]: With dead ends: 75278 [2019-12-07 13:11:25,857 INFO L226 Difference]: Without dead ends: 75278 [2019-12-07 13:11:25,858 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:11:26,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75278 states. [2019-12-07 13:11:27,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75278 to 70538. [2019-12-07 13:11:27,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70538 states. [2019-12-07 13:11:27,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70538 states to 70538 states and 228524 transitions. [2019-12-07 13:11:27,192 INFO L78 Accepts]: Start accepts. Automaton has 70538 states and 228524 transitions. Word has length 72 [2019-12-07 13:11:27,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:27,192 INFO L462 AbstractCegarLoop]: Abstraction has 70538 states and 228524 transitions. [2019-12-07 13:11:27,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:27,192 INFO L276 IsEmpty]: Start isEmpty. Operand 70538 states and 228524 transitions. [2019-12-07 13:11:27,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 13:11:27,272 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:27,272 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:27,272 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:27,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:27,273 INFO L82 PathProgramCache]: Analyzing trace with hash -70425080, now seen corresponding path program 2 times [2019-12-07 13:11:27,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:27,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613097726] [2019-12-07 13:11:27,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:27,547 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 13:11:27,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613097726] [2019-12-07 13:11:27,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:27,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 13:11:27,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193828126] [2019-12-07 13:11:27,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 13:11:27,548 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:27,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 13:11:27,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-07 13:11:27,548 INFO L87 Difference]: Start difference. First operand 70538 states and 228524 transitions. Second operand 10 states. [2019-12-07 13:11:28,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:28,844 INFO L93 Difference]: Finished difference Result 126206 states and 405810 transitions. [2019-12-07 13:11:28,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 13:11:28,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 72 [2019-12-07 13:11:28,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:29,047 INFO L225 Difference]: With dead ends: 126206 [2019-12-07 13:11:29,047 INFO L226 Difference]: Without dead ends: 126206 [2019-12-07 13:11:29,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-07 13:11:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126206 states. [2019-12-07 13:11:31,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126206 to 98040. [2019-12-07 13:11:31,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98040 states. [2019-12-07 13:11:31,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98040 states to 98040 states and 318082 transitions. [2019-12-07 13:11:31,278 INFO L78 Accepts]: Start accepts. Automaton has 98040 states and 318082 transitions. Word has length 72 [2019-12-07 13:11:31,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:31,278 INFO L462 AbstractCegarLoop]: Abstraction has 98040 states and 318082 transitions. [2019-12-07 13:11:31,278 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 13:11:31,278 INFO L276 IsEmpty]: Start isEmpty. Operand 98040 states and 318082 transitions. [2019-12-07 13:11:31,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-07 13:11:31,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:31,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:31,404 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:31,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:31,405 INFO L82 PathProgramCache]: Analyzing trace with hash -2081597808, now seen corresponding path program 3 times [2019-12-07 13:11:31,405 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:31,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088549188] [2019-12-07 13:11:31,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:31,454 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 13:11:31,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088549188] [2019-12-07 13:11:31,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:31,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 13:11:31,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462705269] [2019-12-07 13:11:31,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 13:11:31,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:31,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 13:11:31,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 13:11:31,456 INFO L87 Difference]: Start difference. First operand 98040 states and 318082 transitions. Second operand 3 states. [2019-12-07 13:11:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:31,774 INFO L93 Difference]: Finished difference Result 98039 states and 318080 transitions. [2019-12-07 13:11:31,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 13:11:31,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-12-07 13:11:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:31,925 INFO L225 Difference]: With dead ends: 98039 [2019-12-07 13:11:31,925 INFO L226 Difference]: Without dead ends: 98039 [2019-12-07 13:11:31,926 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 13:11:32,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98039 states. [2019-12-07 13:11:33,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98039 to 87351. [2019-12-07 13:11:33,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87351 states. [2019-12-07 13:11:33,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87351 states to 87351 states and 284592 transitions. [2019-12-07 13:11:33,824 INFO L78 Accepts]: Start accepts. Automaton has 87351 states and 284592 transitions. Word has length 72 [2019-12-07 13:11:33,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:33,825 INFO L462 AbstractCegarLoop]: Abstraction has 87351 states and 284592 transitions. [2019-12-07 13:11:33,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 13:11:33,825 INFO L276 IsEmpty]: Start isEmpty. Operand 87351 states and 284592 transitions. [2019-12-07 13:11:33,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 13:11:33,937 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:33,937 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:33,937 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash -55394244, now seen corresponding path program 1 times [2019-12-07 13:11:33,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:33,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944017806] [2019-12-07 13:11:33,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:34,020 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 13:11:34,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944017806] [2019-12-07 13:11:34,021 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:34,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:11:34,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231731790] [2019-12-07 13:11:34,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:34,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:34,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:34,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:11:34,021 INFO L87 Difference]: Start difference. First operand 87351 states and 284592 transitions. Second operand 5 states. [2019-12-07 13:11:34,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:34,503 INFO L93 Difference]: Finished difference Result 157237 states and 511252 transitions. [2019-12-07 13:11:34,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 13:11:34,503 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-07 13:11:34,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:34,608 INFO L225 Difference]: With dead ends: 157237 [2019-12-07 13:11:34,609 INFO L226 Difference]: Without dead ends: 73453 [2019-12-07 13:11:34,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 13:11:35,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73453 states. [2019-12-07 13:11:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73453 to 73453. [2019-12-07 13:11:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73453 states. [2019-12-07 13:11:36,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73453 states to 73453 states and 238130 transitions. [2019-12-07 13:11:36,117 INFO L78 Accepts]: Start accepts. Automaton has 73453 states and 238130 transitions. Word has length 73 [2019-12-07 13:11:36,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:36,117 INFO L462 AbstractCegarLoop]: Abstraction has 73453 states and 238130 transitions. [2019-12-07 13:11:36,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:36,118 INFO L276 IsEmpty]: Start isEmpty. Operand 73453 states and 238130 transitions. [2019-12-07 13:11:36,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 13:11:36,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:36,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:36,204 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:36,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:36,205 INFO L82 PathProgramCache]: Analyzing trace with hash -477122996, now seen corresponding path program 2 times [2019-12-07 13:11:36,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:36,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820005418] [2019-12-07 13:11:36,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:36,278 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 13:11:36,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820005418] [2019-12-07 13:11:36,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:36,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 13:11:36,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683799670] [2019-12-07 13:11:36,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 13:11:36,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:36,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 13:11:36,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 13:11:36,280 INFO L87 Difference]: Start difference. First operand 73453 states and 238130 transitions. Second operand 4 states. [2019-12-07 13:11:36,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:36,573 INFO L93 Difference]: Finished difference Result 84544 states and 272957 transitions. [2019-12-07 13:11:36,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 13:11:36,573 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 73 [2019-12-07 13:11:36,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:36,695 INFO L225 Difference]: With dead ends: 84544 [2019-12-07 13:11:36,696 INFO L226 Difference]: Without dead ends: 78203 [2019-12-07 13:11:36,696 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 13:11:37,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78203 states. [2019-12-07 13:11:37,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78203 to 67636. [2019-12-07 13:11:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67636 states. [2019-12-07 13:11:38,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67636 states to 67636 states and 218721 transitions. [2019-12-07 13:11:38,121 INFO L78 Accepts]: Start accepts. Automaton has 67636 states and 218721 transitions. Word has length 73 [2019-12-07 13:11:38,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:38,121 INFO L462 AbstractCegarLoop]: Abstraction has 67636 states and 218721 transitions. [2019-12-07 13:11:38,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 13:11:38,121 INFO L276 IsEmpty]: Start isEmpty. Operand 67636 states and 218721 transitions. [2019-12-07 13:11:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-07 13:11:38,201 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:38,201 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:38,201 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:38,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:38,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1315831668, now seen corresponding path program 3 times [2019-12-07 13:11:38,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:38,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898444112] [2019-12-07 13:11:38,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:38,272 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 13:11:38,272 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898444112] [2019-12-07 13:11:38,272 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:38,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 13:11:38,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137209463] [2019-12-07 13:11:38,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 13:11:38,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:38,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 13:11:38,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 13:11:38,273 INFO L87 Difference]: Start difference. First operand 67636 states and 218721 transitions. Second operand 5 states. [2019-12-07 13:11:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:38,528 INFO L93 Difference]: Finished difference Result 76175 states and 245690 transitions. [2019-12-07 13:11:38,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 13:11:38,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2019-12-07 13:11:38,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:38,539 INFO L225 Difference]: With dead ends: 76175 [2019-12-07 13:11:38,539 INFO L226 Difference]: Without dead ends: 8739 [2019-12-07 13:11:38,539 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 13:11:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8739 states. [2019-12-07 13:11:38,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8739 to 8739. [2019-12-07 13:11:38,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8739 states. [2019-12-07 13:11:38,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8739 states to 8739 states and 27341 transitions. [2019-12-07 13:11:38,691 INFO L78 Accepts]: Start accepts. Automaton has 8739 states and 27341 transitions. Word has length 73 [2019-12-07 13:11:38,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:38,691 INFO L462 AbstractCegarLoop]: Abstraction has 8739 states and 27341 transitions. [2019-12-07 13:11:38,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 13:11:38,691 INFO L276 IsEmpty]: Start isEmpty. Operand 8739 states and 27341 transitions. [2019-12-07 13:11:38,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:38,699 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:38,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:38,699 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:38,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:38,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1189124082, now seen corresponding path program 1 times [2019-12-07 13:11:38,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:38,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229031073] [2019-12-07 13:11:38,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:38,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:38,915 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 13:11:38,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229031073] [2019-12-07 13:11:38,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:38,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:11:38,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662045675] [2019-12-07 13:11:38,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:11:38,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:38,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:11:38,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:38,916 INFO L87 Difference]: Start difference. First operand 8739 states and 27341 transitions. Second operand 14 states. [2019-12-07 13:11:40,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:40,269 INFO L93 Difference]: Finished difference Result 17983 states and 55474 transitions. [2019-12-07 13:11:40,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-07 13:11:40,269 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-12-07 13:11:40,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:40,289 INFO L225 Difference]: With dead ends: 17983 [2019-12-07 13:11:40,289 INFO L226 Difference]: Without dead ends: 12276 [2019-12-07 13:11:40,290 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2019-12-07 13:11:40,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12276 states. [2019-12-07 13:11:40,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12276 to 11050. [2019-12-07 13:11:40,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-07 13:11:40,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33799 transitions. [2019-12-07 13:11:40,493 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33799 transitions. Word has length 74 [2019-12-07 13:11:40,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:40,493 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33799 transitions. [2019-12-07 13:11:40,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:11:40,493 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33799 transitions. [2019-12-07 13:11:40,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:40,503 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:40,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:40,503 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:40,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:40,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1331529172, now seen corresponding path program 2 times [2019-12-07 13:11:40,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:40,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636072930] [2019-12-07 13:11:40,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:40,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:40,728 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 13:11:40,728 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636072930] [2019-12-07 13:11:40,728 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:40,728 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 13:11:40,728 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191670790] [2019-12-07 13:11:40,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:11:40,729 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:40,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:11:40,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:40,729 INFO L87 Difference]: Start difference. First operand 11050 states and 33799 transitions. Second operand 14 states. [2019-12-07 13:11:41,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:41,760 INFO L93 Difference]: Finished difference Result 16076 states and 48352 transitions. [2019-12-07 13:11:41,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-07 13:11:41,761 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-12-07 13:11:41,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:41,775 INFO L225 Difference]: With dead ends: 16076 [2019-12-07 13:11:41,776 INFO L226 Difference]: Without dead ends: 13575 [2019-12-07 13:11:41,776 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2019-12-07 13:11:41,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13575 states. [2019-12-07 13:11:41,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13575 to 11202. [2019-12-07 13:11:41,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11202 states. [2019-12-07 13:11:41,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11202 states to 11202 states and 34108 transitions. [2019-12-07 13:11:41,955 INFO L78 Accepts]: Start accepts. Automaton has 11202 states and 34108 transitions. Word has length 74 [2019-12-07 13:11:41,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:41,955 INFO L462 AbstractCegarLoop]: Abstraction has 11202 states and 34108 transitions. [2019-12-07 13:11:41,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:11:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 11202 states and 34108 transitions. [2019-12-07 13:11:41,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:41,964 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:41,964 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:41,964 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:41,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:41,964 INFO L82 PathProgramCache]: Analyzing trace with hash -381191204, now seen corresponding path program 3 times [2019-12-07 13:11:41,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:41,964 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395757830] [2019-12-07 13:11:41,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:42,221 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 13:11:42,222 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395757830] [2019-12-07 13:11:42,222 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:42,222 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 13:11:42,222 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123110770] [2019-12-07 13:11:42,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:11:42,223 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:42,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:11:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:11:42,223 INFO L87 Difference]: Start difference. First operand 11202 states and 34108 transitions. Second operand 16 states. [2019-12-07 13:11:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:44,248 INFO L93 Difference]: Finished difference Result 16966 states and 51303 transitions. [2019-12-07 13:11:44,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 13:11:44,248 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-07 13:11:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:44,262 INFO L225 Difference]: With dead ends: 16966 [2019-12-07 13:11:44,262 INFO L226 Difference]: Without dead ends: 12610 [2019-12-07 13:11:44,263 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=838, Unknown=0, NotChecked=0, Total=992 [2019-12-07 13:11:44,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12610 states. [2019-12-07 13:11:44,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12610 to 11012. [2019-12-07 13:11:44,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11012 states. [2019-12-07 13:11:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11012 states to 11012 states and 33435 transitions. [2019-12-07 13:11:44,435 INFO L78 Accepts]: Start accepts. Automaton has 11012 states and 33435 transitions. Word has length 74 [2019-12-07 13:11:44,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:44,435 INFO L462 AbstractCegarLoop]: Abstraction has 11012 states and 33435 transitions. [2019-12-07 13:11:44,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:11:44,436 INFO L276 IsEmpty]: Start isEmpty. Operand 11012 states and 33435 transitions. [2019-12-07 13:11:44,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:44,444 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:44,444 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:44,444 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:44,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:44,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1397908254, now seen corresponding path program 4 times [2019-12-07 13:11:44,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:44,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048811710] [2019-12-07 13:11:44,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:44,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:44,697 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 13:11:44,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048811710] [2019-12-07 13:11:44,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:44,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 13:11:44,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926663972] [2019-12-07 13:11:44,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 13:11:44,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:44,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 13:11:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-07 13:11:44,699 INFO L87 Difference]: Start difference. First operand 11012 states and 33435 transitions. Second operand 16 states. [2019-12-07 13:11:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:45,883 INFO L93 Difference]: Finished difference Result 13277 states and 39671 transitions. [2019-12-07 13:11:45,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 13:11:45,883 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2019-12-07 13:11:45,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:45,896 INFO L225 Difference]: With dead ends: 13277 [2019-12-07 13:11:45,897 INFO L226 Difference]: Without dead ends: 12490 [2019-12-07 13:11:45,897 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=164, Invalid=958, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 13:11:45,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12490 states. [2019-12-07 13:11:46,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12490 to 10860. [2019-12-07 13:11:46,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10860 states. [2019-12-07 13:11:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10860 states to 10860 states and 32939 transitions. [2019-12-07 13:11:46,069 INFO L78 Accepts]: Start accepts. Automaton has 10860 states and 32939 transitions. Word has length 74 [2019-12-07 13:11:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:46,069 INFO L462 AbstractCegarLoop]: Abstraction has 10860 states and 32939 transitions. [2019-12-07 13:11:46,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 13:11:46,069 INFO L276 IsEmpty]: Start isEmpty. Operand 10860 states and 32939 transitions. [2019-12-07 13:11:46,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:46,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:46,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:46,078 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:46,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:46,079 INFO L82 PathProgramCache]: Analyzing trace with hash 1515891926, now seen corresponding path program 5 times [2019-12-07 13:11:46,079 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:46,079 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007849904] [2019-12-07 13:11:46,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:46,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:46,253 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 13:11:46,253 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007849904] [2019-12-07 13:11:46,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:46,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 13:11:46,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133882458] [2019-12-07 13:11:46,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 13:11:46,254 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:46,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 13:11:46,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-07 13:11:46,254 INFO L87 Difference]: Start difference. First operand 10860 states and 32939 transitions. Second operand 13 states. [2019-12-07 13:11:47,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:47,254 INFO L93 Difference]: Finished difference Result 13698 states and 40827 transitions. [2019-12-07 13:11:47,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-07 13:11:47,254 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 74 [2019-12-07 13:11:47,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:47,268 INFO L225 Difference]: With dead ends: 13698 [2019-12-07 13:11:47,268 INFO L226 Difference]: Without dead ends: 12891 [2019-12-07 13:11:47,269 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=679, Unknown=0, NotChecked=0, Total=812 [2019-12-07 13:11:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12891 states. [2019-12-07 13:11:47,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12891 to 10804. [2019-12-07 13:11:47,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10804 states. [2019-12-07 13:11:47,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10804 states to 10804 states and 32797 transitions. [2019-12-07 13:11:47,439 INFO L78 Accepts]: Start accepts. Automaton has 10804 states and 32797 transitions. Word has length 74 [2019-12-07 13:11:47,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:47,439 INFO L462 AbstractCegarLoop]: Abstraction has 10804 states and 32797 transitions. [2019-12-07 13:11:47,439 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 13:11:47,439 INFO L276 IsEmpty]: Start isEmpty. Operand 10804 states and 32797 transitions. [2019-12-07 13:11:47,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:47,447 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:47,447 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:47,447 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:47,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:47,447 INFO L82 PathProgramCache]: Analyzing trace with hash 372604844, now seen corresponding path program 6 times [2019-12-07 13:11:47,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:47,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433102081] [2019-12-07 13:11:47,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:47,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:47,639 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 13:11:47,639 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433102081] [2019-12-07 13:11:47,639 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:47,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 13:11:47,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067182838] [2019-12-07 13:11:47,640 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 13:11:47,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:47,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 13:11:47,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:47,640 INFO L87 Difference]: Start difference. First operand 10804 states and 32797 transitions. Second operand 14 states. [2019-12-07 13:11:49,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:49,777 INFO L93 Difference]: Finished difference Result 16393 states and 48812 transitions. [2019-12-07 13:11:49,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 13:11:49,777 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 74 [2019-12-07 13:11:49,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:49,792 INFO L225 Difference]: With dead ends: 16393 [2019-12-07 13:11:49,792 INFO L226 Difference]: Without dead ends: 13433 [2019-12-07 13:11:49,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=746, Unknown=0, NotChecked=0, Total=870 [2019-12-07 13:11:49,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13433 states. [2019-12-07 13:11:49,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13433 to 11202. [2019-12-07 13:11:49,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11202 states. [2019-12-07 13:11:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11202 states to 11202 states and 33772 transitions. [2019-12-07 13:11:49,970 INFO L78 Accepts]: Start accepts. Automaton has 11202 states and 33772 transitions. Word has length 74 [2019-12-07 13:11:49,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:49,970 INFO L462 AbstractCegarLoop]: Abstraction has 11202 states and 33772 transitions. [2019-12-07 13:11:49,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 13:11:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 11202 states and 33772 transitions. [2019-12-07 13:11:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:49,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:49,980 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:49,980 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:49,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:49,980 INFO L82 PathProgramCache]: Analyzing trace with hash 222782736, now seen corresponding path program 7 times [2019-12-07 13:11:49,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:49,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203890130] [2019-12-07 13:11:49,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:49,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 13:11:50,053 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 13:11:50,054 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203890130] [2019-12-07 13:11:50,054 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 13:11:50,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-07 13:11:50,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324649118] [2019-12-07 13:11:50,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 13:11:50,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 13:11:50,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 13:11:50,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-07 13:11:50,055 INFO L87 Difference]: Start difference. First operand 11202 states and 33772 transitions. Second operand 8 states. [2019-12-07 13:11:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 13:11:50,261 INFO L93 Difference]: Finished difference Result 17044 states and 50991 transitions. [2019-12-07 13:11:50,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 13:11:50,262 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 74 [2019-12-07 13:11:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 13:11:50,276 INFO L225 Difference]: With dead ends: 17044 [2019-12-07 13:11:50,277 INFO L226 Difference]: Without dead ends: 14039 [2019-12-07 13:11:50,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2019-12-07 13:11:50,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14039 states. [2019-12-07 13:11:50,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14039 to 11065. [2019-12-07 13:11:50,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11065 states. [2019-12-07 13:11:50,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11065 states to 11065 states and 33494 transitions. [2019-12-07 13:11:50,473 INFO L78 Accepts]: Start accepts. Automaton has 11065 states and 33494 transitions. Word has length 74 [2019-12-07 13:11:50,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 13:11:50,473 INFO L462 AbstractCegarLoop]: Abstraction has 11065 states and 33494 transitions. [2019-12-07 13:11:50,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 13:11:50,473 INFO L276 IsEmpty]: Start isEmpty. Operand 11065 states and 33494 transitions. [2019-12-07 13:11:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-07 13:11:50,482 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 13:11:50,482 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 13:11:50,483 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 13:11:50,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 13:11:50,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1705874196, now seen corresponding path program 8 times [2019-12-07 13:11:50,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 13:11:50,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566110020] [2019-12-07 13:11:50,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 13:11:50,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:11:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 13:11:50,585 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 13:11:50,585 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 13:11:50,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= v_~y$flush_delayed~0_213 0) (= v_~main$tmp_guard0~0_40 0) (= 0 v_~y$r_buff1_thd3~0_199) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_191 0) (= v_~__unbuffered_p0_EBX~0_75 0) (= 0 v_~y$r_buff1_thd2~0_303) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard1~0_42 0) (= |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0) (= v_~y$r_buff1_thd1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34|) |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$r_buff0_thd2~0_539) (= v_~y$w_buff1_used~0_664 0) (= 0 v_~__unbuffered_cnt~0_85) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1755~0.base_34| 4)) (= v_~y$read_delayed~0_6 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34| 1)) (= 0 v_~__unbuffered_p0_EAX~0_70) (= v_~y$w_buff0_used~0_1110 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1755~0.base_34|) (= v_~x~0_49 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$w_buff0~0_519) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_451 0) (= 0 v_~weak$$choice0~0_172) (= v_~weak$$choice2~0_268 0) (= v_~y$mem_tmp~0_183 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~y$r_buff1_thd0~0_245 0) (= v_~y~0_341 0) (= v_~y$w_buff1~0_362 0) (= 0 v_~y$r_buff0_thd3~0_215) (= v_~__unbuffered_p1_EBX~0_51 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1755~0.base=|v_ULTIMATE.start_main_~#t1755~0.base_34|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_77|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_75|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_183, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_199, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_451, ~y$flush_delayed~0=v_~y$flush_delayed~0_213, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_10|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_75, ULTIMATE.start_main_~#t1755~0.offset=|v_ULTIMATE.start_main_~#t1755~0.offset_24|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_172, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_362, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_539, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ~x~0=v_~x~0_49, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1110, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_89|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_519, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_215, ~y~0=v_~y~0_341, ULTIMATE.start_main_#t~nondet63=|v_ULTIMATE.start_main_#t~nondet63_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_10|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_303, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_19|, ~weak$$choice2~0=v_~weak$$choice2~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1755~0.base, ULTIMATE.start_main_~#t1757~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1755~0.offset, ULTIMATE.start_main_~#t1757~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1756~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1756~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet63, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:11:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1756~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10|) |v_ULTIMATE.start_main_~#t1756~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1756~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1756~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_10|, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1756~0.base, ULTIMATE.start_main_~#t1756~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 13:11:50,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12|) |v_ULTIMATE.start_main_~#t1757~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t1757~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1757~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1757~0.base_12| 0)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1757~0.base_12| 4))) 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_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_~#t1757~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1757~0.base, #length] because there is no mapped edge [2019-12-07 13:11:50,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L5-->L776: Formula: (and (= ~y$r_buff1_thd2~0_Out-1854329461 ~y$r_buff0_thd2~0_In-1854329461) (= ~weak$$choice2~0_Out-1854329461 ~y$flush_delayed~0_Out-1854329461) (= ~y$r_buff1_thd0~0_Out-1854329461 ~y$r_buff0_thd0~0_In-1854329461) (= ~y$r_buff1_thd3~0_Out-1854329461 ~y$r_buff0_thd3~0_In-1854329461) (= ~y$r_buff0_thd1~0_In-1854329461 ~y$r_buff1_thd1~0_Out-1854329461) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1854329461 0)) (= |P1Thread1of1ForFork1_#t~nondet26_In-1854329461| ~weak$$choice0~0_Out-1854329461) (= ~weak$$choice2~0_Out-1854329461 |P1Thread1of1ForFork1_#t~nondet27_In-1854329461|) (= ~y~0_In-1854329461 ~y$mem_tmp~0_Out-1854329461) (= ~y$r_buff0_thd2~0_Out-1854329461 1)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1854329461, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_In-1854329461|, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_In-1854329461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1854329461, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1854329461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1854329461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1854329461, ~y~0=~y~0_In-1854329461} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1854329461, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1854329461, ~weak$$choice0~0=~weak$$choice0~0_Out-1854329461, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1854329461, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1854329461, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_Out-1854329461|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1854329461, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_Out-1854329461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1854329461, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1854329461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1854329461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1854329461, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1854329461, ~y~0=~y~0_In-1854329461, ~weak$$choice2~0=~weak$$choice2~0_Out-1854329461, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1854329461} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet26, ~y$r_buff1_thd3~0, P1Thread1of1ForFork1_#t~nondet27, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:11:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1703162264 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1703162264 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1703162264| ~y$w_buff1~0_In-1703162264)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1703162264| ~y$w_buff0~0_In-1703162264)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703162264, ~y$w_buff1~0=~y$w_buff1~0_In-1703162264, ~y$w_buff0~0=~y$w_buff0~0_In-1703162264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1703162264} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703162264, ~y$w_buff1~0=~y$w_buff1~0_In-1703162264, ~y$w_buff0~0=~y$w_buff0~0_In-1703162264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1703162264, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1703162264|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:11:50,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L776-4-->L777: Formula: (= v_~y~0_82 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_82, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:11:50,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L781-->L782: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~y$r_buff0_thd2~0_140 v_~y$r_buff0_thd2~0_139)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_7|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_7|, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 13:11:50,593 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1683418705 256) 0))) (or (and (= ~y$mem_tmp~0_In-1683418705 |P1Thread1of1ForFork1_#t~ite48_Out-1683418705|) (not .cse0)) (and .cse0 (= ~y~0_In-1683418705 |P1Thread1of1ForFork1_#t~ite48_Out-1683418705|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1683418705, ~y$flush_delayed~0=~y$flush_delayed~0_In-1683418705, ~y~0=~y~0_In-1683418705} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1683418705, ~y$flush_delayed~0=~y$flush_delayed~0_In-1683418705, ~y~0=~y~0_In-1683418705, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1683418705|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 13:11:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-313546918 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-313546918 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-313546918 |P2Thread1of1ForFork2_#t~ite55_Out-313546918|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-313546918 |P2Thread1of1ForFork2_#t~ite55_Out-313546918|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-313546918, ~y$w_buff1~0=~y$w_buff1~0_In-313546918, ~y~0=~y~0_In-313546918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313546918} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-313546918, ~y$w_buff1~0=~y$w_buff1~0_In-313546918, P2Thread1of1ForFork2_#t~ite55=|P2Thread1of1ForFork2_#t~ite55_Out-313546918|, ~y~0=~y~0_In-313546918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313546918} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite55] because there is no mapped edge [2019-12-07 13:11:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L808-4-->L809: Formula: (= |v_P2Thread1of1ForFork2_#t~ite55_8| v_~y~0_39) InVars {P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_8|} OutVars{P2Thread1of1ForFork2_#t~ite56=|v_P2Thread1of1ForFork2_#t~ite56_13|, P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_7|, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite56, P2Thread1of1ForFork2_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 13:11:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In823395171 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In823395171 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out823395171| ~y$w_buff0_used~0_In823395171)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out823395171| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In823395171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In823395171} OutVars{P2Thread1of1ForFork2_#t~ite57=|P2Thread1of1ForFork2_#t~ite57_Out823395171|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In823395171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In823395171} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite57] because there is no mapped edge [2019-12-07 13:11:50,595 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1770523712 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1770523712 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1770523712 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1770523712 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite58_Out1770523712| ~y$w_buff1_used~0_In1770523712)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite58_Out1770523712|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770523712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770523712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770523712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770523712} OutVars{P2Thread1of1ForFork2_#t~ite58=|P2Thread1of1ForFork2_#t~ite58_Out1770523712|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770523712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770523712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770523712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770523712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58] because there is no mapped edge [2019-12-07 13:11:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1154075606 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1154075606 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite59_Out-1154075606| 0)) (and (= |P2Thread1of1ForFork2_#t~ite59_Out-1154075606| ~y$r_buff0_thd3~0_In-1154075606) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154075606, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1154075606} OutVars{P2Thread1of1ForFork2_#t~ite59=|P2Thread1of1ForFork2_#t~ite59_Out-1154075606|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154075606, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1154075606} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite59] because there is no mapped edge [2019-12-07 13:11:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-1614728352 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1614728352 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1614728352 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1614728352 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite60_Out-1614728352|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1614728352 |P2Thread1of1ForFork2_#t~ite60_Out-1614728352|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1614728352, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614728352, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1614728352, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1614728352} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1614728352, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614728352, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1614728352, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out-1614728352|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1614728352} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-07 13:11:50,596 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1066] [1066] L812-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite60_18| v_~y$r_buff1_thd3~0_84)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_18|} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_84, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_17|, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#t~ite60, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:11:50,597 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1697707657 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1697707657 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1697707657 |P1Thread1of1ForFork1_#t~ite51_Out-1697707657|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1697707657|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1697707657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1697707657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1697707657, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1697707657|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1697707657} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 13:11:50,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In121047261 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In121047261 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In121047261 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In121047261 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out121047261| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out121047261| ~y$w_buff1_used~0_In121047261)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121047261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121047261, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121047261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121047261} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121047261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121047261, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out121047261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121047261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121047261} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 13:11:50,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L794-->L795: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-2144081535 ~y$r_buff0_thd2~0_In-2144081535)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2144081535 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2144081535 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-2144081535 0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144081535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144081535} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2144081535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144081535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2144081535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:11:50,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In432024107 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In432024107 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In432024107 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In432024107 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In432024107 |P1Thread1of1ForFork1_#t~ite54_Out432024107|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out432024107|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In432024107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In432024107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In432024107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In432024107} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In432024107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In432024107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In432024107, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out432024107|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In432024107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 13:11:50,598 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_207 |v_P1Thread1of1ForFork1_#t~ite54_30|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_207, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:11:50,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1916894799 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-1916894799| ~y~0_In-1916894799)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-1916894799| ~y$mem_tmp~0_In-1916894799)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1916894799, ~y$flush_delayed~0=~y$flush_delayed~0_In-1916894799, ~y~0=~y~0_In-1916894799} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1916894799, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1916894799|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1916894799, ~y~0=~y~0_In-1916894799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 13:11:50,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1076] [1076] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= v_~y~0_239 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$flush_delayed~0_143 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~y~0=v_~y~0_239} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 13:11:50,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L839-->L841-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= (mod v_~y$w_buff0_used~0_336 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:11:50,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1034] [1034] L841-2-->L841-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1169645616 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1169645616 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite64_Out-1169645616| ~y$w_buff1~0_In-1169645616)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out-1169645616| ~y~0_In-1169645616)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1169645616, ~y~0=~y~0_In-1169645616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1169645616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1169645616} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1169645616, ~y~0=~y~0_In-1169645616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1169645616, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1169645616|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1169645616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:11:50,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L841-4-->L842: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite64_11|) InVars {ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{~y~0=v_~y~0_43, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_12|} AuxVars[] AssignedVars[~y~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 13:11:50,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In253276377 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In253276377 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In253276377 |ULTIMATE.start_main_#t~ite66_Out253276377|)) (and (= |ULTIMATE.start_main_#t~ite66_Out253276377| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In253276377, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In253276377} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In253276377, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In253276377, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out253276377|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 13:11:50,604 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1045] [1045] L843-->L843-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1695147365 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1695147365 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1695147365 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1695147365 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite67_Out1695147365| ~y$w_buff1_used~0_In1695147365)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out1695147365|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1695147365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1695147365, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1695147365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695147365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1695147365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1695147365, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1695147365|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1695147365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695147365} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 13:11:50,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2114768361 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2114768361 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out2114768361|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out2114768361| ~y$r_buff0_thd0~0_In2114768361)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2114768361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2114768361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2114768361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2114768361, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out2114768361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 13:11:50,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1612300402 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1612300402 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1612300402 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1612300402 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite69_Out1612300402| ~y$r_buff1_thd0~0_In1612300402) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite69_Out1612300402| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1612300402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1612300402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1612300402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1612300402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1612300402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1612300402, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1612300402|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1612300402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 13:11:50,605 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~y$r_buff1_thd0~0_177 |v_ULTIMATE.start_main_#t~ite69_39|) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_32 0) (= 1 v_~__unbuffered_p0_EAX~0_41))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_38|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:11:50,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 01:11:50 BasicIcfg [2019-12-07 13:11:50,661 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 13:11:50,661 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 13:11:50,661 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 13:11:50,662 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 13:11:50,662 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 01:07:14" (3/4) ... [2019-12-07 13:11:50,663 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 13:11:50,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1106] [1106] ULTIMATE.startENTRY-->L831: Formula: (let ((.cse0 (store |v_#valid_76| 0 0))) (and (= v_~y$flush_delayed~0_213 0) (= v_~main$tmp_guard0~0_40 0) (= 0 v_~y$r_buff1_thd3~0_199) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~y$r_buff0_thd0~0_191 0) (= v_~__unbuffered_p0_EBX~0_75 0) (= 0 v_~y$r_buff1_thd2~0_303) (= |v_#NULL.offset_6| 0) (= v_~main$tmp_guard1~0_42 0) (= |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0) (= v_~y$r_buff1_thd1~0_350 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34|)) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t1755~0.base_34|) |v_ULTIMATE.start_main_~#t1755~0.offset_24| 0)) |v_#memory_int_19|) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~y$r_buff0_thd2~0_539) (= v_~y$w_buff1_used~0_664 0) (= 0 v_~__unbuffered_cnt~0_85) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t1755~0.base_34| 4)) (= v_~y$read_delayed~0_6 0) (= |v_#valid_74| (store .cse0 |v_ULTIMATE.start_main_~#t1755~0.base_34| 1)) (= 0 v_~__unbuffered_p0_EAX~0_70) (= v_~y$w_buff0_used~0_1110 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1755~0.base_34|) (= v_~x~0_49 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$w_buff0~0_519) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd1~0_451 0) (= 0 v_~weak$$choice0~0_172) (= v_~weak$$choice2~0_268 0) (= v_~y$mem_tmp~0_183 0) (= 0 v_~__unbuffered_p1_EAX~0_47) (= v_~y$r_buff1_thd0~0_245 0) (= v_~y~0_341 0) (= v_~y$w_buff1~0_362 0) (= 0 v_~y$r_buff0_thd3~0_215) (= v_~__unbuffered_p1_EBX~0_51 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_20|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1755~0.base=|v_ULTIMATE.start_main_~#t1755~0.base_34|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_18|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_39|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_77|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_75|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_183, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_199, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_451, ~y$flush_delayed~0=v_~y$flush_delayed~0_213, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_10|, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_75, ULTIMATE.start_main_~#t1755~0.offset=|v_ULTIMATE.start_main_~#t1755~0.offset_24|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_24|, ~weak$$choice0~0=v_~weak$$choice0~0_172, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_30|, ~y$w_buff1~0=v_~y$w_buff1~0_362, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_19|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_539, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_245, ~x~0=v_~x~0_49, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1110, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_42, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_89|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_39|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_42|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_350, ~y$w_buff0~0=v_~y$w_buff0~0_519, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_215, ~y~0=v_~y~0_341, ULTIMATE.start_main_#t~nondet63=|v_ULTIMATE.start_main_#t~nondet63_22|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_40, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_10|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_303, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_191, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_19|, ~weak$$choice2~0=v_~weak$$choice2~0_268, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_664} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1755~0.base, ULTIMATE.start_main_~#t1757~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite64, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_~#t1755~0.offset, ULTIMATE.start_main_~#t1757~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1756~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t1756~0.offset, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet63, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 13:11:50,664 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1063] [1063] L831-1-->L833: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1756~0.base_10|) (= 0 (select |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (not (= 0 |v_ULTIMATE.start_main_~#t1756~0.base_10|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1756~0.base_10|) |v_ULTIMATE.start_main_~#t1756~0.offset_9| 1))) (= |v_ULTIMATE.start_main_~#t1756~0.offset_9| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1756~0.base_10| 4)) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t1756~0.base_10| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_8|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1756~0.base=|v_ULTIMATE.start_main_~#t1756~0.base_10|, ULTIMATE.start_main_~#t1756~0.offset=|v_ULTIMATE.start_main_~#t1756~0.offset_9|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_7|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1756~0.base, ULTIMATE.start_main_~#t1756~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-07 13:11:50,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1080] [1080] L833-1-->L835: Formula: (and (= 0 (select |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12|)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1757~0.base_12|) |v_ULTIMATE.start_main_~#t1757~0.offset_10| 2))) (= |v_ULTIMATE.start_main_~#t1757~0.offset_10| 0) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1757~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t1757~0.base_12| 0)) (= (store |v_#valid_38| |v_ULTIMATE.start_main_~#t1757~0.base_12| 1) |v_#valid_37|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1757~0.base_12| 4))) 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_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ULTIMATE.start_main_~#t1757~0.offset=|v_ULTIMATE.start_main_~#t1757~0.offset_10|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1757~0.base=|v_ULTIMATE.start_main_~#t1757~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_~#t1757~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1757~0.base, #length] because there is no mapped edge [2019-12-07 13:11:50,665 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L5-->L776: Formula: (and (= ~y$r_buff1_thd2~0_Out-1854329461 ~y$r_buff0_thd2~0_In-1854329461) (= ~weak$$choice2~0_Out-1854329461 ~y$flush_delayed~0_Out-1854329461) (= ~y$r_buff1_thd0~0_Out-1854329461 ~y$r_buff0_thd0~0_In-1854329461) (= ~y$r_buff1_thd3~0_Out-1854329461 ~y$r_buff0_thd3~0_In-1854329461) (= ~y$r_buff0_thd1~0_In-1854329461 ~y$r_buff1_thd1~0_Out-1854329461) (not (= P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1854329461 0)) (= |P1Thread1of1ForFork1_#t~nondet26_In-1854329461| ~weak$$choice0~0_Out-1854329461) (= ~weak$$choice2~0_Out-1854329461 |P1Thread1of1ForFork1_#t~nondet27_In-1854329461|) (= ~y~0_In-1854329461 ~y$mem_tmp~0_Out-1854329461) (= ~y$r_buff0_thd2~0_Out-1854329461 1)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1854329461, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_In-1854329461|, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_In-1854329461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1854329461, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1854329461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1854329461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1854329461, ~y~0=~y~0_In-1854329461} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out-1854329461, P1Thread1of1ForFork1___VERIFIER_assert_~expression=P1Thread1of1ForFork1___VERIFIER_assert_~expression_In-1854329461, ~weak$$choice0~0=~weak$$choice0~0_Out-1854329461, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out-1854329461, ~y$mem_tmp~0=~y$mem_tmp~0_Out-1854329461, P1Thread1of1ForFork1_#t~nondet26=|P1Thread1of1ForFork1_#t~nondet26_Out-1854329461|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_Out-1854329461, P1Thread1of1ForFork1_#t~nondet27=|P1Thread1of1ForFork1_#t~nondet27_Out-1854329461|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1854329461, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1854329461, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1854329461, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1854329461, ~y$flush_delayed~0=~y$flush_delayed~0_Out-1854329461, ~y~0=~y~0_In-1854329461, ~weak$$choice2~0=~weak$$choice2~0_Out-1854329461, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out-1854329461} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, P1Thread1of1ForFork1_#t~nondet26, ~y$r_buff1_thd3~0, P1Thread1of1ForFork1_#t~nondet27, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 13:11:50,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L776-2-->L776-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1703162264 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-1703162264 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite28_Out-1703162264| ~y$w_buff1~0_In-1703162264)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite28_Out-1703162264| ~y$w_buff0~0_In-1703162264)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703162264, ~y$w_buff1~0=~y$w_buff1~0_In-1703162264, ~y$w_buff0~0=~y$w_buff0~0_In-1703162264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1703162264} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1703162264, ~y$w_buff1~0=~y$w_buff1~0_In-1703162264, ~y$w_buff0~0=~y$w_buff0~0_In-1703162264, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1703162264, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1703162264|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:11:50,666 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L776-4-->L777: Formula: (= v_~y~0_82 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_11|, ~y~0=v_~y~0_82, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-07 13:11:50,668 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L781-->L782: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_83 256))) (= v_~y$r_buff0_thd2~0_140 v_~y$r_buff0_thd2~0_139)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_140, ~weak$$choice2~0=v_~weak$$choice2~0_83} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_11|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_139, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_7|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_7|, ~weak$$choice2~0=v_~weak$$choice2~0_83} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 13:11:50,669 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1683418705 256) 0))) (or (and (= ~y$mem_tmp~0_In-1683418705 |P1Thread1of1ForFork1_#t~ite48_Out-1683418705|) (not .cse0)) (and .cse0 (= ~y~0_In-1683418705 |P1Thread1of1ForFork1_#t~ite48_Out-1683418705|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1683418705, ~y$flush_delayed~0=~y$flush_delayed~0_In-1683418705, ~y~0=~y~0_In-1683418705} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1683418705, ~y$flush_delayed~0=~y$flush_delayed~0_In-1683418705, ~y~0=~y~0_In-1683418705, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-1683418705|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-07 13:11:50,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L808-2-->L808-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-313546918 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-313546918 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-313546918 |P2Thread1of1ForFork2_#t~ite55_Out-313546918|) (not .cse1)) (and (or .cse1 .cse0) (= ~y~0_In-313546918 |P2Thread1of1ForFork2_#t~ite55_Out-313546918|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-313546918, ~y$w_buff1~0=~y$w_buff1~0_In-313546918, ~y~0=~y~0_In-313546918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313546918} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-313546918, ~y$w_buff1~0=~y$w_buff1~0_In-313546918, P2Thread1of1ForFork2_#t~ite55=|P2Thread1of1ForFork2_#t~ite55_Out-313546918|, ~y~0=~y~0_In-313546918, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-313546918} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite55] because there is no mapped edge [2019-12-07 13:11:50,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L808-4-->L809: Formula: (= |v_P2Thread1of1ForFork2_#t~ite55_8| v_~y~0_39) InVars {P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_8|} OutVars{P2Thread1of1ForFork2_#t~ite56=|v_P2Thread1of1ForFork2_#t~ite56_13|, P2Thread1of1ForFork2_#t~ite55=|v_P2Thread1of1ForFork2_#t~ite55_7|, ~y~0=v_~y~0_39} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite56, P2Thread1of1ForFork2_#t~ite55, ~y~0] because there is no mapped edge [2019-12-07 13:11:50,670 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In823395171 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In823395171 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out823395171| ~y$w_buff0_used~0_In823395171)) (and (not .cse1) (= |P2Thread1of1ForFork2_#t~ite57_Out823395171| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In823395171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In823395171} OutVars{P2Thread1of1ForFork2_#t~ite57=|P2Thread1of1ForFork2_#t~ite57_Out823395171|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In823395171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In823395171} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite57] because there is no mapped edge [2019-12-07 13:11:50,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L810-->L810-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1770523712 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1770523712 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1770523712 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1770523712 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite58_Out1770523712| ~y$w_buff1_used~0_In1770523712)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite58_Out1770523712|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770523712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770523712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770523712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770523712} OutVars{P2Thread1of1ForFork2_#t~ite58=|P2Thread1of1ForFork2_#t~ite58_Out1770523712|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1770523712, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1770523712, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1770523712, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1770523712} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58] because there is no mapped edge [2019-12-07 13:11:50,671 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1025] [1025] L811-->L811-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1154075606 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-1154075606 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite59_Out-1154075606| 0)) (and (= |P2Thread1of1ForFork2_#t~ite59_Out-1154075606| ~y$r_buff0_thd3~0_In-1154075606) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154075606, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1154075606} OutVars{P2Thread1of1ForFork2_#t~ite59=|P2Thread1of1ForFork2_#t~ite59_Out-1154075606|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1154075606, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1154075606} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite59] because there is no mapped edge [2019-12-07 13:11:50,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L812-->L812-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd3~0_In-1614728352 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1614728352 256))) (.cse0 (= (mod ~y$r_buff1_thd3~0_In-1614728352 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1614728352 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite60_Out-1614728352|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In-1614728352 |P2Thread1of1ForFork2_#t~ite60_Out-1614728352|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1614728352, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614728352, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1614728352, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1614728352} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1614728352, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1614728352, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1614728352, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out-1614728352|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1614728352} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-07 13:11:50,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1066] [1066] L812-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_39 1) v_~__unbuffered_cnt~0_38) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0) (= |v_P2Thread1of1ForFork2_#t~ite60_18| v_~y$r_buff1_thd3~0_84)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_39, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_18|} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_84, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, P2Thread1of1ForFork2_#t~ite60=|v_P2Thread1of1ForFork2_#t~ite60_17|, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#t~ite60, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 13:11:50,672 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1048] [1048] L792-->L792-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1697707657 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1697707657 256) 0))) (or (and (= ~y$w_buff0_used~0_In-1697707657 |P1Thread1of1ForFork1_#t~ite51_Out-1697707657|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite51_Out-1697707657|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1697707657, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1697707657} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1697707657, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out-1697707657|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1697707657} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-07 13:11:50,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] L793-->L793-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In121047261 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In121047261 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In121047261 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In121047261 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite52_Out121047261| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out121047261| ~y$w_buff1_used~0_In121047261)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121047261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121047261, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121047261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121047261} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In121047261, ~y$w_buff0_used~0=~y$w_buff0_used~0_In121047261, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out121047261|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In121047261, ~y$w_buff1_used~0=~y$w_buff1_used~0_In121047261} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-07 13:11:50,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1027] [1027] L794-->L795: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out-2144081535 ~y$r_buff0_thd2~0_In-2144081535)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In-2144081535 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2144081535 256)))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-2144081535 0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144081535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2144081535} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-2144081535|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2144081535, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-2144081535} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 13:11:50,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] L795-->L795-2: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In432024107 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In432024107 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In432024107 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In432024107 256) 0))) (or (and (= ~y$r_buff1_thd2~0_In432024107 |P1Thread1of1ForFork1_#t~ite54_Out432024107|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite54_Out432024107|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In432024107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In432024107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In432024107, ~y$w_buff1_used~0=~y$w_buff1_used~0_In432024107} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In432024107, ~y$w_buff0_used~0=~y$w_buff0_used~0_In432024107, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In432024107, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out432024107|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In432024107} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-07 13:11:50,673 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1075] [1075] L795-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0) (= v_~y$r_buff1_thd2~0_207 |v_P1Thread1of1ForFork1_#t~ite54_30|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_30|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_207, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_29|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 13:11:50,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1916894799 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out-1916894799| ~y~0_In-1916894799)) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite25_Out-1916894799| ~y$mem_tmp~0_In-1916894799)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1916894799, ~y$flush_delayed~0=~y$flush_delayed~0_In-1916894799, ~y~0=~y~0_In-1916894799} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1916894799, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out-1916894799|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1916894799, ~y~0=~y~0_In-1916894799} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-07 13:11:50,678 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1076] [1076] L747-2-->P0EXIT: Formula: (and (= v_~__unbuffered_cnt~0_50 (+ v_~__unbuffered_cnt~0_51 1)) (= v_~y~0_239 |v_P0Thread1of1ForFork0_#t~ite25_32|) (= |v_P0Thread1of1ForFork0_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork0_#res.base_3|) (= v_~y$flush_delayed~0_143 0)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_31|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_143, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_50, ~y~0=v_~y~0_239} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-07 13:11:50,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [987] [987] L839-->L841-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_68 256) 0) (= (mod v_~y$w_buff0_used~0_336 256) 0)) (not (= (mod v_~main$tmp_guard0~0_8 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_336, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_68, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 13:11:50,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1034] [1034] L841-2-->L841-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-1169645616 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1169645616 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite64_Out-1169645616| ~y$w_buff1~0_In-1169645616)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite64_Out-1169645616| ~y~0_In-1169645616)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1169645616, ~y~0=~y~0_In-1169645616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1169645616, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1169645616} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1169645616, ~y~0=~y~0_In-1169645616, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1169645616, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out-1169645616|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1169645616} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 13:11:50,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L841-4-->L842: Formula: (= v_~y~0_43 |v_ULTIMATE.start_main_#t~ite64_11|) InVars {ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_11|} OutVars{~y~0=v_~y~0_43, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_12|} AuxVars[] AssignedVars[~y~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-07 13:11:50,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1039] [1039] L842-->L842-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In253276377 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In253276377 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In253276377 |ULTIMATE.start_main_#t~ite66_Out253276377|)) (and (= |ULTIMATE.start_main_#t~ite66_Out253276377| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In253276377, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In253276377} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In253276377, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In253276377, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out253276377|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-07 13:11:50,679 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1045] [1045] L843-->L843-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1695147365 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1695147365 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In1695147365 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1695147365 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite67_Out1695147365| ~y$w_buff1_used~0_In1695147365)) (and (= 0 |ULTIMATE.start_main_#t~ite67_Out1695147365|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1695147365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1695147365, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1695147365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695147365} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1695147365, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1695147365, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1695147365|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1695147365, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1695147365} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-07 13:11:50,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1022] [1022] L844-->L844-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2114768361 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2114768361 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out2114768361|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite68_Out2114768361| ~y$r_buff0_thd0~0_In2114768361)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2114768361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2114768361} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2114768361, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2114768361, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out2114768361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-07 13:11:50,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L845-->L845-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1612300402 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1612300402 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1612300402 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1612300402 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite69_Out1612300402| ~y$r_buff1_thd0~0_In1612300402) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite69_Out1612300402| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1612300402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1612300402, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1612300402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1612300402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1612300402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1612300402, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out1612300402|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1612300402, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-07 13:11:50,680 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L845-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|) (= v_~y$r_buff1_thd0~0_177 |v_ULTIMATE.start_main_#t~ite69_39|) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p1_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_32 0) (= 1 v_~__unbuffered_p0_EAX~0_41))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_39|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_38|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_177, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 13:11:50,737 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d563ac09-bdc7-4dc9-a660-da2eb6fa4c65/bin/utaipan/witness.graphml [2019-12-07 13:11:50,738 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 13:11:50,739 INFO L168 Benchmark]: Toolchain (without parser) took 276756.50 ms. Allocated memory was 1.0 GB in the beginning and 7.6 GB in the end (delta: 6.6 GB). Free memory was 942.5 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.8 GB. Max. memory is 11.5 GB. [2019-12-07 13:11:50,739 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 13:11:50,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -112.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:11:50,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.58 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 13:11:50,740 INFO L168 Benchmark]: Boogie Preprocessor took 29.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 13:11:50,740 INFO L168 Benchmark]: RCFGBuilder took 465.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.7 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 13:11:50,740 INFO L168 Benchmark]: TraceAbstraction took 275725.18 ms. Allocated memory was 1.1 GB in the beginning and 7.6 GB in the end (delta: 6.5 GB). Free memory was 988.7 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-12-07 13:11:50,740 INFO L168 Benchmark]: Witness Printer took 76.36 ms. Allocated memory is still 7.6 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. [2019-12-07 13:11:50,742 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 89.7 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -112.2 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.58 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 29.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 465.88 ms. Allocated memory is still 1.1 GB. Free memory was 1.0 GB in the beginning and 988.7 MB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 275725.18 ms. Allocated memory was 1.1 GB in the beginning and 7.6 GB in the end (delta: 6.5 GB). Free memory was 988.7 MB in the beginning and 3.8 GB in the end (delta: -2.8 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 76.36 ms. Allocated memory is still 7.6 GB. Free memory was 3.8 GB in the beginning and 3.8 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.9s, 206 ProgramPointsBefore, 119 ProgramPointsAfterwards, 258 TransitionsBefore, 140 TransitionsAfterwards, 32698 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 54 ConcurrentYvCompositions, 35 ChoiceCompositions, 13704 VarBasedMoverChecksPositive, 346 VarBasedMoverChecksNegative, 52 SemBasedMoverChecksPositive, 414 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 172435 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L831] FCALL, FORK 0 pthread_create(&t1755, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] FCALL, FORK 0 pthread_create(&t1756, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] FCALL, FORK 0 pthread_create(&t1757, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff1 = y$w_buff0 [L761] 2 y$w_buff0 = 1 [L762] 2 y$w_buff1_used = y$w_buff0_used [L763] 2 y$w_buff0_used = (_Bool)1 [L776] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=0, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L778] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L779] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=1, y$flush_delayed=7, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y = y$flush_delayed ? y$mem_tmp : y [L785] 2 y$flush_delayed = (_Bool)0 [L788] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L805] 3 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L808] 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=7, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L809] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L810] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L811] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L792] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L793] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L843] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L844] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 197 locations, 2 error locations. Result: UNSAFE, OverallTime: 275.5s, OverallIterations: 25, TraceHistogramMax: 1, AutomataDifference: 31.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6247 SDtfs, 8541 SDslu, 23502 SDs, 0 SdLazy, 15449 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 341 GetRequests, 64 SyntacticMatches, 13 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 964 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=458686occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 133.7s AutomataMinimizationTime, 24 MinimizatonAttempts, 282784 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1289 NumberOfCodeBlocks, 1289 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1191 ConstructedInterpolants, 0 QuantifiedInterpolants, 486747 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 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...