./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe007_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe007_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d773dccacc8e564a85ddf19a53b7d858900fe29a ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 18:21:20,460 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:21:20,461 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:21:20,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:21:20,469 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:21:20,470 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:21:20,470 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:21:20,472 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:21:20,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:21:20,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:21:20,474 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:21:20,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:21:20,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:21:20,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:21:20,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:21:20,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:21:20,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:21:20,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:21:20,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:21:20,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:21:20,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:21:20,483 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:21:20,484 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:21:20,484 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:21:20,486 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:21:20,486 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:21:20,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:21:20,487 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:21:20,487 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:21:20,488 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:21:20,488 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:21:20,488 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:21:20,489 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:21:20,489 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:21:20,490 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:21:20,490 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:21:20,490 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:21:20,491 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:21:20,491 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:21:20,491 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:21:20,492 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:21:20,492 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:21:20,501 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:21:20,501 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:21:20,502 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:21:20,502 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:21:20,502 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:21:20,503 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:21:20,503 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:21:20,504 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:21:20,504 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:21:20,504 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:21:20,504 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:21:20,504 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:21:20,504 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:21:20,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:20,504 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:21:20,505 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d773dccacc8e564a85ddf19a53b7d858900fe29a [2019-12-07 18:21:20,606 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:21:20,616 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:21:20,619 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:21:20,621 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:21:20,621 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:21:20,622 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe007_power.opt.i [2019-12-07 18:21:20,667 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/data/77d93cec3/75ec2cd5b33e4c26af294ea7268c5004/FLAG837406ff6 [2019-12-07 18:21:21,125 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:21:21,126 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/sv-benchmarks/c/pthread-wmm/safe007_power.opt.i [2019-12-07 18:21:21,136 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/data/77d93cec3/75ec2cd5b33e4c26af294ea7268c5004/FLAG837406ff6 [2019-12-07 18:21:21,145 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/data/77d93cec3/75ec2cd5b33e4c26af294ea7268c5004 [2019-12-07 18:21:21,147 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:21:21,148 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:21:21,149 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:21,149 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:21:21,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:21:21,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8fae9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21, skipping insertion in model container [2019-12-07 18:21:21,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,159 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:21:21,187 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:21:21,456 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:21,464 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:21:21,507 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:21:21,555 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:21:21,556 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21 WrapperNode [2019-12-07 18:21:21,556 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:21:21,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:21,557 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:21:21,557 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:21:21,562 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,578 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,598 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:21:21,598 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:21:21,598 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:21:21,598 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:21:21,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,608 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,609 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,620 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... [2019-12-07 18:21:21,627 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:21:21,627 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:21:21,627 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:21:21,627 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:21:21,628 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:21:21,668 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:21:21,668 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:21:21,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:21:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:21:21,669 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:21:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-07 18:21:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:21:21,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:21:21,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:21:21,670 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-07 18:21:22,094 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:21:22,094 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:21:22,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:22 BoogieIcfgContainer [2019-12-07 18:21:22,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:21:22,095 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:21:22,095 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:21:22,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:21:22,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:21:21" (1/3) ... [2019-12-07 18:21:22,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671035c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:22, skipping insertion in model container [2019-12-07 18:21:22,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:21:21" (2/3) ... [2019-12-07 18:21:22,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@671035c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:21:22, skipping insertion in model container [2019-12-07 18:21:22,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:22" (3/3) ... [2019-12-07 18:21:22,099 INFO L109 eAbstractionObserver]: Analyzing ICFG safe007_power.opt.i [2019-12-07 18:21:22,105 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:21:22,106 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:21:22,110 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:21:22,111 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:21:22,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,139 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,140 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,142 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,143 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,144 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,145 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,146 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,147 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,148 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,149 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,150 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,151 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,152 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,153 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,154 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,155 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,156 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,157 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,158 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,159 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~mem59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:21:22,183 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:21:22,195 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:21:22,195 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:21:22,195 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:21:22,195 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:21:22,195 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:21:22,195 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:21:22,196 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:21:22,196 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:21:22,206 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 224 places, 276 transitions [2019-12-07 18:21:22,208 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 224 places, 276 transitions [2019-12-07 18:21:22,274 INFO L134 PetriNetUnfolder]: 62/273 cut-off events. [2019-12-07 18:21:22,274 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:22,285 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 62/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1085 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-07 18:21:22,304 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 224 places, 276 transitions [2019-12-07 18:21:22,346 INFO L134 PetriNetUnfolder]: 62/273 cut-off events. [2019-12-07 18:21:22,346 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:21:22,353 INFO L76 FinitePrefix]: Finished finitePrefix Result has 283 conditions, 273 events. 62/273 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1085 event pairs. 9/218 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-07 18:21:22,375 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22870 [2019-12-07 18:21:22,376 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:21:27,347 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 105 [2019-12-07 18:21:27,797 WARN L192 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 136 [2019-12-07 18:21:27,947 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-12-07 18:21:27,975 INFO L206 etLargeBlockEncoding]: Checked pairs total: 113419 [2019-12-07 18:21:27,975 INFO L214 etLargeBlockEncoding]: Total number of compositions: 175 [2019-12-07 18:21:27,977 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 133 transitions [2019-12-07 18:21:29,611 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32514 states. [2019-12-07 18:21:29,612 INFO L276 IsEmpty]: Start isEmpty. Operand 32514 states. [2019-12-07 18:21:29,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 18:21:29,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:29,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 18:21:29,617 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:29,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:29,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1148437831, now seen corresponding path program 1 times [2019-12-07 18:21:29,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:29,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966330041] [2019-12-07 18:21:29,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:29,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:29,784 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 18:21:29,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966330041] [2019-12-07 18:21:29,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:29,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:21:29,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300914565] [2019-12-07 18:21:29,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:29,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:29,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:29,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:29,800 INFO L87 Difference]: Start difference. First operand 32514 states. Second operand 3 states. [2019-12-07 18:21:30,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:30,132 INFO L93 Difference]: Finished difference Result 31858 states and 127030 transitions. [2019-12-07 18:21:30,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:30,133 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 18:21:30,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:30,396 INFO L225 Difference]: With dead ends: 31858 [2019-12-07 18:21:30,396 INFO L226 Difference]: Without dead ends: 30394 [2019-12-07 18:21:30,397 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 18:21:30,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30394 states. [2019-12-07 18:21:31,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30394 to 30394. [2019-12-07 18:21:31,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30394 states. [2019-12-07 18:21:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30394 states to 30394 states and 121136 transitions. [2019-12-07 18:21:31,230 INFO L78 Accepts]: Start accepts. Automaton has 30394 states and 121136 transitions. Word has length 5 [2019-12-07 18:21:31,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:31,230 INFO L462 AbstractCegarLoop]: Abstraction has 30394 states and 121136 transitions. [2019-12-07 18:21:31,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:31,230 INFO L276 IsEmpty]: Start isEmpty. Operand 30394 states and 121136 transitions. [2019-12-07 18:21:31,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:21:31,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:31,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:31,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:31,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:31,235 INFO L82 PathProgramCache]: Analyzing trace with hash 816039134, now seen corresponding path program 1 times [2019-12-07 18:21:31,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:31,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777357461] [2019-12-07 18:21:31,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:31,310 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 18:21:31,310 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777357461] [2019-12-07 18:21:31,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:31,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:31,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653789339] [2019-12-07 18:21:31,311 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:31,311 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:31,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:31,312 INFO L87 Difference]: Start difference. First operand 30394 states and 121136 transitions. Second operand 4 states. [2019-12-07 18:21:31,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:31,875 INFO L93 Difference]: Finished difference Result 48598 states and 183912 transitions. [2019-12-07 18:21:31,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:31,875 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:21:31,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:32,007 INFO L225 Difference]: With dead ends: 48598 [2019-12-07 18:21:32,007 INFO L226 Difference]: Without dead ends: 48584 [2019-12-07 18:21:32,008 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:32,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48584 states. [2019-12-07 18:21:32,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48584 to 44998. [2019-12-07 18:21:32,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44998 states. [2019-12-07 18:21:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44998 states to 44998 states and 172210 transitions. [2019-12-07 18:21:33,046 INFO L78 Accepts]: Start accepts. Automaton has 44998 states and 172210 transitions. Word has length 13 [2019-12-07 18:21:33,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:33,047 INFO L462 AbstractCegarLoop]: Abstraction has 44998 states and 172210 transitions. [2019-12-07 18:21:33,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 44998 states and 172210 transitions. [2019-12-07 18:21:33,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:21:33,053 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:33,053 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:33,053 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:33,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:33,054 INFO L82 PathProgramCache]: Analyzing trace with hash -612690505, now seen corresponding path program 1 times [2019-12-07 18:21:33,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:33,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935260016] [2019-12-07 18:21:33,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:33,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:33,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 18:21:33,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935260016] [2019-12-07 18:21:33,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:33,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:21:33,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428837837] [2019-12-07 18:21:33,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:33,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:33,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:33,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:33,131 INFO L87 Difference]: Start difference. First operand 44998 states and 172210 transitions. Second operand 5 states. [2019-12-07 18:21:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:33,603 INFO L93 Difference]: Finished difference Result 66878 states and 251204 transitions. [2019-12-07 18:21:33,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:21:33,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:21:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:33,932 INFO L225 Difference]: With dead ends: 66878 [2019-12-07 18:21:33,932 INFO L226 Difference]: Without dead ends: 66878 [2019-12-07 18:21:33,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:21:34,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66878 states. [2019-12-07 18:21:34,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66878 to 51580. [2019-12-07 18:21:34,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51580 states. [2019-12-07 18:21:35,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51580 states to 51580 states and 196291 transitions. [2019-12-07 18:21:35,198 INFO L78 Accepts]: Start accepts. Automaton has 51580 states and 196291 transitions. Word has length 16 [2019-12-07 18:21:35,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:35,198 INFO L462 AbstractCegarLoop]: Abstraction has 51580 states and 196291 transitions. [2019-12-07 18:21:35,198 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 51580 states and 196291 transitions. [2019-12-07 18:21:35,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:21:35,204 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:35,204 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:35,204 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:35,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:35,205 INFO L82 PathProgramCache]: Analyzing trace with hash -612492787, now seen corresponding path program 1 times [2019-12-07 18:21:35,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:35,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787963756] [2019-12-07 18:21:35,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:35,239 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 18:21:35,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787963756] [2019-12-07 18:21:35,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:35,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:35,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48199007] [2019-12-07 18:21:35,240 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:35,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:35,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:35,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:35,240 INFO L87 Difference]: Start difference. First operand 51580 states and 196291 transitions. Second operand 3 states. [2019-12-07 18:21:35,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:35,541 INFO L93 Difference]: Finished difference Result 68690 states and 256962 transitions. [2019-12-07 18:21:35,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:35,541 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 18:21:35,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:35,688 INFO L225 Difference]: With dead ends: 68690 [2019-12-07 18:21:35,688 INFO L226 Difference]: Without dead ends: 68690 [2019-12-07 18:21:35,689 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 18:21:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68690 states. [2019-12-07 18:21:36,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68690 to 57838. [2019-12-07 18:21:36,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57838 states. [2019-12-07 18:21:37,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57838 states to 57838 states and 217912 transitions. [2019-12-07 18:21:37,033 INFO L78 Accepts]: Start accepts. Automaton has 57838 states and 217912 transitions. Word has length 16 [2019-12-07 18:21:37,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:37,033 INFO L462 AbstractCegarLoop]: Abstraction has 57838 states and 217912 transitions. [2019-12-07 18:21:37,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:37,033 INFO L276 IsEmpty]: Start isEmpty. Operand 57838 states and 217912 transitions. [2019-12-07 18:21:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 18:21:37,038 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:37,038 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:37,038 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:37,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:37,039 INFO L82 PathProgramCache]: Analyzing trace with hash 742083143, now seen corresponding path program 1 times [2019-12-07 18:21:37,039 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:37,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146831523] [2019-12-07 18:21:37,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:37,102 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 18:21:37,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146831523] [2019-12-07 18:21:37,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:37,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:21:37,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880180171] [2019-12-07 18:21:37,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:37,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:37,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:37,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:37,103 INFO L87 Difference]: Start difference. First operand 57838 states and 217912 transitions. Second operand 5 states. [2019-12-07 18:21:37,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:37,548 INFO L93 Difference]: Finished difference Result 72076 states and 269083 transitions. [2019-12-07 18:21:37,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:21:37,549 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 18:21:37,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:37,701 INFO L225 Difference]: With dead ends: 72076 [2019-12-07 18:21:37,701 INFO L226 Difference]: Without dead ends: 72076 [2019-12-07 18:21:37,701 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:21:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72076 states. [2019-12-07 18:21:38,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72076 to 57278. [2019-12-07 18:21:38,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57278 states. [2019-12-07 18:21:39,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57278 states to 57278 states and 216046 transitions. [2019-12-07 18:21:39,111 INFO L78 Accepts]: Start accepts. Automaton has 57278 states and 216046 transitions. Word has length 16 [2019-12-07 18:21:39,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:39,111 INFO L462 AbstractCegarLoop]: Abstraction has 57278 states and 216046 transitions. [2019-12-07 18:21:39,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:39,112 INFO L276 IsEmpty]: Start isEmpty. Operand 57278 states and 216046 transitions. [2019-12-07 18:21:39,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:21:39,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:39,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:39,128 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:39,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:39,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1834139520, now seen corresponding path program 1 times [2019-12-07 18:21:39,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:39,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615932697] [2019-12-07 18:21:39,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:39,175 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 18:21:39,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615932697] [2019-12-07 18:21:39,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:39,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:39,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129522129] [2019-12-07 18:21:39,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:39,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:39,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:39,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:39,177 INFO L87 Difference]: Start difference. First operand 57278 states and 216046 transitions. Second operand 3 states. [2019-12-07 18:21:39,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:39,411 INFO L93 Difference]: Finished difference Result 54970 states and 205544 transitions. [2019-12-07 18:21:39,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:39,412 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:21:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:39,533 INFO L225 Difference]: With dead ends: 54970 [2019-12-07 18:21:39,534 INFO L226 Difference]: Without dead ends: 54970 [2019-12-07 18:21:39,534 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 18:21:39,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54970 states. [2019-12-07 18:21:40,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54970 to 54730. [2019-12-07 18:21:40,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54730 states. [2019-12-07 18:21:40,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54730 states to 54730 states and 204728 transitions. [2019-12-07 18:21:40,716 INFO L78 Accepts]: Start accepts. Automaton has 54730 states and 204728 transitions. Word has length 20 [2019-12-07 18:21:40,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:40,716 INFO L462 AbstractCegarLoop]: Abstraction has 54730 states and 204728 transitions. [2019-12-07 18:21:40,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:40,716 INFO L276 IsEmpty]: Start isEmpty. Operand 54730 states and 204728 transitions. [2019-12-07 18:21:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:21:40,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:40,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:40,728 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:40,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:40,728 INFO L82 PathProgramCache]: Analyzing trace with hash 916890148, now seen corresponding path program 1 times [2019-12-07 18:21:40,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:40,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974842332] [2019-12-07 18:21:40,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:40,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:40,774 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 18:21:40,774 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974842332] [2019-12-07 18:21:40,774 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:40,774 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:40,775 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381857797] [2019-12-07 18:21:40,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:21:40,775 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:40,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:21:40,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:21:40,775 INFO L87 Difference]: Start difference. First operand 54730 states and 204728 transitions. Second operand 4 states. [2019-12-07 18:21:40,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:40,895 INFO L93 Difference]: Finished difference Result 32666 states and 106197 transitions. [2019-12-07 18:21:40,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:21:40,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-07 18:21:40,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:40,946 INFO L225 Difference]: With dead ends: 32666 [2019-12-07 18:21:40,946 INFO L226 Difference]: Without dead ends: 30386 [2019-12-07 18:21:40,946 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 18:21:41,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30386 states. [2019-12-07 18:21:41,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30386 to 30386. [2019-12-07 18:21:41,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30386 states. [2019-12-07 18:21:41,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30386 states to 30386 states and 98664 transitions. [2019-12-07 18:21:41,426 INFO L78 Accepts]: Start accepts. Automaton has 30386 states and 98664 transitions. Word has length 20 [2019-12-07 18:21:41,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:41,426 INFO L462 AbstractCegarLoop]: Abstraction has 30386 states and 98664 transitions. [2019-12-07 18:21:41,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:21:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 30386 states and 98664 transitions. [2019-12-07 18:21:41,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:21:41,433 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:41,433 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:41,433 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:41,433 INFO L82 PathProgramCache]: Analyzing trace with hash -385683241, now seen corresponding path program 1 times [2019-12-07 18:21:41,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:41,433 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142461833] [2019-12-07 18:21:41,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:41,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:41,479 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 18:21:41,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142461833] [2019-12-07 18:21:41,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:41,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:21:41,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129163865] [2019-12-07 18:21:41,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:21:41,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:41,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:21:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:21:41,481 INFO L87 Difference]: Start difference. First operand 30386 states and 98664 transitions. Second operand 5 states. [2019-12-07 18:21:41,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:41,523 INFO L93 Difference]: Finished difference Result 5545 states and 15258 transitions. [2019-12-07 18:21:41,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:21:41,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 18:21:41,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:41,527 INFO L225 Difference]: With dead ends: 5545 [2019-12-07 18:21:41,528 INFO L226 Difference]: Without dead ends: 4300 [2019-12-07 18:21:41,528 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 18:21:41,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4300 states. [2019-12-07 18:21:41,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4300 to 4252. [2019-12-07 18:21:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4252 states. [2019-12-07 18:21:41,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4252 states to 4252 states and 11137 transitions. [2019-12-07 18:21:41,569 INFO L78 Accepts]: Start accepts. Automaton has 4252 states and 11137 transitions. Word has length 21 [2019-12-07 18:21:41,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:41,569 INFO L462 AbstractCegarLoop]: Abstraction has 4252 states and 11137 transitions. [2019-12-07 18:21:41,569 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:21:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 4252 states and 11137 transitions. [2019-12-07 18:21:41,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:21:41,572 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:41,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:41,572 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:41,573 INFO L82 PathProgramCache]: Analyzing trace with hash 849569807, now seen corresponding path program 1 times [2019-12-07 18:21:41,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:41,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059091560] [2019-12-07 18:21:41,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:41,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:41,641 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 18:21:41,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059091560] [2019-12-07 18:21:41,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:41,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:21:41,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188344131] [2019-12-07 18:21:41,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:21:41,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:41,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:21:41,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:41,643 INFO L87 Difference]: Start difference. First operand 4252 states and 11137 transitions. Second operand 6 states. [2019-12-07 18:21:41,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:41,879 INFO L93 Difference]: Finished difference Result 5485 states and 14002 transitions. [2019-12-07 18:21:41,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:21:41,880 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 18:21:41,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:41,884 INFO L225 Difference]: With dead ends: 5485 [2019-12-07 18:21:41,885 INFO L226 Difference]: Without dead ends: 5437 [2019-12-07 18:21:41,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:21:41,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5437 states. [2019-12-07 18:21:41,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5437 to 4351. [2019-12-07 18:21:41,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4351 states. [2019-12-07 18:21:41,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4351 states to 4351 states and 11378 transitions. [2019-12-07 18:21:41,931 INFO L78 Accepts]: Start accepts. Automaton has 4351 states and 11378 transitions. Word has length 27 [2019-12-07 18:21:41,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:41,931 INFO L462 AbstractCegarLoop]: Abstraction has 4351 states and 11378 transitions. [2019-12-07 18:21:41,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:21:41,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4351 states and 11378 transitions. [2019-12-07 18:21:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:21:41,934 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:41,934 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:41,934 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:41,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1399306623, now seen corresponding path program 1 times [2019-12-07 18:21:41,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:41,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660792290] [2019-12-07 18:21:41,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:41,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:41,958 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 18:21:41,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660792290] [2019-12-07 18:21:41,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:41,959 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:41,959 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085921681] [2019-12-07 18:21:41,959 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:41,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:41,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:41,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:41,960 INFO L87 Difference]: Start difference. First operand 4351 states and 11378 transitions. Second operand 3 states. [2019-12-07 18:21:41,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:41,987 INFO L93 Difference]: Finished difference Result 5219 states and 13168 transitions. [2019-12-07 18:21:41,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:41,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:21:41,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:41,992 INFO L225 Difference]: With dead ends: 5219 [2019-12-07 18:21:41,992 INFO L226 Difference]: Without dead ends: 5219 [2019-12-07 18:21:41,992 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 18:21:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-07 18:21:42,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4335. [2019-12-07 18:21:42,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4335 states. [2019-12-07 18:21:42,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4335 states to 4335 states and 11088 transitions. [2019-12-07 18:21:42,038 INFO L78 Accepts]: Start accepts. Automaton has 4335 states and 11088 transitions. Word has length 27 [2019-12-07 18:21:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:42,039 INFO L462 AbstractCegarLoop]: Abstraction has 4335 states and 11088 transitions. [2019-12-07 18:21:42,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4335 states and 11088 transitions. [2019-12-07 18:21:42,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:21:42,042 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:42,042 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:42,042 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:42,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:42,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1834461847, now seen corresponding path program 1 times [2019-12-07 18:21:42,042 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:42,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281357879] [2019-12-07 18:21:42,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:42,103 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 18:21:42,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281357879] [2019-12-07 18:21:42,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:42,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:21:42,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151016204] [2019-12-07 18:21:42,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:21:42,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:42,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:21:42,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:42,104 INFO L87 Difference]: Start difference. First operand 4335 states and 11088 transitions. Second operand 6 states. [2019-12-07 18:21:42,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:42,421 INFO L93 Difference]: Finished difference Result 7824 states and 19768 transitions. [2019-12-07 18:21:42,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:21:42,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-07 18:21:42,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:42,428 INFO L225 Difference]: With dead ends: 7824 [2019-12-07 18:21:42,428 INFO L226 Difference]: Without dead ends: 7766 [2019-12-07 18:21:42,428 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:21:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-12-07 18:21:42,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 4183. [2019-12-07 18:21:42,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4183 states. [2019-12-07 18:21:42,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4183 states to 4183 states and 10699 transitions. [2019-12-07 18:21:42,482 INFO L78 Accepts]: Start accepts. Automaton has 4183 states and 10699 transitions. Word has length 28 [2019-12-07 18:21:42,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:42,482 INFO L462 AbstractCegarLoop]: Abstraction has 4183 states and 10699 transitions. [2019-12-07 18:21:42,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:21:42,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4183 states and 10699 transitions. [2019-12-07 18:21:42,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 18:21:42,485 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:42,485 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] [2019-12-07 18:21:42,485 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:42,486 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:42,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1865234292, now seen corresponding path program 1 times [2019-12-07 18:21:42,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:42,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030202617] [2019-12-07 18:21:42,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:42,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:42,541 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 18:21:42,541 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030202617] [2019-12-07 18:21:42,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:42,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:21:42,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161087870] [2019-12-07 18:21:42,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:21:42,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:42,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:21:42,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:42,542 INFO L87 Difference]: Start difference. First operand 4183 states and 10699 transitions. Second operand 6 states. [2019-12-07 18:21:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:42,596 INFO L93 Difference]: Finished difference Result 2573 states and 6950 transitions. [2019-12-07 18:21:42,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:21:42,596 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2019-12-07 18:21:42,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:42,599 INFO L225 Difference]: With dead ends: 2573 [2019-12-07 18:21:42,599 INFO L226 Difference]: Without dead ends: 2464 [2019-12-07 18:21:42,600 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 18:21:42,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-12-07 18:21:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 2464. [2019-12-07 18:21:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2464 states. [2019-12-07 18:21:42,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2464 states to 2464 states and 6706 transitions. [2019-12-07 18:21:42,632 INFO L78 Accepts]: Start accepts. Automaton has 2464 states and 6706 transitions. Word has length 32 [2019-12-07 18:21:42,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:42,633 INFO L462 AbstractCegarLoop]: Abstraction has 2464 states and 6706 transitions. [2019-12-07 18:21:42,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:21:42,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2464 states and 6706 transitions. [2019-12-07 18:21:42,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:21:42,636 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:42,637 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] [2019-12-07 18:21:42,637 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:42,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:42,637 INFO L82 PathProgramCache]: Analyzing trace with hash 920348685, now seen corresponding path program 1 times [2019-12-07 18:21:42,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:42,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738942345] [2019-12-07 18:21:42,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:42,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:21:42,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738942345] [2019-12-07 18:21:42,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:42,666 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:42,666 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301472136] [2019-12-07 18:21:42,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:42,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:42,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:42,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:42,667 INFO L87 Difference]: Start difference. First operand 2464 states and 6706 transitions. Second operand 3 states. [2019-12-07 18:21:42,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:42,797 INFO L93 Difference]: Finished difference Result 3224 states and 8738 transitions. [2019-12-07 18:21:42,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:42,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 18:21:42,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:42,801 INFO L225 Difference]: With dead ends: 3224 [2019-12-07 18:21:42,801 INFO L226 Difference]: Without dead ends: 3224 [2019-12-07 18:21:42,801 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 18:21:42,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3224 states. [2019-12-07 18:21:42,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3224 to 2744. [2019-12-07 18:21:42,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2744 states. [2019-12-07 18:21:42,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2744 states to 2744 states and 7458 transitions. [2019-12-07 18:21:42,829 INFO L78 Accepts]: Start accepts. Automaton has 2744 states and 7458 transitions. Word has length 57 [2019-12-07 18:21:42,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:42,829 INFO L462 AbstractCegarLoop]: Abstraction has 2744 states and 7458 transitions. [2019-12-07 18:21:42,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:42,829 INFO L276 IsEmpty]: Start isEmpty. Operand 2744 states and 7458 transitions. [2019-12-07 18:21:42,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:21:42,832 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:42,833 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] [2019-12-07 18:21:42,833 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:42,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:42,833 INFO L82 PathProgramCache]: Analyzing trace with hash -2004340659, now seen corresponding path program 2 times [2019-12-07 18:21:42,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:42,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682213917] [2019-12-07 18:21:42,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:42,875 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 18:21:42,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682213917] [2019-12-07 18:21:42,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:42,876 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:21:42,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205508835] [2019-12-07 18:21:42,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:42,876 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:42,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:42,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:42,877 INFO L87 Difference]: Start difference. First operand 2744 states and 7458 transitions. Second operand 3 states. [2019-12-07 18:21:42,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:42,932 INFO L93 Difference]: Finished difference Result 3078 states and 8141 transitions. [2019-12-07 18:21:42,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:42,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-07 18:21:42,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:42,935 INFO L225 Difference]: With dead ends: 3078 [2019-12-07 18:21:42,935 INFO L226 Difference]: Without dead ends: 3078 [2019-12-07 18:21:42,936 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:42,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-12-07 18:21:42,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 2570. [2019-12-07 18:21:42,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2570 states. [2019-12-07 18:21:42,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 6869 transitions. [2019-12-07 18:21:42,963 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 6869 transitions. Word has length 57 [2019-12-07 18:21:42,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:42,963 INFO L462 AbstractCegarLoop]: Abstraction has 2570 states and 6869 transitions. [2019-12-07 18:21:42,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:42,963 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 6869 transitions. [2019-12-07 18:21:42,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-07 18:21:42,966 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:42,967 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] [2019-12-07 18:21:42,967 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:42,967 INFO L82 PathProgramCache]: Analyzing trace with hash -320339371, now seen corresponding path program 1 times [2019-12-07 18:21:42,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:42,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710505763] [2019-12-07 18:21:42,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:43,010 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 18:21:43,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710505763] [2019-12-07 18:21:43,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:43,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:21:43,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358488035] [2019-12-07 18:21:43,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:21:43,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:43,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:21:43,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:21:43,012 INFO L87 Difference]: Start difference. First operand 2570 states and 6869 transitions. Second operand 3 states. [2019-12-07 18:21:43,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:43,022 INFO L93 Difference]: Finished difference Result 2569 states and 6867 transitions. [2019-12-07 18:21:43,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:21:43,023 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-07 18:21:43,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:43,025 INFO L225 Difference]: With dead ends: 2569 [2019-12-07 18:21:43,025 INFO L226 Difference]: Without dead ends: 2569 [2019-12-07 18:21:43,026 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 18:21:43,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2569 states. [2019-12-07 18:21:43,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2569 to 2569. [2019-12-07 18:21:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2569 states. [2019-12-07 18:21:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2569 states to 2569 states and 6867 transitions. [2019-12-07 18:21:43,051 INFO L78 Accepts]: Start accepts. Automaton has 2569 states and 6867 transitions. Word has length 58 [2019-12-07 18:21:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:43,052 INFO L462 AbstractCegarLoop]: Abstraction has 2569 states and 6867 transitions. [2019-12-07 18:21:43,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:21:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2569 states and 6867 transitions. [2019-12-07 18:21:43,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:21:43,055 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:43,055 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:21:43,055 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:43,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:43,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1355522643, now seen corresponding path program 1 times [2019-12-07 18:21:43,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:43,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365211221] [2019-12-07 18:21:43,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:43,166 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 18:21:43,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365211221] [2019-12-07 18:21:43,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:43,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:21:43,167 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680842839] [2019-12-07 18:21:43,167 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:21:43,167 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:43,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:21:43,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:21:43,168 INFO L87 Difference]: Start difference. First operand 2569 states and 6867 transitions. Second operand 6 states. [2019-12-07 18:21:43,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:43,231 INFO L93 Difference]: Finished difference Result 4026 states and 9985 transitions. [2019-12-07 18:21:43,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:21:43,232 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-07 18:21:43,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:43,233 INFO L225 Difference]: With dead ends: 4026 [2019-12-07 18:21:43,233 INFO L226 Difference]: Without dead ends: 1494 [2019-12-07 18:21:43,234 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:21:43,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1494 states. [2019-12-07 18:21:43,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1494 to 1494. [2019-12-07 18:21:43,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1494 states. [2019-12-07 18:21:43,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1494 states to 1494 states and 3405 transitions. [2019-12-07 18:21:43,247 INFO L78 Accepts]: Start accepts. Automaton has 1494 states and 3405 transitions. Word has length 59 [2019-12-07 18:21:43,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:43,247 INFO L462 AbstractCegarLoop]: Abstraction has 1494 states and 3405 transitions. [2019-12-07 18:21:43,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:21:43,247 INFO L276 IsEmpty]: Start isEmpty. Operand 1494 states and 3405 transitions. [2019-12-07 18:21:43,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:21:43,249 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:43,249 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] [2019-12-07 18:21:43,249 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:43,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:43,250 INFO L82 PathProgramCache]: Analyzing trace with hash 337340211, now seen corresponding path program 2 times [2019-12-07 18:21:43,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:43,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [405178388] [2019-12-07 18:21:43,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:43,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:43,699 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 18:21:43,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [405178388] [2019-12-07 18:21:43,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:43,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 18:21:43,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549640802] [2019-12-07 18:21:43,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:21:43,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:43,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:21:43,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=365, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:21:43,701 INFO L87 Difference]: Start difference. First operand 1494 states and 3405 transitions. Second operand 21 states. [2019-12-07 18:21:46,358 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 32 [2019-12-07 18:21:46,581 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2019-12-07 18:21:46,928 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 18:21:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:47,737 INFO L93 Difference]: Finished difference Result 2746 states and 5931 transitions. [2019-12-07 18:21:47,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-07 18:21:47,737 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-12-07 18:21:47,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:47,739 INFO L225 Difference]: With dead ends: 2746 [2019-12-07 18:21:47,739 INFO L226 Difference]: Without dead ends: 2437 [2019-12-07 18:21:47,740 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=331, Invalid=1925, Unknown=0, NotChecked=0, Total=2256 [2019-12-07 18:21:47,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-12-07 18:21:47,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 1719. [2019-12-07 18:21:47,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-12-07 18:21:47,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 3848 transitions. [2019-12-07 18:21:47,756 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 3848 transitions. Word has length 59 [2019-12-07 18:21:47,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:47,756 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 3848 transitions. [2019-12-07 18:21:47,756 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:21:47,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 3848 transitions. [2019-12-07 18:21:47,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:21:47,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:47,758 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] [2019-12-07 18:21:47,758 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:47,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:47,758 INFO L82 PathProgramCache]: Analyzing trace with hash -174817831, now seen corresponding path program 3 times [2019-12-07 18:21:47,758 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:47,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146210464] [2019-12-07 18:21:47,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:48,256 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 18:21:48,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146210464] [2019-12-07 18:21:48,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:48,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-12-07 18:21:48,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697932916] [2019-12-07 18:21:48,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-07 18:21:48,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:48,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-07 18:21:48,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-12-07 18:21:48,257 INFO L87 Difference]: Start difference. First operand 1719 states and 3848 transitions. Second operand 21 states. [2019-12-07 18:21:51,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:21:51,553 INFO L93 Difference]: Finished difference Result 2708 states and 5906 transitions. [2019-12-07 18:21:51,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-12-07 18:21:51,553 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 59 [2019-12-07 18:21:51,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:21:51,555 INFO L225 Difference]: With dead ends: 2708 [2019-12-07 18:21:51,555 INFO L226 Difference]: Without dead ends: 2558 [2019-12-07 18:21:51,556 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=291, Invalid=1779, Unknown=0, NotChecked=0, Total=2070 [2019-12-07 18:21:51,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2558 states. [2019-12-07 18:21:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2558 to 1751. [2019-12-07 18:21:51,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1751 states. [2019-12-07 18:21:51,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 3908 transitions. [2019-12-07 18:21:51,572 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 3908 transitions. Word has length 59 [2019-12-07 18:21:51,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:21:51,572 INFO L462 AbstractCegarLoop]: Abstraction has 1751 states and 3908 transitions. [2019-12-07 18:21:51,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-07 18:21:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 3908 transitions. [2019-12-07 18:21:51,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:21:51,574 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:21:51,574 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] [2019-12-07 18:21:51,574 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:21:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:21:51,575 INFO L82 PathProgramCache]: Analyzing trace with hash 360507453, now seen corresponding path program 4 times [2019-12-07 18:21:51,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:21:51,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064893473] [2019-12-07 18:21:51,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:21:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:21:52,426 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 18:21:52,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064893473] [2019-12-07 18:21:52,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:21:52,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-12-07 18:21:52,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318157185] [2019-12-07 18:21:52,427 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-07 18:21:52,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:21:52,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-07 18:21:52,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=583, Unknown=0, NotChecked=0, Total=650 [2019-12-07 18:21:52,428 INFO L87 Difference]: Start difference. First operand 1751 states and 3908 transitions. Second operand 26 states. [2019-12-07 18:21:53,243 WARN L192 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 32 [2019-12-07 18:21:54,121 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 36 DAG size of output: 31 [2019-12-07 18:21:56,436 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 28 [2019-12-07 18:21:57,561 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-12-07 18:22:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:00,993 INFO L93 Difference]: Finished difference Result 3063 states and 6770 transitions. [2019-12-07 18:22:00,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2019-12-07 18:22:00,993 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 59 [2019-12-07 18:22:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:00,995 INFO L225 Difference]: With dead ends: 3063 [2019-12-07 18:22:00,995 INFO L226 Difference]: Without dead ends: 3005 [2019-12-07 18:22:00,996 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1054 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=551, Invalid=4279, Unknown=0, NotChecked=0, Total=4830 [2019-12-07 18:22:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2019-12-07 18:22:01,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 1843. [2019-12-07 18:22:01,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-12-07 18:22:01,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 4084 transitions. [2019-12-07 18:22:01,015 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 4084 transitions. Word has length 59 [2019-12-07 18:22:01,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:01,015 INFO L462 AbstractCegarLoop]: Abstraction has 1843 states and 4084 transitions. [2019-12-07 18:22:01,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-07 18:22:01,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 4084 transitions. [2019-12-07 18:22:01,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:22:01,017 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:01,017 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] [2019-12-07 18:22:01,018 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:01,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:01,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2068694909, now seen corresponding path program 5 times [2019-12-07 18:22:01,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:01,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562018070] [2019-12-07 18:22:01,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:01,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:01,265 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 18:22:01,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562018070] [2019-12-07 18:22:01,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:01,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 18:22:01,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749039010] [2019-12-07 18:22:01,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 18:22:01,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 18:22:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=207, Unknown=0, NotChecked=0, Total=240 [2019-12-07 18:22:01,266 INFO L87 Difference]: Start difference. First operand 1843 states and 4084 transitions. Second operand 16 states. [2019-12-07 18:22:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:04,256 INFO L93 Difference]: Finished difference Result 3096 states and 6808 transitions. [2019-12-07 18:22:04,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 18:22:04,258 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2019-12-07 18:22:04,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:04,263 INFO L225 Difference]: With dead ends: 3096 [2019-12-07 18:22:04,263 INFO L226 Difference]: Without dead ends: 2862 [2019-12-07 18:22:04,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=162, Invalid=960, Unknown=0, NotChecked=0, Total=1122 [2019-12-07 18:22:04,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2019-12-07 18:22:04,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2219. [2019-12-07 18:22:04,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2219 states. [2019-12-07 18:22:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2219 states to 2219 states and 4913 transitions. [2019-12-07 18:22:04,301 INFO L78 Accepts]: Start accepts. Automaton has 2219 states and 4913 transitions. Word has length 59 [2019-12-07 18:22:04,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:04,301 INFO L462 AbstractCegarLoop]: Abstraction has 2219 states and 4913 transitions. [2019-12-07 18:22:04,301 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 18:22:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2219 states and 4913 transitions. [2019-12-07 18:22:04,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:22:04,303 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:04,303 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] [2019-12-07 18:22:04,304 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:04,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:04,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1165662345, now seen corresponding path program 6 times [2019-12-07 18:22:04,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:04,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549257808] [2019-12-07 18:22:04,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:04,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:22:04,371 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 18:22:04,371 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549257808] [2019-12-07 18:22:04,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:22:04,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:22:04,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713939838] [2019-12-07 18:22:04,372 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:22:04,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:22:04,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:22:04,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:22:04,372 INFO L87 Difference]: Start difference. First operand 2219 states and 4913 transitions. Second operand 7 states. [2019-12-07 18:22:04,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:22:04,421 INFO L93 Difference]: Finished difference Result 2405 states and 5270 transitions. [2019-12-07 18:22:04,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:22:04,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 59 [2019-12-07 18:22:04,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:22:04,422 INFO L225 Difference]: With dead ends: 2405 [2019-12-07 18:22:04,422 INFO L226 Difference]: Without dead ends: 248 [2019-12-07 18:22:04,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:22:04,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2019-12-07 18:22:04,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 248. [2019-12-07 18:22:04,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-12-07 18:22:04,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 446 transitions. [2019-12-07 18:22:04,425 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 446 transitions. Word has length 59 [2019-12-07 18:22:04,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:22:04,426 INFO L462 AbstractCegarLoop]: Abstraction has 248 states and 446 transitions. [2019-12-07 18:22:04,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:22:04,426 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 446 transitions. [2019-12-07 18:22:04,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 18:22:04,427 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:22:04,427 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] [2019-12-07 18:22:04,427 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:22:04,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:22:04,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1947312003, now seen corresponding path program 7 times [2019-12-07 18:22:04,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:22:04,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273468792] [2019-12-07 18:22:04,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:22:04,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:04,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:22:04,528 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:22:04,528 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:22:04,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1180] [1180] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse1 (store |v_#valid_78| 0 0))) (let ((.cse0 (store .cse1 |v_~#y~0.base_164| 1))) (and (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8) (< 0 |v_#StackHeapBarrier_25|) (= v_~z~0_24 0) (= 0 v_~y$r_buff1_thd2~0_265) (= 0 v_~__unbuffered_cnt~0_71) (= v_~y$r_buff1_thd0~0_314 0) (= |v_#length_37| (store (store |v_#length_39| |v_~#y~0.base_164| 4) |v_ULTIMATE.start_main_~#t1940~0.base_22| 4)) (= 0 v_~__unbuffered_p2_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p2_EAX$w_buff1~0_7) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_298| (store |v_#memory_int_299| |v_ULTIMATE.start_main_~#t1940~0.base_22| (store (select |v_#memory_int_299| |v_ULTIMATE.start_main_~#t1940~0.base_22|) |v_ULTIMATE.start_main_~#t1940~0.offset_17| 0))) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45) (= v_~y$mem_tmp~0_15 0) (= 0 v_~__unbuffered_p2_EAX$mem_tmp~0_8) (= 0 v_~weak$$choice1~0_99) (= 0 v_~y$r_buff0_thd2~0_413) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd1~0_225 0) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1940~0.base_22|) 0) (= 0 |v_#NULL.base_5|) (= v_~main$tmp_guard0~0_51 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_1532) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1940~0.base_22| 1)) (= 0 v_~y$r_buff0_thd3~0_885) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7) (= v_~y$r_buff0_thd0~0_245 0) (= 0 |v_~#y~0.offset_164|) (= 0 v_~y$w_buff1_used~0_1325) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7) (= v_~y$w_buff1~0_855 0) (= 0 v_~__unbuffered_p2_EAX$w_buff1_used~0_7) (= v_~main$tmp_guard1~0_30 0) (= v_~y$w_buff0_used~0_2077 0) (= 0 v_~weak$$choice0~0_215) (= v_~weak$$choice2~0_122 0) (= (select .cse1 |v_~#y~0.base_164|) 0) (= 0 v_~__unbuffered_p2_EAX$flush_delayed~0_8) (= v_~y$r_buff0_thd1~0_140 0) (= 0 v_~y$r_buff1_thd3~0_805) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 0) (< |v_#StackHeapBarrier_25| |v_~#y~0.base_164|) (= v_~__unbuffered_p1_EAX~0_749 0) (= |v_ULTIMATE.start_main_~#t1940~0.offset_17| 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$flush_delayed~0_26) (= 0 v_~__unbuffered_p2_EAX$w_buff0~0_8) (= 0 v_~x~0_741) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8) (= (select (select |v_#memory_int_299| |v_~#y~0.base_164|) |v_~#y~0.offset_164|) 0) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t1940~0.base_22|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_299|, #length=|v_#length_39|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_65|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45, ULTIMATE.start_main_~#t1941~0.offset=|v_ULTIMATE.start_main_~#t1941~0.offset_15|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_83|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_86|, ~weak$$choice1~0=v_~weak$$choice1~0_99, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_805, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_749, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_140, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~__unbuffered_p2_EAX$w_buff0_used~0=v_~__unbuffered_p2_EAX$w_buff0_used~0_7, #length=|v_#length_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~__unbuffered_p2_EAX$r_buff1_thd2~0=v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7, ULTIMATE.start_main_~#t1942~0.base=|v_ULTIMATE.start_main_~#t1942~0.base_19|, ~__unbuffered_p2_EAX$r_buff0_thd0~0=v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_35|, ~__unbuffered_p2_EAX$w_buff0~0=v_~__unbuffered_p2_EAX$w_buff0~0_8, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_22|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_7|, ULTIMATE.start_main_~#t1941~0.base=|v_ULTIMATE.start_main_~#t1941~0.base_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_55|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_85|, ULTIMATE.start_main_~#t1940~0.base=|v_ULTIMATE.start_main_~#t1940~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_215, #StackHeapBarrier=|v_#StackHeapBarrier_25|, ~y$w_buff1~0=v_~y$w_buff1~0_855, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_413, ~__unbuffered_p2_EAX$r_buff0_thd1~0=v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_741, ~__unbuffered_p2_EAX$r_buff1_thd3~0=v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8, ~__unbuffered_p2_EAX$w_buff1~0=v_~__unbuffered_p2_EAX$w_buff1~0_7, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~#y~0.offset=|v_~#y~0.offset_164|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_2077, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~#y~0.base=|v_~#y~0.base_164|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_225, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_59|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_141|, ~__unbuffered_p2_EAX$w_buff1_used~0=v_~__unbuffered_p2_EAX$w_buff1_used~0_7, ULTIMATE.start_main_~#t1940~0.offset=|v_ULTIMATE.start_main_~#t1940~0.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_1532, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_885, ~__unbuffered_p2_EAX$r_buff0_thd2~0=v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7, ~__unbuffered_p2_EAX$r_buff1_thd0~0=v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8, ULTIMATE.start_main_~#t1942~0.offset=|v_ULTIMATE.start_main_~#t1942~0.offset_15|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_7|, ~__unbuffered_p2_EAX$mem_tmp~0=v_~__unbuffered_p2_EAX$mem_tmp~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_51, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_42|, ~__unbuffered_p2_EAX$flush_delayed~0=v_~__unbuffered_p2_EAX$flush_delayed~0_8, #NULL.base=|v_#NULL.base_5|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_245, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_298|, ~__unbuffered_p2_EAX$r_buff1_thd1~0=v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7, ~__unbuffered_p2_EAX$r_buff0_thd3~0=v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_122, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_90|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_1325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ULTIMATE.start_main_~#t1941~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~weak$$choice1~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, ~__unbuffered_p2_EAX$w_buff0_used~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EAX$r_buff1_thd2~0, ULTIMATE.start_main_~#t1942~0.base, ~__unbuffered_p2_EAX$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem77, ~__unbuffered_p2_EAX$w_buff0~0, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~nondet66, ULTIMATE.start_main_~#t1941~0.base, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1940~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd1~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~__unbuffered_p2_EAX$r_buff1_thd3~0, ~__unbuffered_p2_EAX$w_buff1~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~__unbuffered_p2_EAX$w_buff1_used~0, ULTIMATE.start_main_~#t1940~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff1_thd0~0, ULTIMATE.start_main_~#t1942~0.offset, ULTIMATE.start_main_#t~nondet67, ~__unbuffered_p2_EAX$mem_tmp~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, ~__unbuffered_p2_EAX$flush_delayed~0, #NULL.base, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p2_EAX$r_buff1_thd1~0, ~__unbuffered_p2_EAX$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_#t~mem69, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:22:04,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L837-1-->L839: Formula: (and (= |v_#memory_int_213| (store |v_#memory_int_214| |v_ULTIMATE.start_main_~#t1941~0.base_12| (store (select |v_#memory_int_214| |v_ULTIMATE.start_main_~#t1941~0.base_12|) |v_ULTIMATE.start_main_~#t1941~0.offset_10| 1))) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1941~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t1941~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1941~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1941~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t1941~0.base_12| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1941~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_214|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_4|, #memory_int=|v_#memory_int_213|, ULTIMATE.start_main_~#t1941~0.offset=|v_ULTIMATE.start_main_~#t1941~0.offset_10|, ULTIMATE.start_main_~#t1941~0.base=|v_ULTIMATE.start_main_~#t1941~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet66, #memory_int, ULTIMATE.start_main_~#t1941~0.offset, ULTIMATE.start_main_~#t1941~0.base, #length] because there is no mapped edge [2019-12-07 18:22:04,533 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1124] [1124] L839-1-->L841: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1942~0.base_10| 1)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1942~0.base_10| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1942~0.base_10|) |v_ULTIMATE.start_main_~#t1942~0.offset_9| 2)) |v_#memory_int_167|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1942~0.base_10| 4)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1942~0.base_10|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1942~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1942~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1942~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_168|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1942~0.offset=|v_ULTIMATE.start_main_~#t1942~0.offset_9|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_167|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1942~0.base=|v_ULTIMATE.start_main_~#t1942~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1942~0.offset, ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1942~0.base] because there is no mapped edge [2019-12-07 18:22:04,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1147] [1147] L799-->L799-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1281840366 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out1281840366| ~y$w_buff1~0_In1281840366) (= |P2Thread1of1ForFork2_#t~ite33_In1281840366| |P2Thread1of1ForFork2_#t~ite33_Out1281840366|)) (and (= (mod ~y$w_buff0_used~0_In1281840366 256) 0) .cse0 (= |P2Thread1of1ForFork2_#t~ite33_Out1281840366| ~y$w_buff1~0_In1281840366) (= |P2Thread1of1ForFork2_#t~ite34_Out1281840366| |P2Thread1of1ForFork2_#t~ite33_Out1281840366|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1281840366, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1281840366, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_In1281840366|, ~weak$$choice2~0=~weak$$choice2~0_In1281840366} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1281840366|, ~y$w_buff1~0=~y$w_buff1~0_In1281840366, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1281840366, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1281840366|, ~weak$$choice2~0=~weak$$choice2~0_In1281840366} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34, P2Thread1of1ForFork2_#t~ite33] because there is no mapped edge [2019-12-07 18:22:04,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1148] [1148] L801-->L801-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In540070520 256) 0))) (or (and (= (mod ~y$w_buff0_used~0_In540070520 256) 0) (= |P2Thread1of1ForFork2_#t~ite44_Out540070520| |P2Thread1of1ForFork2_#t~ite43_Out540070520|) .cse0 (= ~y$w_buff1_used~0_In540070520 |P2Thread1of1ForFork2_#t~ite43_Out540070520|)) (and (= |P2Thread1of1ForFork2_#t~ite43_In540070520| |P2Thread1of1ForFork2_#t~ite43_Out540070520|) (= |P2Thread1of1ForFork2_#t~ite44_Out540070520| ~y$w_buff1_used~0_In540070520) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In540070520, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_In540070520|, ~weak$$choice2~0=~weak$$choice2~0_In540070520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540070520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In540070520, P2Thread1of1ForFork2_#t~ite44=|P2Thread1of1ForFork2_#t~ite44_Out540070520|, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out540070520|, ~weak$$choice2~0=~weak$$choice2~0_In540070520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540070520} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite44, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 18:22:04,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L802-->L803: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_33 256))) (= v_~y$r_buff0_thd3~0_255 v_~y$r_buff0_thd3~0_254)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_255, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P2Thread1of1ForFork2_#t~ite46=|v_P2Thread1of1ForFork2_#t~ite46_13|, P2Thread1of1ForFork2_#t~ite45=|v_P2Thread1of1ForFork2_#t~ite45_12|, P2Thread1of1ForFork2_#t~ite48=|v_P2Thread1of1ForFork2_#t~ite48_9|, P2Thread1of1ForFork2_#t~ite47=|v_P2Thread1of1ForFork2_#t~ite47_12|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_33, P2Thread1of1ForFork2_#t~ite49=|v_P2Thread1of1ForFork2_#t~ite49_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite46, P2Thread1of1ForFork2_#t~ite45, P2Thread1of1ForFork2_#t~ite48, P2Thread1of1ForFork2_#t~ite47, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite49] because there is no mapped edge [2019-12-07 18:22:04,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L807-->L814: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= |v_#memory_int_99| (store |v_#memory_int_100| |v_~#y~0.base_59| (store (select |v_#memory_int_100| |v_~#y~0.base_59|) |v_~#y~0.offset_59| v_~y$mem_tmp~0_7))) (= v_~z~0_10 1) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, #memory_int=|v_#memory_int_100|, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~#y~0.base=|v_~#y~0.base_59|} OutVars{P2Thread1of1ForFork2_#t~ite58=|v_P2Thread1of1ForFork2_#t~ite58_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, P2Thread1of1ForFork2_#t~mem57=|v_P2Thread1of1ForFork2_#t~mem57_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, #memory_int=|v_#memory_int_99|, ~z~0=v_~z~0_10, ~#y~0.base=|v_~#y~0.base_59|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58, P2Thread1of1ForFork2_#t~mem57, ~y$flush_delayed~0, #memory_int, ~z~0] because there is no mapped edge [2019-12-07 18:22:04,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1107] [1107] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~z~0_16 v_~__unbuffered_p0_EAX~0_21) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= 1 v_~x~0_275)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~z~0=v_~z~0_16} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~z~0=v_~z~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, ~x~0=v_~x~0_275, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 18:22:04,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L814-2-->L814-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite61_Out-1880879688| |P2Thread1of1ForFork2_#t~ite60_Out-1880879688|)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1880879688 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1880879688 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~mem59_Out-1880879688| (select (select |#memory_int_In-1880879688| |~#y~0.base_In-1880879688|) |~#y~0.offset_In-1880879688|)) .cse2 (= |P2Thread1of1ForFork2_#t~mem59_Out-1880879688| |P2Thread1of1ForFork2_#t~ite60_Out-1880879688|)) (and .cse2 (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~mem59_In-1880879688| |P2Thread1of1ForFork2_#t~mem59_Out-1880879688|) (= ~y$w_buff1~0_In-1880879688 |P2Thread1of1ForFork2_#t~ite60_Out-1880879688|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1880879688, ~#y~0.offset=|~#y~0.offset_In-1880879688|, ~y$w_buff1~0=~y$w_buff1~0_In-1880879688, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_In-1880879688|, #memory_int=|#memory_int_In-1880879688|, ~#y~0.base=|~#y~0.base_In-1880879688|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1880879688} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1880879688, ~#y~0.offset=|~#y~0.offset_In-1880879688|, ~y$w_buff1~0=~y$w_buff1~0_In-1880879688, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_Out-1880879688|, P2Thread1of1ForFork2_#t~ite61=|P2Thread1of1ForFork2_#t~ite61_Out-1880879688|, #memory_int=|#memory_int_In-1880879688|, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out-1880879688|, ~#y~0.base=|~#y~0.base_In-1880879688|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1880879688} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~mem59, P2Thread1of1ForFork2_#t~ite61, P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-07 18:22:04,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1088] [1088] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-349729229 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-349729229 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite62_Out-349729229|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-349729229 |P2Thread1of1ForFork2_#t~ite62_Out-349729229|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-349729229, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-349729229} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-349729229, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-349729229, P2Thread1of1ForFork2_#t~ite62=|P2Thread1of1ForFork2_#t~ite62_Out-349729229|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite62] because there is no mapped edge [2019-12-07 18:22:04,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_111| v_P1Thread1of1ForFork1_~arg.offset_109) (= v_~y$w_buff1~0_135 v_~y$w_buff0~0_238) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_111 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_109|) (= v_P1Thread1of1ForFork1_~arg.base_109 |v_P1Thread1of1ForFork1_#in~arg.base_111|) (= 1 v_~y$w_buff0~0_237) (= v_~y$w_buff0_used~0_384 v_~y$w_buff1_used~0_233) (= v_~y$w_buff0_used~0_383 1) (= v_~__unbuffered_p1_EAX~0_111 v_~x~0_115) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_111 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_109| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_233 256) 0)) (not (= (mod v_~y$w_buff0_used~0_383 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_384, ~y$w_buff0~0=v_~y$w_buff0~0_238, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_111, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_109, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_109, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_109|, ~y$w_buff0~0=v_~y$w_buff0~0_237, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:22:04,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1156168985 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1156168985 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite6_Out1156168985|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1156168985 |P1Thread1of1ForFork1_#t~ite6_Out1156168985|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1156168985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1156168985} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1156168985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1156168985, P1Thread1of1ForFork1_#t~ite6=|P1Thread1of1ForFork1_#t~ite6_Out1156168985|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:22:04,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1074] [1074] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2001814826 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2001814826 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2001814826 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2001814826 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite7_Out2001814826| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite7_Out2001814826| ~y$w_buff1_used~0_In2001814826) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2001814826, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2001814826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2001814826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2001814826} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2001814826, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2001814826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2001814826, P1Thread1of1ForFork1_#t~ite7=|P1Thread1of1ForFork1_#t~ite7_Out2001814826|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2001814826} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-07 18:22:04,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1096] [1096] L781-->L782: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out1296962822 ~y$r_buff0_thd2~0_In1296962822)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1296962822 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1296962822 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd2~0_Out1296962822 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1296962822, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1296962822} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1296962822, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1296962822, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1296962822|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 18:22:04,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1880533702 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1880533702 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1880533702 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1880533702 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite9_Out1880533702| ~y$r_buff1_thd2~0_In1880533702)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite9_Out1880533702|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1880533702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1880533702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1880533702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1880533702} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1880533702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1880533702, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1880533702|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1880533702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1880533702} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 18:22:04,544 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1138] [1138] L782-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork1_#t~ite9_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite9, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:22:04,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1400188275 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1400188275 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-1400188275 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1400188275 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite63_Out-1400188275|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1400188275 |P2Thread1of1ForFork2_#t~ite63_Out-1400188275|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1400188275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400188275, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1400188275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400188275} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1400188275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400188275, P2Thread1of1ForFork2_#t~ite63=|P2Thread1of1ForFork2_#t~ite63_Out-1400188275|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1400188275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400188275} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite63] because there is no mapped edge [2019-12-07 18:22:04,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1092] [1092] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-109423356 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-109423356 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-109423356 |P2Thread1of1ForFork2_#t~ite64_Out-109423356|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite64_Out-109423356|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109423356, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109423356} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109423356, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109423356, P2Thread1of1ForFork2_#t~ite64=|P2Thread1of1ForFork2_#t~ite64_Out-109423356|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite64] because there is no mapped edge [2019-12-07 18:22:04,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1083] [1083] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In977604955 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In977604955 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In977604955 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In977604955 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite65_Out977604955| ~y$r_buff1_thd3~0_In977604955) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite65_Out977604955| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In977604955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In977604955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In977604955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In977604955} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In977604955, P2Thread1of1ForFork2_#t~ite65=|P2Thread1of1ForFork2_#t~ite65_Out977604955|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In977604955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In977604955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In977604955} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65] because there is no mapped edge [2019-12-07 18:22:04,546 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1128] [1128] L818-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#t~ite65_20| v_~y$r_buff1_thd3~0_421) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_421, P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_19|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 18:22:04,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L845-->L847-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_10 256) 0)) (or (= (mod v_~y$r_buff0_thd0~0_79 256) 0) (= (mod v_~y$w_buff0_used~0_492 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:22:04,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1087] [1087] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2096518665 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2096518665 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem69_Out2096518665| (select (select |#memory_int_In2096518665| |~#y~0.base_In2096518665|) |~#y~0.offset_In2096518665|)) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~mem69_Out2096518665| |ULTIMATE.start_main_#t~ite70_Out2096518665|)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In2096518665 |ULTIMATE.start_main_#t~ite70_Out2096518665|) (= |ULTIMATE.start_main_#t~mem69_In2096518665| |ULTIMATE.start_main_#t~mem69_Out2096518665|)))) InVars {~#y~0.offset=|~#y~0.offset_In2096518665|, ~y$w_buff1~0=~y$w_buff1~0_In2096518665, #memory_int=|#memory_int_In2096518665|, ~#y~0.base=|~#y~0.base_In2096518665|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2096518665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096518665, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_In2096518665|} OutVars{~#y~0.offset=|~#y~0.offset_In2096518665|, ~y$w_buff1~0=~y$w_buff1~0_In2096518665, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out2096518665|, #memory_int=|#memory_int_In2096518665|, ~#y~0.base=|~#y~0.base_In2096518665|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2096518665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096518665, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_Out2096518665|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-07 18:22:04,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-4-->L848: Formula: (= (store |v_#memory_int_69| |v_~#y~0.base_37| (store (select |v_#memory_int_69| |v_~#y~0.base_37|) |v_~#y~0.offset_37| |v_ULTIMATE.start_main_#t~ite70_13|)) |v_#memory_int_68|) InVars {~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, #memory_int=|v_#memory_int_69|, ~#y~0.base=|v_~#y~0.base_37|} OutVars{ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_12|, #memory_int=|v_#memory_int_68|, ~#y~0.base=|v_~#y~0.base_37|, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite70, #memory_int, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-07 18:22:04,547 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1077] [1077] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-53921203 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-53921203 256) 0))) (or (and (= ~y$w_buff0_used~0_In-53921203 |ULTIMATE.start_main_#t~ite72_Out-53921203|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite72_Out-53921203| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-53921203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53921203} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-53921203|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-53921203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53921203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 18:22:04,548 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-69272350 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-69272350 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-69272350 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-69272350 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite73_Out-69272350|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-69272350 |ULTIMATE.start_main_#t~ite73_Out-69272350|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-69272350, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-69272350, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-69272350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-69272350} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-69272350|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-69272350, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-69272350, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-69272350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-69272350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 18:22:04,549 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1591605282 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1591605282 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite74_Out1591605282|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1591605282 |ULTIMATE.start_main_#t~ite74_Out1591605282|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1591605282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591605282} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1591605282|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591605282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591605282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 18:22:04,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-239866826 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-239866826 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-239866826 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-239866826 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-239866826 |ULTIMATE.start_main_#t~ite75_Out-239866826|)) (and (= 0 |ULTIMATE.start_main_#t~ite75_Out-239866826|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-239866826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239866826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239866826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239866826} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-239866826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239866826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239866826, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out-239866826|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239866826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-07 18:22:04,550 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] L855-->L855-3: Formula: (let ((.cse0 (not (= 0 (mod ~__unbuffered_p2_EAX$read_delayed~0_In-2087250040 256)))) (.cse1 (= (mod ~weak$$choice1~0_In-2087250040 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem77_Out-2087250040| |ULTIMATE.start_main_#t~ite78_Out-2087250040|) .cse0 (= |ULTIMATE.start_main_#t~mem77_Out-2087250040| (select (select |#memory_int_In-2087250040| ~__unbuffered_p2_EAX$read_delayed_var~0.base_In-2087250040) ~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-2087250040)) (not .cse1)) (and .cse0 .cse1 (= ~__unbuffered_p2_EAX~0_In-2087250040 |ULTIMATE.start_main_#t~ite78_Out-2087250040|) (= |ULTIMATE.start_main_#t~mem77_In-2087250040| |ULTIMATE.start_main_#t~mem77_Out-2087250040|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-2087250040, ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_In-2087250040|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-2087250040, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-2087250040, #memory_int=|#memory_int_In-2087250040|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-2087250040, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-2087250040} OutVars{ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_Out-2087250040|, ~weak$$choice1~0=~weak$$choice1~0_In-2087250040, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-2087250040, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-2087250040, #memory_int=|#memory_int_In-2087250040|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-2087250040, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-2087250040|, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-2087250040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 18:22:04,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1141] [1141] L855-3-->L4: Formula: (and (let ((.cse2 (= v_~__unbuffered_p1_EAX~0_540 1)) (.cse3 (= 1 v_~__unbuffered_p2_EAX~0_50)) (.cse0 (= v_~main$tmp_guard1~0_17 1)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite78_30| v_~__unbuffered_p2_EAX~0_50)) (.cse4 (= 1 v_~__unbuffered_p0_EAX~0_26))) (or (and .cse0 .cse1 (not .cse2)) (and (not .cse3) .cse0 .cse1) (and (= v_~main$tmp_guard1~0_17 0) .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 (not .cse4)))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_25|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_34|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite78, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:22:04,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:22:04,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:22:04 BasicIcfg [2019-12-07 18:22:04,617 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:22:04,617 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:22:04,618 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:22:04,618 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:22:04,618 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:21:22" (3/4) ... [2019-12-07 18:22:04,619 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:22:04,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1180] [1180] ULTIMATE.startENTRY-->L837: Formula: (let ((.cse1 (store |v_#valid_78| 0 0))) (let ((.cse0 (store .cse1 |v_~#y~0.base_164| 1))) (and (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8) (< 0 |v_#StackHeapBarrier_25|) (= v_~z~0_24 0) (= 0 v_~y$r_buff1_thd2~0_265) (= 0 v_~__unbuffered_cnt~0_71) (= v_~y$r_buff1_thd0~0_314 0) (= |v_#length_37| (store (store |v_#length_39| |v_~#y~0.base_164| 4) |v_ULTIMATE.start_main_~#t1940~0.base_22| 4)) (= 0 v_~__unbuffered_p2_EAX$w_buff0_used~0_7) (= 0 v_~__unbuffered_p2_EAX$w_buff1~0_7) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7) (= v_~y$read_delayed~0_6 0) (= |v_#memory_int_298| (store |v_#memory_int_299| |v_ULTIMATE.start_main_~#t1940~0.base_22| (store (select |v_#memory_int_299| |v_ULTIMATE.start_main_~#t1940~0.base_22|) |v_ULTIMATE.start_main_~#t1940~0.offset_17| 0))) (= 0 v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45) (= v_~y$mem_tmp~0_15 0) (= 0 v_~__unbuffered_p2_EAX$mem_tmp~0_8) (= 0 v_~weak$$choice1~0_99) (= 0 v_~y$r_buff0_thd2~0_413) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$r_buff1_thd1~0_225 0) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1940~0.base_22|) 0) (= 0 |v_#NULL.base_5|) (= v_~main$tmp_guard0~0_51 0) (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_1532) (= 0 v_~__unbuffered_p2_EAX~0_75) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t1940~0.base_22| 1)) (= 0 v_~y$r_buff0_thd3~0_885) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7) (= v_~y$r_buff0_thd0~0_245 0) (= 0 |v_~#y~0.offset_164|) (= 0 v_~y$w_buff1_used~0_1325) (= 0 v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7) (= v_~y$w_buff1~0_855 0) (= 0 v_~__unbuffered_p2_EAX$w_buff1_used~0_7) (= v_~main$tmp_guard1~0_30 0) (= v_~y$w_buff0_used~0_2077 0) (= 0 v_~weak$$choice0~0_215) (= v_~weak$$choice2~0_122 0) (= (select .cse1 |v_~#y~0.base_164|) 0) (= 0 v_~__unbuffered_p2_EAX$flush_delayed~0_8) (= v_~y$r_buff0_thd1~0_140 0) (= 0 v_~y$r_buff1_thd3~0_805) (= v_~__unbuffered_p2_EAX$read_delayed~0_57 0) (< |v_#StackHeapBarrier_25| |v_~#y~0.base_164|) (= v_~__unbuffered_p1_EAX~0_749 0) (= |v_ULTIMATE.start_main_~#t1940~0.offset_17| 0) (= |v_#NULL.offset_5| 0) (= 0 v_~y$flush_delayed~0_26) (= 0 v_~__unbuffered_p2_EAX$w_buff0~0_8) (= 0 v_~x~0_741) (= 0 v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8) (= (select (select |v_#memory_int_299| |v_~#y~0.base_164|) |v_~#y~0.offset_164|) 0) (< |v_#StackHeapBarrier_25| |v_ULTIMATE.start_main_~#t1940~0.base_22|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_25|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_299|, #length=|v_#length_39|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_65|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=v_~__unbuffered_p2_EAX$read_delayed_var~0.offset_45, ~__unbuffered_p2_EAX$read_delayed_var~0.base=v_~__unbuffered_p2_EAX$read_delayed_var~0.base_45, ULTIMATE.start_main_~#t1941~0.offset=|v_ULTIMATE.start_main_~#t1941~0.offset_15|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_83|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_86|, ~weak$$choice1~0=v_~weak$$choice1~0_99, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_805, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_749, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_140, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, ~__unbuffered_p2_EAX$w_buff0_used~0=v_~__unbuffered_p2_EAX$w_buff0_used~0_7, #length=|v_#length_37|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_75, ~__unbuffered_p2_EAX$r_buff1_thd2~0=v_~__unbuffered_p2_EAX$r_buff1_thd2~0_7, ULTIMATE.start_main_~#t1942~0.base=|v_ULTIMATE.start_main_~#t1942~0.base_19|, ~__unbuffered_p2_EAX$r_buff0_thd0~0=v_~__unbuffered_p2_EAX$r_buff0_thd0~0_7, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_35|, ~__unbuffered_p2_EAX$w_buff0~0=v_~__unbuffered_p2_EAX$w_buff0~0_8, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_22|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_7|, ULTIMATE.start_main_~#t1941~0.base=|v_ULTIMATE.start_main_~#t1941~0.base_21|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_55|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_85|, ULTIMATE.start_main_~#t1940~0.base=|v_ULTIMATE.start_main_~#t1940~0.base_22|, ~weak$$choice0~0=v_~weak$$choice0~0_215, #StackHeapBarrier=|v_#StackHeapBarrier_25|, ~y$w_buff1~0=v_~y$w_buff1~0_855, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_413, ~__unbuffered_p2_EAX$r_buff0_thd1~0=v_~__unbuffered_p2_EAX$r_buff0_thd1~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_314, ~x~0=v_~x~0_741, ~__unbuffered_p2_EAX$r_buff1_thd3~0=v_~__unbuffered_p2_EAX$r_buff1_thd3~0_8, ~__unbuffered_p2_EAX$w_buff1~0=v_~__unbuffered_p2_EAX$w_buff1~0_7, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~#y~0.offset=|v_~#y~0.offset_164|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_2077, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~#y~0.base=|v_~#y~0.base_164|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_33|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_225, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_59|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_141|, ~__unbuffered_p2_EAX$w_buff1_used~0=v_~__unbuffered_p2_EAX$w_buff1_used~0_7, ULTIMATE.start_main_~#t1940~0.offset=|v_ULTIMATE.start_main_~#t1940~0.offset_17|, ~y$w_buff0~0=v_~y$w_buff0~0_1532, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_885, ~__unbuffered_p2_EAX$r_buff0_thd2~0=v_~__unbuffered_p2_EAX$r_buff0_thd2~0_7, ~__unbuffered_p2_EAX$r_buff1_thd0~0=v_~__unbuffered_p2_EAX$r_buff1_thd0~0_8, ULTIMATE.start_main_~#t1942~0.offset=|v_ULTIMATE.start_main_~#t1942~0.offset_15|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_7|, ~__unbuffered_p2_EAX$mem_tmp~0=v_~__unbuffered_p2_EAX$mem_tmp~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_51, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_42|, ~__unbuffered_p2_EAX$flush_delayed~0=v_~__unbuffered_p2_EAX$flush_delayed~0_8, #NULL.base=|v_#NULL.base_5|, ~__unbuffered_p2_EAX$read_delayed~0=v_~__unbuffered_p2_EAX$read_delayed~0_57, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_265, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_16|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_245, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_298|, ~__unbuffered_p2_EAX$r_buff1_thd1~0=v_~__unbuffered_p2_EAX$r_buff1_thd1~0_7, ~__unbuffered_p2_EAX$r_buff0_thd3~0=v_~__unbuffered_p2_EAX$r_buff0_thd3~0_8, ~z~0=v_~z~0_24, ~weak$$choice2~0=v_~weak$$choice2~0_122, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_90|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_1325} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, ~__unbuffered_p2_EAX$read_delayed_var~0.offset, ~__unbuffered_p2_EAX$read_delayed_var~0.base, ULTIMATE.start_main_~#t1941~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~weak$$choice1~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, ~__unbuffered_p2_EAX$w_buff0_used~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EAX$r_buff1_thd2~0, ULTIMATE.start_main_~#t1942~0.base, ~__unbuffered_p2_EAX$r_buff0_thd0~0, ULTIMATE.start_main_#t~mem77, ~__unbuffered_p2_EAX$w_buff0~0, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~nondet66, ULTIMATE.start_main_~#t1941~0.base, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_~#t1940~0.base, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff0_thd1~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~__unbuffered_p2_EAX$r_buff1_thd3~0, ~__unbuffered_p2_EAX$w_buff1~0, ~y$read_delayed_var~0.offset, ~#y~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ~#y~0.base, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite70, ~__unbuffered_p2_EAX$w_buff1_used~0, ULTIMATE.start_main_~#t1940~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX$r_buff0_thd2~0, ~__unbuffered_p2_EAX$r_buff1_thd0~0, ULTIMATE.start_main_~#t1942~0.offset, ULTIMATE.start_main_#t~nondet67, ~__unbuffered_p2_EAX$mem_tmp~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, ~__unbuffered_p2_EAX$flush_delayed~0, #NULL.base, ~__unbuffered_p2_EAX$read_delayed~0, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~__unbuffered_p2_EAX$r_buff1_thd1~0, ~__unbuffered_p2_EAX$r_buff0_thd3~0, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_#t~mem69, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:22:04,620 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1140] [1140] L837-1-->L839: Formula: (and (= |v_#memory_int_213| (store |v_#memory_int_214| |v_ULTIMATE.start_main_~#t1941~0.base_12| (store (select |v_#memory_int_214| |v_ULTIMATE.start_main_~#t1941~0.base_12|) |v_ULTIMATE.start_main_~#t1941~0.offset_10| 1))) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t1941~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t1941~0.offset_10| 0) (= 0 (select |v_#valid_43| |v_ULTIMATE.start_main_~#t1941~0.base_12|)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1941~0.base_12| 4) |v_#length_21|) (not (= |v_ULTIMATE.start_main_~#t1941~0.base_12| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1941~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_214|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_42|, ULTIMATE.start_main_#t~nondet66=|v_ULTIMATE.start_main_#t~nondet66_4|, #memory_int=|v_#memory_int_213|, ULTIMATE.start_main_~#t1941~0.offset=|v_ULTIMATE.start_main_~#t1941~0.offset_10|, ULTIMATE.start_main_~#t1941~0.base=|v_ULTIMATE.start_main_~#t1941~0.base_12|, #length=|v_#length_21|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet66, #memory_int, ULTIMATE.start_main_~#t1941~0.offset, ULTIMATE.start_main_~#t1941~0.base, #length] because there is no mapped edge [2019-12-07 18:22:04,621 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1124] [1124] L839-1-->L841: Formula: (and (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1942~0.base_10| 1)) (= (store |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1942~0.base_10| (store (select |v_#memory_int_168| |v_ULTIMATE.start_main_~#t1942~0.base_10|) |v_ULTIMATE.start_main_~#t1942~0.offset_9| 2)) |v_#memory_int_167|) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1942~0.base_10| 4)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1942~0.base_10|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1942~0.base_10|) (not (= |v_ULTIMATE.start_main_~#t1942~0.base_10| 0)) (= 0 |v_ULTIMATE.start_main_~#t1942~0.offset_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_168|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t1942~0.offset=|v_ULTIMATE.start_main_~#t1942~0.offset_9|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_167|, #length=|v_#length_19|, ULTIMATE.start_main_~#t1942~0.base=|v_ULTIMATE.start_main_~#t1942~0.base_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1942~0.offset, ULTIMATE.start_main_#t~nondet67, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1942~0.base] because there is no mapped edge [2019-12-07 18:22:04,624 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1147] [1147] L799-->L799-14: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1281840366 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite34_Out1281840366| ~y$w_buff1~0_In1281840366) (= |P2Thread1of1ForFork2_#t~ite33_In1281840366| |P2Thread1of1ForFork2_#t~ite33_Out1281840366|)) (and (= (mod ~y$w_buff0_used~0_In1281840366 256) 0) .cse0 (= |P2Thread1of1ForFork2_#t~ite33_Out1281840366| ~y$w_buff1~0_In1281840366) (= |P2Thread1of1ForFork2_#t~ite34_Out1281840366| |P2Thread1of1ForFork2_#t~ite33_Out1281840366|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1281840366, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1281840366, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_In1281840366|, ~weak$$choice2~0=~weak$$choice2~0_In1281840366} OutVars{P2Thread1of1ForFork2_#t~ite34=|P2Thread1of1ForFork2_#t~ite34_Out1281840366|, ~y$w_buff1~0=~y$w_buff1~0_In1281840366, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1281840366, P2Thread1of1ForFork2_#t~ite33=|P2Thread1of1ForFork2_#t~ite33_Out1281840366|, ~weak$$choice2~0=~weak$$choice2~0_In1281840366} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite34, P2Thread1of1ForFork2_#t~ite33] because there is no mapped edge [2019-12-07 18:22:04,625 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1148] [1148] L801-->L801-14: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In540070520 256) 0))) (or (and (= (mod ~y$w_buff0_used~0_In540070520 256) 0) (= |P2Thread1of1ForFork2_#t~ite44_Out540070520| |P2Thread1of1ForFork2_#t~ite43_Out540070520|) .cse0 (= ~y$w_buff1_used~0_In540070520 |P2Thread1of1ForFork2_#t~ite43_Out540070520|)) (and (= |P2Thread1of1ForFork2_#t~ite43_In540070520| |P2Thread1of1ForFork2_#t~ite43_Out540070520|) (= |P2Thread1of1ForFork2_#t~ite44_Out540070520| ~y$w_buff1_used~0_In540070520) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In540070520, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_In540070520|, ~weak$$choice2~0=~weak$$choice2~0_In540070520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540070520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In540070520, P2Thread1of1ForFork2_#t~ite44=|P2Thread1of1ForFork2_#t~ite44_Out540070520|, P2Thread1of1ForFork2_#t~ite43=|P2Thread1of1ForFork2_#t~ite43_Out540070520|, ~weak$$choice2~0=~weak$$choice2~0_In540070520, ~y$w_buff1_used~0=~y$w_buff1_used~0_In540070520} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite44, P2Thread1of1ForFork2_#t~ite43] because there is no mapped edge [2019-12-07 18:22:04,626 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1059] [1059] L802-->L803: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_33 256))) (= v_~y$r_buff0_thd3~0_255 v_~y$r_buff0_thd3~0_254)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_255, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P2Thread1of1ForFork2_#t~ite46=|v_P2Thread1of1ForFork2_#t~ite46_13|, P2Thread1of1ForFork2_#t~ite45=|v_P2Thread1of1ForFork2_#t~ite45_12|, P2Thread1of1ForFork2_#t~ite48=|v_P2Thread1of1ForFork2_#t~ite48_9|, P2Thread1of1ForFork2_#t~ite47=|v_P2Thread1of1ForFork2_#t~ite47_12|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_254, ~weak$$choice2~0=v_~weak$$choice2~0_33, P2Thread1of1ForFork2_#t~ite49=|v_P2Thread1of1ForFork2_#t~ite49_6|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite46, P2Thread1of1ForFork2_#t~ite45, P2Thread1of1ForFork2_#t~ite48, P2Thread1of1ForFork2_#t~ite47, ~y$r_buff0_thd3~0, P2Thread1of1ForFork2_#t~ite49] because there is no mapped edge [2019-12-07 18:22:04,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1070] [1070] L807-->L814: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= |v_#memory_int_99| (store |v_#memory_int_100| |v_~#y~0.base_59| (store (select |v_#memory_int_100| |v_~#y~0.base_59|) |v_~#y~0.offset_59| v_~y$mem_tmp~0_7))) (= v_~z~0_10 1) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, #memory_int=|v_#memory_int_100|, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~#y~0.base=|v_~#y~0.base_59|} OutVars{P2Thread1of1ForFork2_#t~ite58=|v_P2Thread1of1ForFork2_#t~ite58_5|, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~#y~0.offset=|v_~#y~0.offset_59|, P2Thread1of1ForFork2_#t~mem57=|v_P2Thread1of1ForFork2_#t~mem57_3|, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, #memory_int=|v_#memory_int_99|, ~z~0=v_~z~0_10, ~#y~0.base=|v_~#y~0.base_59|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite58, P2Thread1of1ForFork2_#t~mem57, ~y$flush_delayed~0, #memory_int, ~z~0] because there is no mapped edge [2019-12-07 18:22:04,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1107] [1107] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_11 |v_P0Thread1of1ForFork0_#in~arg.offset_13|) (= v_P0Thread1of1ForFork0_~arg.base_11 |v_P0Thread1of1ForFork0_#in~arg.base_13|) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= v_~z~0_16 v_~__unbuffered_p0_EAX~0_21) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= 1 v_~x~0_275)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~z~0=v_~z~0_16} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_21, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_13|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, ~z~0=v_~z~0_16, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_11, ~x~0=v_~x~0_275, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_11} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-07 18:22:04,627 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1093] [1093] L814-2-->L814-5: Formula: (let ((.cse2 (= |P2Thread1of1ForFork2_#t~ite61_Out-1880879688| |P2Thread1of1ForFork2_#t~ite60_Out-1880879688|)) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1880879688 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1880879688 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~mem59_Out-1880879688| (select (select |#memory_int_In-1880879688| |~#y~0.base_In-1880879688|) |~#y~0.offset_In-1880879688|)) .cse2 (= |P2Thread1of1ForFork2_#t~mem59_Out-1880879688| |P2Thread1of1ForFork2_#t~ite60_Out-1880879688|)) (and .cse2 (not .cse1) (not .cse0) (= |P2Thread1of1ForFork2_#t~mem59_In-1880879688| |P2Thread1of1ForFork2_#t~mem59_Out-1880879688|) (= ~y$w_buff1~0_In-1880879688 |P2Thread1of1ForFork2_#t~ite60_Out-1880879688|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1880879688, ~#y~0.offset=|~#y~0.offset_In-1880879688|, ~y$w_buff1~0=~y$w_buff1~0_In-1880879688, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_In-1880879688|, #memory_int=|#memory_int_In-1880879688|, ~#y~0.base=|~#y~0.base_In-1880879688|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1880879688} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1880879688, ~#y~0.offset=|~#y~0.offset_In-1880879688|, ~y$w_buff1~0=~y$w_buff1~0_In-1880879688, P2Thread1of1ForFork2_#t~mem59=|P2Thread1of1ForFork2_#t~mem59_Out-1880879688|, P2Thread1of1ForFork2_#t~ite61=|P2Thread1of1ForFork2_#t~ite61_Out-1880879688|, #memory_int=|#memory_int_In-1880879688|, P2Thread1of1ForFork2_#t~ite60=|P2Thread1of1ForFork2_#t~ite60_Out-1880879688|, ~#y~0.base=|~#y~0.base_In-1880879688|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1880879688} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~mem59, P2Thread1of1ForFork2_#t~ite61, P2Thread1of1ForFork2_#t~ite60] because there is no mapped edge [2019-12-07 18:22:04,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1088] [1088] L815-->L815-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-349729229 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-349729229 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite62_Out-349729229|) (not .cse1)) (and (= ~y$w_buff0_used~0_In-349729229 |P2Thread1of1ForFork2_#t~ite62_Out-349729229|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-349729229, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-349729229} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-349729229, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-349729229, P2Thread1of1ForFork2_#t~ite62=|P2Thread1of1ForFork2_#t~ite62_Out-349729229|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite62] because there is no mapped edge [2019-12-07 18:22:04,628 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_111| v_P1Thread1of1ForFork1_~arg.offset_109) (= v_~y$w_buff1~0_135 v_~y$w_buff0~0_238) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_111 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_109|) (= v_P1Thread1of1ForFork1_~arg.base_109 |v_P1Thread1of1ForFork1_#in~arg.base_111|) (= 1 v_~y$w_buff0~0_237) (= v_~y$w_buff0_used~0_384 v_~y$w_buff1_used~0_233) (= v_~y$w_buff0_used~0_383 1) (= v_~__unbuffered_p1_EAX~0_111 v_~x~0_115) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_111 0)) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_109| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_233 256) 0)) (not (= (mod v_~y$w_buff0_used~0_383 256) 0)))) 1 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_384, ~y$w_buff0~0=v_~y$w_buff0~0_238, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_111, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_109, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_383, ~y$w_buff1~0=v_~y$w_buff1~0_135, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_111, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_109, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_109|, ~y$w_buff0~0=v_~y$w_buff0~0_237, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_111|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_111|, ~x~0=v_~x~0_115, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_233} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:22:04,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1094] [1094] L779-->L779-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In1156168985 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In1156168985 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite6_Out1156168985|)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1156168985 |P1Thread1of1ForFork1_#t~ite6_Out1156168985|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1156168985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1156168985} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1156168985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1156168985, P1Thread1of1ForFork1_#t~ite6=|P1Thread1of1ForFork1_#t~ite6_Out1156168985|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-07 18:22:04,630 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1074] [1074] L780-->L780-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In2001814826 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In2001814826 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In2001814826 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2001814826 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite7_Out2001814826| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork1_#t~ite7_Out2001814826| ~y$w_buff1_used~0_In2001814826) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2001814826, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2001814826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2001814826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2001814826} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2001814826, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2001814826, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2001814826, P1Thread1of1ForFork1_#t~ite7=|P1Thread1of1ForFork1_#t~ite7_Out2001814826|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2001814826} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite7] because there is no mapped edge [2019-12-07 18:22:04,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1096] [1096] L781-->L782: Formula: (let ((.cse1 (= ~y$r_buff0_thd2~0_Out1296962822 ~y$r_buff0_thd2~0_In1296962822)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1296962822 256))) (.cse2 (= (mod ~y$r_buff0_thd2~0_In1296962822 256) 0))) (or (and .cse0 .cse1) (and .cse2 .cse1) (and (= ~y$r_buff0_thd2~0_Out1296962822 0) (not .cse0) (not .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1296962822, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1296962822} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1296962822, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out1296962822, P1Thread1of1ForFork1_#t~ite8=|P1Thread1of1ForFork1_#t~ite8_Out1296962822|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-07 18:22:04,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1079] [1079] L782-->L782-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In1880533702 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1880533702 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1880533702 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1880533702 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite9_Out1880533702| ~y$r_buff1_thd2~0_In1880533702)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite9_Out1880533702|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1880533702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1880533702, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1880533702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1880533702} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1880533702, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1880533702, P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1880533702|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1880533702, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1880533702} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 18:22:04,631 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1138] [1138] L782-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_186 |v_P1Thread1of1ForFork1_#t~ite9_22|) (= 0 |v_P1Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= |v_P1Thread1of1ForFork1_#res.offset_3| 0)) InVars {P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_186, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_3|, P1Thread1of1ForFork1_#t~ite9=|v_P1Thread1of1ForFork1_#t~ite9_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite9, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-07 18:22:04,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1082] [1082] L816-->L816-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In-1400188275 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-1400188275 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd3~0_In-1400188275 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1400188275 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite63_Out-1400188275|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1400188275 |P2Thread1of1ForFork2_#t~ite63_Out-1400188275|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1400188275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400188275, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1400188275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400188275} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1400188275, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1400188275, P2Thread1of1ForFork2_#t~ite63=|P2Thread1of1ForFork2_#t~ite63_Out-1400188275|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1400188275, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1400188275} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite63] because there is no mapped edge [2019-12-07 18:22:04,632 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1092] [1092] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-109423356 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-109423356 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-109423356 |P2Thread1of1ForFork2_#t~ite64_Out-109423356|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite64_Out-109423356|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-109423356, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109423356} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-109423356, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-109423356, P2Thread1of1ForFork2_#t~ite64=|P2Thread1of1ForFork2_#t~ite64_Out-109423356|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite64] because there is no mapped edge [2019-12-07 18:22:04,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1083] [1083] L818-->L818-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In977604955 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In977604955 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In977604955 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd3~0_In977604955 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite65_Out977604955| ~y$r_buff1_thd3~0_In977604955) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite65_Out977604955| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In977604955, ~y$w_buff0_used~0=~y$w_buff0_used~0_In977604955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In977604955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In977604955} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In977604955, P2Thread1of1ForFork2_#t~ite65=|P2Thread1of1ForFork2_#t~ite65_Out977604955|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In977604955, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In977604955, ~y$w_buff1_used~0=~y$w_buff1_used~0_In977604955} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite65] because there is no mapped edge [2019-12-07 18:22:04,633 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1128] [1128] L818-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P2Thread1of1ForFork2_#res.base_3|) (= |v_P2Thread1of1ForFork2_#t~ite65_20| v_~y$r_buff1_thd3~0_421) (= |v_P2Thread1of1ForFork2_#res.offset_3| 0)) InVars {P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_421, P2Thread1of1ForFork2_#t~ite65=|v_P2Thread1of1ForFork2_#t~ite65_19|, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_3|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork2_#t~ite65, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-07 18:22:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1046] [1046] L845-->L847-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_10 256) 0)) (or (= (mod v_~y$r_buff0_thd0~0_79 256) 0) (= (mod v_~y$w_buff0_used~0_492 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_492, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:22:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1087] [1087] L847-2-->L847-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In2096518665 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In2096518665 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem69_Out2096518665| (select (select |#memory_int_In2096518665| |~#y~0.base_In2096518665|) |~#y~0.offset_In2096518665|)) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~mem69_Out2096518665| |ULTIMATE.start_main_#t~ite70_Out2096518665|)) (and (not .cse1) (not .cse0) (= ~y$w_buff1~0_In2096518665 |ULTIMATE.start_main_#t~ite70_Out2096518665|) (= |ULTIMATE.start_main_#t~mem69_In2096518665| |ULTIMATE.start_main_#t~mem69_Out2096518665|)))) InVars {~#y~0.offset=|~#y~0.offset_In2096518665|, ~y$w_buff1~0=~y$w_buff1~0_In2096518665, #memory_int=|#memory_int_In2096518665|, ~#y~0.base=|~#y~0.base_In2096518665|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2096518665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096518665, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_In2096518665|} OutVars{~#y~0.offset=|~#y~0.offset_In2096518665|, ~y$w_buff1~0=~y$w_buff1~0_In2096518665, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out2096518665|, #memory_int=|#memory_int_In2096518665|, ~#y~0.base=|~#y~0.base_In2096518665|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2096518665, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2096518665, ULTIMATE.start_main_#t~mem69=|ULTIMATE.start_main_#t~mem69_Out2096518665|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-07 18:22:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1029] [1029] L847-4-->L848: Formula: (= (store |v_#memory_int_69| |v_~#y~0.base_37| (store (select |v_#memory_int_69| |v_~#y~0.base_37|) |v_~#y~0.offset_37| |v_ULTIMATE.start_main_#t~ite70_13|)) |v_#memory_int_68|) InVars {~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_13|, #memory_int=|v_#memory_int_69|, ~#y~0.base=|v_~#y~0.base_37|} OutVars{ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_12|, ~#y~0.offset=|v_~#y~0.offset_37|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_12|, #memory_int=|v_#memory_int_68|, ~#y~0.base=|v_~#y~0.base_37|, ULTIMATE.start_main_#t~mem69=|v_ULTIMATE.start_main_#t~mem69_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite70, #memory_int, ULTIMATE.start_main_#t~mem69] because there is no mapped edge [2019-12-07 18:22:04,634 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1077] [1077] L848-->L848-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-53921203 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-53921203 256) 0))) (or (and (= ~y$w_buff0_used~0_In-53921203 |ULTIMATE.start_main_#t~ite72_Out-53921203|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite72_Out-53921203| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-53921203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53921203} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out-53921203|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-53921203, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-53921203} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-07 18:22:04,635 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1085] [1085] L849-->L849-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd0~0_In-69272350 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-69272350 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-69272350 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-69272350 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite73_Out-69272350|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-69272350 |ULTIMATE.start_main_#t~ite73_Out-69272350|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-69272350, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-69272350, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-69272350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-69272350} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out-69272350|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-69272350, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-69272350, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-69272350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-69272350} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-07 18:22:04,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1089] [1089] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1591605282 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1591605282 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite74_Out1591605282|)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1591605282 |ULTIMATE.start_main_#t~ite74_Out1591605282|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1591605282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591605282} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out1591605282|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1591605282, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1591605282} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-07 18:22:04,636 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1081] [1081] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-239866826 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-239866826 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-239866826 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-239866826 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd0~0_In-239866826 |ULTIMATE.start_main_#t~ite75_Out-239866826|)) (and (= 0 |ULTIMATE.start_main_#t~ite75_Out-239866826|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-239866826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239866826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239866826, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239866826} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-239866826, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-239866826, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-239866826, ULTIMATE.start_main_#t~ite75=|ULTIMATE.start_main_#t~ite75_Out-239866826|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-239866826} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite75] because there is no mapped edge [2019-12-07 18:22:04,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1097] [1097] L855-->L855-3: Formula: (let ((.cse0 (not (= 0 (mod ~__unbuffered_p2_EAX$read_delayed~0_In-2087250040 256)))) (.cse1 (= (mod ~weak$$choice1~0_In-2087250040 256) 0))) (or (and (= |ULTIMATE.start_main_#t~mem77_Out-2087250040| |ULTIMATE.start_main_#t~ite78_Out-2087250040|) .cse0 (= |ULTIMATE.start_main_#t~mem77_Out-2087250040| (select (select |#memory_int_In-2087250040| ~__unbuffered_p2_EAX$read_delayed_var~0.base_In-2087250040) ~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-2087250040)) (not .cse1)) (and .cse0 .cse1 (= ~__unbuffered_p2_EAX~0_In-2087250040 |ULTIMATE.start_main_#t~ite78_Out-2087250040|) (= |ULTIMATE.start_main_#t~mem77_In-2087250040| |ULTIMATE.start_main_#t~mem77_Out-2087250040|)))) InVars {~weak$$choice1~0=~weak$$choice1~0_In-2087250040, ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_In-2087250040|, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-2087250040, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-2087250040, #memory_int=|#memory_int_In-2087250040|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-2087250040, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-2087250040} OutVars{ULTIMATE.start_main_#t~mem77=|ULTIMATE.start_main_#t~mem77_Out-2087250040|, ~weak$$choice1~0=~weak$$choice1~0_In-2087250040, ~__unbuffered_p2_EAX$read_delayed_var~0.offset=~__unbuffered_p2_EAX$read_delayed_var~0.offset_In-2087250040, ~__unbuffered_p2_EAX$read_delayed_var~0.base=~__unbuffered_p2_EAX$read_delayed_var~0.base_In-2087250040, #memory_int=|#memory_int_In-2087250040|, ~__unbuffered_p2_EAX~0=~__unbuffered_p2_EAX~0_In-2087250040, ULTIMATE.start_main_#t~ite78=|ULTIMATE.start_main_#t~ite78_Out-2087250040|, ~__unbuffered_p2_EAX$read_delayed~0=~__unbuffered_p2_EAX$read_delayed~0_In-2087250040} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start_main_#t~ite78] because there is no mapped edge [2019-12-07 18:22:04,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1141] [1141] L855-3-->L4: Formula: (and (let ((.cse2 (= v_~__unbuffered_p1_EAX~0_540 1)) (.cse3 (= 1 v_~__unbuffered_p2_EAX~0_50)) (.cse0 (= v_~main$tmp_guard1~0_17 1)) (.cse1 (= |v_ULTIMATE.start_main_#t~ite78_30| v_~__unbuffered_p2_EAX~0_50)) (.cse4 (= 1 v_~__unbuffered_p0_EAX~0_26))) (or (and .cse0 .cse1 (not .cse2)) (and (not .cse3) .cse0 .cse1) (and (= v_~main$tmp_guard1~0_17 0) .cse4 .cse1 .cse2 .cse3) (and .cse0 .cse1 (not .cse4)))) (= (mod v_~main$tmp_guard1~0_17 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_30|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, ULTIMATE.start_main_#t~mem77=|v_ULTIMATE.start_main_#t~mem77_25|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_540, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_50, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_34|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_29|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~mem77, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite78, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:22:04,637 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1112] [1112] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_9 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:22:04,703 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7cf5e55a-03a1-4b93-b34d-edfc9f4f66db/bin/uautomizer/witness.graphml [2019-12-07 18:22:04,703 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:22:04,704 INFO L168 Benchmark]: Toolchain (without parser) took 43556.09 ms. Allocated memory was 1.0 GB in the beginning and 3.3 GB in the end (delta: 2.2 GB). Free memory was 935.3 MB in the beginning and 1.0 GB in the end (delta: -71.1 MB). Peak memory consumption was 2.2 GB. Max. memory is 11.5 GB. [2019-12-07 18:22:04,704 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:22:04,705 INFO L168 Benchmark]: CACSL2BoogieTranslator took 407.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:04,705 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.52 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 18:22:04,705 INFO L168 Benchmark]: Boogie Preprocessor took 28.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:04,705 INFO L168 Benchmark]: RCFGBuilder took 467.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:04,705 INFO L168 Benchmark]: TraceAbstraction took 42522.00 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 993.2 MB in the beginning and 1.1 GB in the end (delta: -66.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. [2019-12-07 18:22:04,706 INFO L168 Benchmark]: Witness Printer took 86.00 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. [2019-12-07 18:22:04,707 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 955.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 407.00 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.3 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -131.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.52 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 28.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.60 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.2 MB in the end (delta: 68.1 MB). Peak memory consumption was 68.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42522.00 ms. Allocated memory was 1.1 GB in the beginning and 3.3 GB in the end (delta: 2.1 GB). Free memory was 993.2 MB in the beginning and 1.1 GB in the end (delta: -66.0 MB). Peak memory consumption was 2.1 GB. Max. memory is 11.5 GB. * Witness Printer took 86.00 ms. Allocated memory is still 3.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.8 MB). Peak memory consumption was 52.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.7s, 224 ProgramPointsBefore, 107 ProgramPointsAfterwards, 276 TransitionsBefore, 133 TransitionsAfterwards, 22870 CoEnabledTransitionPairs, 8 FixpointIterations, 51 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 66 ConcurrentYvCompositions, 30 ChoiceCompositions, 10335 VarBasedMoverChecksPositive, 480 VarBasedMoverChecksNegative, 246 SemBasedMoverChecksPositive, 398 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.2s, 0 MoverChecksTotal, 113419 CheckedPairsTotal, 175 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L837] FCALL, FORK 0 pthread_create(&t1940, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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, z=0] [L839] FCALL, FORK 0 pthread_create(&t1941, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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, z=0] [L841] FCALL, FORK 0 pthread_create(&t1942, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x=0, y={6: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, z=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 y$flush_delayed = weak$$choice2 [L795] EXPR 3 \read(y) [L795] 3 y$mem_tmp = y [L796] 3 weak$$choice1 = __VERIFIER_nondet_bool() [L797] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L797] EXPR 3 \read(y) [L797] EXPR 3 !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) VAL [!y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y))))=0, \read(y)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={6:0}, y$flush_delayed=1, 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, z=0] [L797] 3 y = !y$w_buff0_used ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y : (weak$$choice1 ? y$w_buff0 : y$w_buff1)) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$w_buff1 : y$w_buff0) : (weak$$choice0 ? y$w_buff0 : y)))) [L798] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0))))=0, x=0, y={6:0}, y$flush_delayed=1, 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, z=0] [L798] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)))) [L799] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)))) [L800] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0))))=0, x=0, y={6:0}, y$flush_delayed=1, 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, z=0] [L800] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 || !weak$$choice1 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : weak$$choice0)))) [L801] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? weak$$choice0 : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L803] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))))=0, x=0, y={6:0}, y$flush_delayed=1, 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, z=0] [L803] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (y$w_buff0_used && !y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (weak$$choice0 ? y$r_buff1_thd3 : (_Bool)0) : (y$w_buff0_used && y$r_buff1_thd3 && y$w_buff1_used && !y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)))) [L804] 3 __unbuffered_p2_EAX$read_delayed = (_Bool)1 [L805] 3 __unbuffered_p2_EAX$read_delayed_var = &y [L806] EXPR 3 \read(y) [L806] 3 __unbuffered_p2_EAX = y [L814] EXPR 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=0, y={6: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, z=1] [L814] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L771] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L772] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L773] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L774] 2 y$r_buff1_thd3 = y$r_buff0_thd3 [L775] 2 y$r_buff0_thd2 = (_Bool)1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={6: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_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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 [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={6: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_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L778] 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) [L779] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L780] 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 [L815] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L816] 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 [L817] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p1_EAX=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=1, __unbuffered_p2_EAX$read_delayed_var={6:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice1=3, weak$$choice2=1, x=1, y={6: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, z=1] [L848] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L849] 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 [L850] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L851] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L854] 0 weak$$choice1 = __VERIFIER_nondet_bool() - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 215 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.3s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 23.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3395 SDtfs, 5971 SDslu, 11628 SDs, 0 SdLazy, 13891 SolverSat, 549 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2046 ImplicationChecksByTransitivity, 8.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57838occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 54693 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 826 NumberOfCodeBlocks, 826 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 746 ConstructedInterpolants, 0 QuantifiedInterpolants, 341728 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...