./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix020_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_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix020_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/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 b9648bf2eabfc0d27a16e05352258b3ad2339723 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:02:32,367 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:02:32,368 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:02:32,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:02:32,377 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:02:32,378 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:02:32,379 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:02:32,381 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:02:32,382 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:02:32,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:02:32,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:02:32,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:02:32,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:02:32,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:02:32,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:02:32,387 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:02:32,388 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:02:32,389 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:02:32,390 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:02:32,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:02:32,393 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:02:32,393 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:02:32,394 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:02:32,394 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:02:32,396 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:02:32,396 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:02:32,396 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:02:32,397 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:02:32,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:02:32,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:02:32,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:02:32,398 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:02:32,399 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:02:32,399 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:02:32,400 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:02:32,400 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:02:32,400 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:02:32,400 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:02:32,400 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:02:32,401 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:02:32,401 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:02:32,402 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:02:32,411 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:02:32,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:02:32,412 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:02:32,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:02:32,412 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:02:32,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:02:32,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:02:32,414 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:02:32,414 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:02:32,415 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_1885eb0e-43af-4dd1-8106-0edbf1cf3153/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 -> b9648bf2eabfc0d27a16e05352258b3ad2339723 [2019-12-07 18:02:32,516 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:02:32,524 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:02:32,526 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:02:32,527 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:02:32,527 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:02:32,528 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix020_power.opt.i [2019-12-07 18:02:32,565 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/data/16621efbc/992fefeccb6b4677bfc9c9b25067d6cd/FLAG4e51fc5e8 [2019-12-07 18:02:33,115 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:02:33,116 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/sv-benchmarks/c/pthread-wmm/mix020_power.opt.i [2019-12-07 18:02:33,129 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/data/16621efbc/992fefeccb6b4677bfc9c9b25067d6cd/FLAG4e51fc5e8 [2019-12-07 18:02:33,556 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/data/16621efbc/992fefeccb6b4677bfc9c9b25067d6cd [2019-12-07 18:02:33,557 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:02:33,558 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:02:33,559 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:02:33,559 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:02:33,561 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:02:33,562 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:33,563 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b6fc423 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33, skipping insertion in model container [2019-12-07 18:02:33,564 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:33,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:02:33,604 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:02:33,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:02:33,883 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:02:33,924 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:02:33,970 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:02:33,970 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33 WrapperNode [2019-12-07 18:02:33,970 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:02:33,971 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:02:33,971 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:02:33,971 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:02:33,976 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:02:33" (1/1) ... [2019-12-07 18:02:33,990 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:02:33" (1/1) ... [2019-12-07 18:02:34,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:02:34,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:02:34,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:02:34,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:02:34,017 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,021 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,021 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,029 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,034 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... [2019-12-07 18:02:34,037 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:02:34,038 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:02:34,038 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:02:34,038 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:02:34,039 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/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:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:02:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:02:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:02:34,079 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:02:34,079 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-07 18:02:34,080 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-07 18:02:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:02:34,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:02:34,080 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:02:34,081 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:02:34,481 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:02:34,481 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:02:34,482 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:02:34 BoogieIcfgContainer [2019-12-07 18:02:34,482 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:02:34,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:02:34,483 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:02:34,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:02:34,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:02:33" (1/3) ... [2019-12-07 18:02:34,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca48b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:02:34, skipping insertion in model container [2019-12-07 18:02:34,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:02:33" (2/3) ... [2019-12-07 18:02:34,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca48b9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:02:34, skipping insertion in model container [2019-12-07 18:02:34,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:02:34" (3/3) ... [2019-12-07 18:02:34,488 INFO L109 eAbstractionObserver]: Analyzing ICFG mix020_power.opt.i [2019-12-07 18:02:34,494 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:02:34,494 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:02:34,499 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:02:34,500 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:02:34,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,529 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,530 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,530 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,531 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,531 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,532 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,533 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,534 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,535 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,536 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,537 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,538 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,547 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,548 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,549 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,557 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,558 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,559 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,560 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,561 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:02:34,572 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-07 18:02:34,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:02:34,584 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:02:34,584 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:02:34,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:02:34,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:02:34,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:02:34,585 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:02:34,585 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:02:34,596 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 254 transitions [2019-12-07 18:02:34,597 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:02:34,662 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:02:34,662 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:02:34,674 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:02:34,696 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 211 places, 254 transitions [2019-12-07 18:02:34,740 INFO L134 PetriNetUnfolder]: 56/250 cut-off events. [2019-12-07 18:02:34,740 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:02:34,750 INFO L76 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 250 events. 56/250 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 928 event pairs. 12/204 useless extension candidates. Maximal degree in co-relation 217. Up to 2 conditions per place. [2019-12-07 18:02:34,776 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26510 [2019-12-07 18:02:34,777 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:02:38,393 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-12-07 18:02:38,695 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 18:02:38,817 INFO L206 etLargeBlockEncoding]: Checked pairs total: 142340 [2019-12-07 18:02:38,817 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-07 18:02:38,819 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 112 places, 131 transitions [2019-12-07 18:02:47,691 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 90046 states. [2019-12-07 18:02:47,693 INFO L276 IsEmpty]: Start isEmpty. Operand 90046 states. [2019-12-07 18:02:47,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 18:02:47,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:47,698 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:47,699 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash 259811849, now seen corresponding path program 1 times [2019-12-07 18:02:47,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:47,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620867611] [2019-12-07 18:02:47,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:47,864 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:02:47,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620867611] [2019-12-07 18:02:47,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:47,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:02:47,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730631356] [2019-12-07 18:02:47,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:02:47,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:47,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:02:47,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:02:47,879 INFO L87 Difference]: Start difference. First operand 90046 states. Second operand 3 states. [2019-12-07 18:02:48,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:48,627 INFO L93 Difference]: Finished difference Result 89182 states and 411616 transitions. [2019-12-07 18:02:48,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:02:48,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 18:02:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:49,097 INFO L225 Difference]: With dead ends: 89182 [2019-12-07 18:02:49,097 INFO L226 Difference]: Without dead ends: 83470 [2019-12-07 18:02:49,098 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:02:50,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83470 states. [2019-12-07 18:02:51,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83470 to 83470. [2019-12-07 18:02:51,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83470 states. [2019-12-07 18:02:53,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83470 states to 83470 states and 385016 transitions. [2019-12-07 18:02:53,810 INFO L78 Accepts]: Start accepts. Automaton has 83470 states and 385016 transitions. Word has length 9 [2019-12-07 18:02:53,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:53,811 INFO L462 AbstractCegarLoop]: Abstraction has 83470 states and 385016 transitions. [2019-12-07 18:02:53,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:02:53,811 INFO L276 IsEmpty]: Start isEmpty. Operand 83470 states and 385016 transitions. [2019-12-07 18:02:53,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 18:02:53,818 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:53,818 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:53,818 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:53,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:53,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1558204525, now seen corresponding path program 1 times [2019-12-07 18:02:53,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:53,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190684313] [2019-12-07 18:02:53,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:53,887 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:02:53,887 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190684313] [2019-12-07 18:02:53,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:53,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:02:53,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161956108] [2019-12-07 18:02:53,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:02:53,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:53,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:02:53,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:02:53,889 INFO L87 Difference]: Start difference. First operand 83470 states and 385016 transitions. Second operand 4 states. [2019-12-07 18:02:54,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:02:54,866 INFO L93 Difference]: Finished difference Result 129310 states and 576248 transitions. [2019-12-07 18:02:54,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:02:54,867 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-07 18:02:54,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:02:55,316 INFO L225 Difference]: With dead ends: 129310 [2019-12-07 18:02:55,316 INFO L226 Difference]: Without dead ends: 129254 [2019-12-07 18:02:55,317 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:02:57,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129254 states. [2019-12-07 18:02:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129254 to 124642. [2019-12-07 18:02:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124642 states. [2019-12-07 18:02:59,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124642 states to 124642 states and 558856 transitions. [2019-12-07 18:02:59,415 INFO L78 Accepts]: Start accepts. Automaton has 124642 states and 558856 transitions. Word has length 15 [2019-12-07 18:02:59,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:02:59,415 INFO L462 AbstractCegarLoop]: Abstraction has 124642 states and 558856 transitions. [2019-12-07 18:02:59,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:02:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand 124642 states and 558856 transitions. [2019-12-07 18:02:59,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 18:02:59,422 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:02:59,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:02:59,423 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:02:59,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:02:59,423 INFO L82 PathProgramCache]: Analyzing trace with hash -545556496, now seen corresponding path program 1 times [2019-12-07 18:02:59,423 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:02:59,423 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259012371] [2019-12-07 18:02:59,423 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:02:59,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:02:59,482 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:02:59,483 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259012371] [2019-12-07 18:02:59,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:02:59,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:02:59,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297654611] [2019-12-07 18:02:59,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:02:59,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:02:59,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:02:59,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:02:59,484 INFO L87 Difference]: Start difference. First operand 124642 states and 558856 transitions. Second operand 4 states. [2019-12-07 18:03:02,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:02,227 INFO L93 Difference]: Finished difference Result 158782 states and 702836 transitions. [2019-12-07 18:03:02,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:03:02,227 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 18:03:02,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:02,650 INFO L225 Difference]: With dead ends: 158782 [2019-12-07 18:03:02,650 INFO L226 Difference]: Without dead ends: 158730 [2019-12-07 18:03:02,651 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:03:04,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158730 states. [2019-12-07 18:03:06,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158730 to 142378. [2019-12-07 18:03:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142378 states. [2019-12-07 18:03:07,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142378 states to 142378 states and 635380 transitions. [2019-12-07 18:03:07,125 INFO L78 Accepts]: Start accepts. Automaton has 142378 states and 635380 transitions. Word has length 18 [2019-12-07 18:03:07,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:07,126 INFO L462 AbstractCegarLoop]: Abstraction has 142378 states and 635380 transitions. [2019-12-07 18:03:07,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:03:07,126 INFO L276 IsEmpty]: Start isEmpty. Operand 142378 states and 635380 transitions. [2019-12-07 18:03:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:03:07,137 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:07,137 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:07,137 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:07,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:07,138 INFO L82 PathProgramCache]: Analyzing trace with hash 267646308, now seen corresponding path program 1 times [2019-12-07 18:03:07,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:07,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80871290] [2019-12-07 18:03:07,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:07,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:07,176 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:03:07,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80871290] [2019-12-07 18:03:07,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:07,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:07,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166800600] [2019-12-07 18:03:07,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:03:07,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:07,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:03:07,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:03:07,177 INFO L87 Difference]: Start difference. First operand 142378 states and 635380 transitions. Second operand 3 states. [2019-12-07 18:03:08,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:08,839 INFO L93 Difference]: Finished difference Result 243978 states and 1046540 transitions. [2019-12-07 18:03:08,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:03:08,840 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 18:03:08,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:09,566 INFO L225 Difference]: With dead ends: 243978 [2019-12-07 18:03:09,567 INFO L226 Difference]: Without dead ends: 243978 [2019-12-07 18:03:09,567 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:03:11,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243978 states. [2019-12-07 18:03:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243978 to 220082. [2019-12-07 18:03:18,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220082 states. [2019-12-07 18:03:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220082 states to 220082 states and 955428 transitions. [2019-12-07 18:03:19,006 INFO L78 Accepts]: Start accepts. Automaton has 220082 states and 955428 transitions. Word has length 19 [2019-12-07 18:03:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:19,006 INFO L462 AbstractCegarLoop]: Abstraction has 220082 states and 955428 transitions. [2019-12-07 18:03:19,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:03:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 220082 states and 955428 transitions. [2019-12-07 18:03:19,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:03:19,020 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:19,020 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:03:19,021 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:19,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:19,021 INFO L82 PathProgramCache]: Analyzing trace with hash -993922956, now seen corresponding path program 1 times [2019-12-07 18:03:19,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:19,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136613430] [2019-12-07 18:03:19,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:19,061 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:03:19,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136613430] [2019-12-07 18:03:19,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:19,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:03:19,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717714528] [2019-12-07 18:03:19,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:03:19,061 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:19,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:03:19,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:03:19,062 INFO L87 Difference]: Start difference. First operand 220082 states and 955428 transitions. Second operand 3 states. [2019-12-07 18:03:20,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:20,164 INFO L93 Difference]: Finished difference Result 207942 states and 891892 transitions. [2019-12-07 18:03:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:03:20,165 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:03:20,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:20,773 INFO L225 Difference]: With dead ends: 207942 [2019-12-07 18:03:20,773 INFO L226 Difference]: Without dead ends: 207942 [2019-12-07 18:03:20,773 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:03:23,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207942 states. [2019-12-07 18:03:26,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207942 to 205878. [2019-12-07 18:03:26,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205878 states. [2019-12-07 18:03:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205878 states to 205878 states and 883844 transitions. [2019-12-07 18:03:27,113 INFO L78 Accepts]: Start accepts. Automaton has 205878 states and 883844 transitions. Word has length 20 [2019-12-07 18:03:27,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:27,113 INFO L462 AbstractCegarLoop]: Abstraction has 205878 states and 883844 transitions. [2019-12-07 18:03:27,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:03:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 205878 states and 883844 transitions. [2019-12-07 18:03:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-07 18:03:27,124 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:27,125 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:03:27,125 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:27,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:27,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1422939487, now seen corresponding path program 1 times [2019-12-07 18:03:27,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:27,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750459098] [2019-12-07 18:03:27,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:27,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:27,197 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:03:27,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750459098] [2019-12-07 18:03:27,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:27,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:03:27,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697507377] [2019-12-07 18:03:27,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:03:27,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:27,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:03:27,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:03:27,199 INFO L87 Difference]: Start difference. First operand 205878 states and 883844 transitions. Second operand 3 states. [2019-12-07 18:03:28,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:28,701 INFO L93 Difference]: Finished difference Result 307978 states and 1262032 transitions. [2019-12-07 18:03:28,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:03:28,701 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-12-07 18:03:28,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:32,619 INFO L225 Difference]: With dead ends: 307978 [2019-12-07 18:03:32,619 INFO L226 Difference]: Without dead ends: 307540 [2019-12-07 18:03:32,620 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:03:35,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307540 states. [2019-12-07 18:03:39,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307540 to 298751. [2019-12-07 18:03:39,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298751 states. [2019-12-07 18:03:40,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298751 states to 298751 states and 1235515 transitions. [2019-12-07 18:03:40,851 INFO L78 Accepts]: Start accepts. Automaton has 298751 states and 1235515 transitions. Word has length 20 [2019-12-07 18:03:40,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:40,851 INFO L462 AbstractCegarLoop]: Abstraction has 298751 states and 1235515 transitions. [2019-12-07 18:03:40,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:03:40,852 INFO L276 IsEmpty]: Start isEmpty. Operand 298751 states and 1235515 transitions. [2019-12-07 18:03:40,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:03:40,868 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:40,868 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:40,868 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:40,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:40,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2098797643, now seen corresponding path program 1 times [2019-12-07 18:03:40,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:40,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707939811] [2019-12-07 18:03:40,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:40,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:40,911 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:03:40,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707939811] [2019-12-07 18:03:40,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:40,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:03:40,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227187444] [2019-12-07 18:03:40,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:03:40,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:40,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:03:40,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:03:40,913 INFO L87 Difference]: Start difference. First operand 298751 states and 1235515 transitions. Second operand 5 states. [2019-12-07 18:03:41,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:41,962 INFO L93 Difference]: Finished difference Result 130288 states and 445936 transitions. [2019-12-07 18:03:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:03:41,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-07 18:03:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:42,182 INFO L225 Difference]: With dead ends: 130288 [2019-12-07 18:03:42,182 INFO L226 Difference]: Without dead ends: 112283 [2019-12-07 18:03:42,182 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:03:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112283 states. [2019-12-07 18:03:44,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112283 to 110159. [2019-12-07 18:03:44,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110159 states. [2019-12-07 18:03:44,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110159 states to 110159 states and 368291 transitions. [2019-12-07 18:03:44,925 INFO L78 Accepts]: Start accepts. Automaton has 110159 states and 368291 transitions. Word has length 21 [2019-12-07 18:03:44,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:44,926 INFO L462 AbstractCegarLoop]: Abstraction has 110159 states and 368291 transitions. [2019-12-07 18:03:44,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:03:44,926 INFO L276 IsEmpty]: Start isEmpty. Operand 110159 states and 368291 transitions. [2019-12-07 18:03:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 18:03:44,933 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:44,933 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:03:44,933 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1950965462, now seen corresponding path program 1 times [2019-12-07 18:03:44,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:44,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93010085] [2019-12-07 18:03:44,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:44,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:44,970 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:03:44,970 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93010085] [2019-12-07 18:03:44,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:44,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:03:44,971 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512939505] [2019-12-07 18:03:44,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:03:44,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:44,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:03:44,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:03:44,971 INFO L87 Difference]: Start difference. First operand 110159 states and 368291 transitions. Second operand 4 states. [2019-12-07 18:03:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:45,622 INFO L93 Difference]: Finished difference Result 136881 states and 452017 transitions. [2019-12-07 18:03:45,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:03:45,623 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-07 18:03:45,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:45,877 INFO L225 Difference]: With dead ends: 136881 [2019-12-07 18:03:45,877 INFO L226 Difference]: Without dead ends: 136752 [2019-12-07 18:03:45,877 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:03:46,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136752 states. [2019-12-07 18:03:48,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136752 to 111511. [2019-12-07 18:03:48,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111511 states. [2019-12-07 18:03:48,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111511 states to 111511 states and 372663 transitions. [2019-12-07 18:03:48,702 INFO L78 Accepts]: Start accepts. Automaton has 111511 states and 372663 transitions. Word has length 21 [2019-12-07 18:03:48,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:48,702 INFO L462 AbstractCegarLoop]: Abstraction has 111511 states and 372663 transitions. [2019-12-07 18:03:48,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:03:48,703 INFO L276 IsEmpty]: Start isEmpty. Operand 111511 states and 372663 transitions. [2019-12-07 18:03:48,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 18:03:48,712 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:48,712 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:48,712 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:48,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:48,712 INFO L82 PathProgramCache]: Analyzing trace with hash 25421890, now seen corresponding path program 1 times [2019-12-07 18:03:48,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:48,712 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981705352] [2019-12-07 18:03:48,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:48,745 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:03:48,746 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981705352] [2019-12-07 18:03:48,746 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:48,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:03:48,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592056541] [2019-12-07 18:03:48,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:03:48,747 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:48,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:03:48,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:03:48,747 INFO L87 Difference]: Start difference. First operand 111511 states and 372663 transitions. Second operand 3 states. [2019-12-07 18:03:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:49,126 INFO L93 Difference]: Finished difference Result 108324 states and 361786 transitions. [2019-12-07 18:03:49,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:03:49,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-12-07 18:03:49,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:49,323 INFO L225 Difference]: With dead ends: 108324 [2019-12-07 18:03:49,323 INFO L226 Difference]: Without dead ends: 108324 [2019-12-07 18:03:49,323 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:03:50,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108324 states. [2019-12-07 18:03:51,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108324 to 74883. [2019-12-07 18:03:51,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74883 states. [2019-12-07 18:03:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74883 states to 74883 states and 249122 transitions. [2019-12-07 18:03:51,315 INFO L78 Accepts]: Start accepts. Automaton has 74883 states and 249122 transitions. Word has length 22 [2019-12-07 18:03:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:51,315 INFO L462 AbstractCegarLoop]: Abstraction has 74883 states and 249122 transitions. [2019-12-07 18:03:51,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:03:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 74883 states and 249122 transitions. [2019-12-07 18:03:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 18:03:51,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:51,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:51,328 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:51,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:51,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1382879271, now seen corresponding path program 1 times [2019-12-07 18:03:51,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:51,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617795523] [2019-12-07 18:03:51,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:51,389 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:03:51,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617795523] [2019-12-07 18:03:51,389 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:51,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:51,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089979544] [2019-12-07 18:03:51,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:03:51,390 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:51,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:03:51,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:03:51,391 INFO L87 Difference]: Start difference. First operand 74883 states and 249122 transitions. Second operand 5 states. [2019-12-07 18:03:52,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:52,070 INFO L93 Difference]: Finished difference Result 104285 states and 339336 transitions. [2019-12-07 18:03:52,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:03:52,071 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 18:03:52,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:52,258 INFO L225 Difference]: With dead ends: 104285 [2019-12-07 18:03:52,258 INFO L226 Difference]: Without dead ends: 104269 [2019-12-07 18:03:52,259 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:03:52,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104269 states. [2019-12-07 18:03:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104269 to 83492. [2019-12-07 18:03:54,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83492 states. [2019-12-07 18:03:54,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83492 states to 83492 states and 276825 transitions. [2019-12-07 18:03:54,265 INFO L78 Accepts]: Start accepts. Automaton has 83492 states and 276825 transitions. Word has length 26 [2019-12-07 18:03:54,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:54,265 INFO L462 AbstractCegarLoop]: Abstraction has 83492 states and 276825 transitions. [2019-12-07 18:03:54,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:03:54,265 INFO L276 IsEmpty]: Start isEmpty. Operand 83492 states and 276825 transitions. [2019-12-07 18:03:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 18:03:54,289 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:54,289 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:54,289 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:54,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1458765979, now seen corresponding path program 1 times [2019-12-07 18:03:54,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:54,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631426933] [2019-12-07 18:03:54,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:54,343 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:03:54,343 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631426933] [2019-12-07 18:03:54,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:54,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:03:54,344 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228781470] [2019-12-07 18:03:54,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:03:54,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:54,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:03:54,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:03:54,344 INFO L87 Difference]: Start difference. First operand 83492 states and 276825 transitions. Second operand 6 states. [2019-12-07 18:03:54,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:54,468 INFO L93 Difference]: Finished difference Result 26075 states and 82369 transitions. [2019-12-07 18:03:54,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:03:54,468 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-07 18:03:54,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:54,498 INFO L225 Difference]: With dead ends: 26075 [2019-12-07 18:03:54,498 INFO L226 Difference]: Without dead ends: 20677 [2019-12-07 18:03:54,498 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:03:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20677 states. [2019-12-07 18:03:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20677 to 19505. [2019-12-07 18:03:54,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19505 states. [2019-12-07 18:03:54,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19505 states to 19505 states and 61090 transitions. [2019-12-07 18:03:54,777 INFO L78 Accepts]: Start accepts. Automaton has 19505 states and 61090 transitions. Word has length 29 [2019-12-07 18:03:54,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:54,777 INFO L462 AbstractCegarLoop]: Abstraction has 19505 states and 61090 transitions. [2019-12-07 18:03:54,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:03:54,777 INFO L276 IsEmpty]: Start isEmpty. Operand 19505 states and 61090 transitions. [2019-12-07 18:03:54,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-07 18:03:54,797 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:54,797 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:54,797 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:54,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:54,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1466756281, now seen corresponding path program 1 times [2019-12-07 18:03:54,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:54,798 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47038868] [2019-12-07 18:03:54,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:54,822 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:03:54,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47038868] [2019-12-07 18:03:54,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:54,823 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:54,823 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403302525] [2019-12-07 18:03:54,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:03:54,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:54,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:03:54,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:03:54,823 INFO L87 Difference]: Start difference. First operand 19505 states and 61090 transitions. Second operand 3 states. [2019-12-07 18:03:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:54,917 INFO L93 Difference]: Finished difference Result 21094 states and 62506 transitions. [2019-12-07 18:03:54,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:03:54,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-12-07 18:03:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:54,943 INFO L225 Difference]: With dead ends: 21094 [2019-12-07 18:03:54,943 INFO L226 Difference]: Without dead ends: 21094 [2019-12-07 18:03:54,943 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:03:54,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21094 states. [2019-12-07 18:03:55,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21094 to 20040. [2019-12-07 18:03:55,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20040 states. [2019-12-07 18:03:55,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20040 states to 20040 states and 59981 transitions. [2019-12-07 18:03:55,255 INFO L78 Accepts]: Start accepts. Automaton has 20040 states and 59981 transitions. Word has length 37 [2019-12-07 18:03:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:55,255 INFO L462 AbstractCegarLoop]: Abstraction has 20040 states and 59981 transitions. [2019-12-07 18:03:55,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:03:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 20040 states and 59981 transitions. [2019-12-07 18:03:55,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:03:55,271 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:55,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:55,271 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:55,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:55,272 INFO L82 PathProgramCache]: Analyzing trace with hash 102427512, now seen corresponding path program 1 times [2019-12-07 18:03:55,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:55,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947966875] [2019-12-07 18:03:55,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:55,339 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:03:55,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947966875] [2019-12-07 18:03:55,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:55,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:55,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259809362] [2019-12-07 18:03:55,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:03:55,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:55,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:03:55,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:03:55,341 INFO L87 Difference]: Start difference. First operand 20040 states and 59981 transitions. Second operand 5 states. [2019-12-07 18:03:55,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:55,643 INFO L93 Difference]: Finished difference Result 22121 states and 64870 transitions. [2019-12-07 18:03:55,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:03:55,643 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 18:03:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:55,667 INFO L225 Difference]: With dead ends: 22121 [2019-12-07 18:03:55,667 INFO L226 Difference]: Without dead ends: 22120 [2019-12-07 18:03:55,668 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:03:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22120 states. [2019-12-07 18:03:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22120 to 17836. [2019-12-07 18:03:55,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17836 states. [2019-12-07 18:03:55,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17836 states to 17836 states and 53732 transitions. [2019-12-07 18:03:55,929 INFO L78 Accepts]: Start accepts. Automaton has 17836 states and 53732 transitions. Word has length 40 [2019-12-07 18:03:55,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:55,929 INFO L462 AbstractCegarLoop]: Abstraction has 17836 states and 53732 transitions. [2019-12-07 18:03:55,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:03:55,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17836 states and 53732 transitions. [2019-12-07 18:03:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-07 18:03:55,946 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:55,946 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] [2019-12-07 18:03:55,946 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:55,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:55,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1066912394, now seen corresponding path program 1 times [2019-12-07 18:03:55,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:55,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669744158] [2019-12-07 18:03:55,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:55,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:56,028 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:03:56,028 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669744158] [2019-12-07 18:03:56,028 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:56,028 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:03:56,028 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539128746] [2019-12-07 18:03:56,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:03:56,029 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:56,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:03:56,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:03:56,029 INFO L87 Difference]: Start difference. First operand 17836 states and 53732 transitions. Second operand 6 states. [2019-12-07 18:03:56,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:56,177 INFO L93 Difference]: Finished difference Result 28952 states and 87156 transitions. [2019-12-07 18:03:56,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:03:56,177 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2019-12-07 18:03:56,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:56,206 INFO L225 Difference]: With dead ends: 28952 [2019-12-07 18:03:56,206 INFO L226 Difference]: Without dead ends: 23653 [2019-12-07 18:03:56,207 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:03:56,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23653 states. [2019-12-07 18:03:56,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23653 to 22520. [2019-12-07 18:03:56,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22520 states. [2019-12-07 18:03:56,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22520 states to 22520 states and 68958 transitions. [2019-12-07 18:03:56,503 INFO L78 Accepts]: Start accepts. Automaton has 22520 states and 68958 transitions. Word has length 48 [2019-12-07 18:03:56,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:56,504 INFO L462 AbstractCegarLoop]: Abstraction has 22520 states and 68958 transitions. [2019-12-07 18:03:56,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:03:56,504 INFO L276 IsEmpty]: Start isEmpty. Operand 22520 states and 68958 transitions. [2019-12-07 18:03:56,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:03:56,528 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:56,528 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] [2019-12-07 18:03:56,528 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:56,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:56,528 INFO L82 PathProgramCache]: Analyzing trace with hash 951052415, now seen corresponding path program 1 times [2019-12-07 18:03:56,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:56,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907945709] [2019-12-07 18:03:56,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:56,572 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:03:56,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907945709] [2019-12-07 18:03:56,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:56,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:56,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482102844] [2019-12-07 18:03:56,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:03:56,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:56,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:03:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:03:56,573 INFO L87 Difference]: Start difference. First operand 22520 states and 68958 transitions. Second operand 4 states. [2019-12-07 18:03:56,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:56,656 INFO L93 Difference]: Finished difference Result 26717 states and 78858 transitions. [2019-12-07 18:03:56,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:03:56,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:03:56,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:56,686 INFO L225 Difference]: With dead ends: 26717 [2019-12-07 18:03:56,686 INFO L226 Difference]: Without dead ends: 22463 [2019-12-07 18:03:56,686 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:03:56,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22463 states. [2019-12-07 18:03:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22463 to 22443. [2019-12-07 18:03:56,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22443 states. [2019-12-07 18:03:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22443 states to 22443 states and 68579 transitions. [2019-12-07 18:03:56,998 INFO L78 Accepts]: Start accepts. Automaton has 22443 states and 68579 transitions. Word has length 49 [2019-12-07 18:03:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:56,998 INFO L462 AbstractCegarLoop]: Abstraction has 22443 states and 68579 transitions. [2019-12-07 18:03:56,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:03:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 22443 states and 68579 transitions. [2019-12-07 18:03:57,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-07 18:03:57,022 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:57,022 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] [2019-12-07 18:03:57,022 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:57,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:57,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1087901893, now seen corresponding path program 2 times [2019-12-07 18:03:57,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:57,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340091266] [2019-12-07 18:03:57,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:57,081 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:03:57,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340091266] [2019-12-07 18:03:57,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:57,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:57,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661021507] [2019-12-07 18:03:57,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:03:57,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:57,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:03:57,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:03:57,082 INFO L87 Difference]: Start difference. First operand 22443 states and 68579 transitions. Second operand 4 states. [2019-12-07 18:03:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:57,191 INFO L93 Difference]: Finished difference Result 33718 states and 98289 transitions. [2019-12-07 18:03:57,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:03:57,191 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-12-07 18:03:57,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:57,212 INFO L225 Difference]: With dead ends: 33718 [2019-12-07 18:03:57,213 INFO L226 Difference]: Without dead ends: 17093 [2019-12-07 18:03:57,213 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:03:57,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17093 states. [2019-12-07 18:03:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17093 to 16982. [2019-12-07 18:03:57,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16982 states. [2019-12-07 18:03:57,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16982 states to 16982 states and 43612 transitions. [2019-12-07 18:03:57,485 INFO L78 Accepts]: Start accepts. Automaton has 16982 states and 43612 transitions. Word has length 49 [2019-12-07 18:03:57,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:57,485 INFO L462 AbstractCegarLoop]: Abstraction has 16982 states and 43612 transitions. [2019-12-07 18:03:57,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:03:57,485 INFO L276 IsEmpty]: Start isEmpty. Operand 16982 states and 43612 transitions. [2019-12-07 18:03:57,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:03:57,497 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:57,497 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:57,498 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:57,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:57,498 INFO L82 PathProgramCache]: Analyzing trace with hash 775370005, now seen corresponding path program 1 times [2019-12-07 18:03:57,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:57,498 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347487213] [2019-12-07 18:03:57,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:57,554 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:03:57,555 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347487213] [2019-12-07 18:03:57,555 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:57,555 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:57,555 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608499226] [2019-12-07 18:03:57,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:03:57,555 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:57,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:03:57,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:03:57,556 INFO L87 Difference]: Start difference. First operand 16982 states and 43612 transitions. Second operand 4 states. [2019-12-07 18:03:57,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:57,628 INFO L93 Difference]: Finished difference Result 22993 states and 56939 transitions. [2019-12-07 18:03:57,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:03:57,628 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:03:57,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:57,648 INFO L225 Difference]: With dead ends: 22993 [2019-12-07 18:03:57,648 INFO L226 Difference]: Without dead ends: 22747 [2019-12-07 18:03:57,649 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:03:57,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22747 states. [2019-12-07 18:03:57,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22747 to 17809. [2019-12-07 18:03:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17809 states. [2019-12-07 18:03:57,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17809 states to 17809 states and 45354 transitions. [2019-12-07 18:03:57,871 INFO L78 Accepts]: Start accepts. Automaton has 17809 states and 45354 transitions. Word has length 50 [2019-12-07 18:03:57,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:57,871 INFO L462 AbstractCegarLoop]: Abstraction has 17809 states and 45354 transitions. [2019-12-07 18:03:57,871 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:03:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 17809 states and 45354 transitions. [2019-12-07 18:03:57,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:03:57,886 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:57,886 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:57,886 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:57,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:57,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1509636781, now seen corresponding path program 2 times [2019-12-07 18:03:57,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:57,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788711838] [2019-12-07 18:03:57,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:57,927 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:03:57,928 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788711838] [2019-12-07 18:03:57,928 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:57,928 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:03:57,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108238377] [2019-12-07 18:03:57,928 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:03:57,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:57,929 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:03:57,929 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:03:57,929 INFO L87 Difference]: Start difference. First operand 17809 states and 45354 transitions. Second operand 4 states. [2019-12-07 18:03:57,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:57,994 INFO L93 Difference]: Finished difference Result 23922 states and 58890 transitions. [2019-12-07 18:03:57,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:03:57,994 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-12-07 18:03:57,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:58,010 INFO L225 Difference]: With dead ends: 23922 [2019-12-07 18:03:58,010 INFO L226 Difference]: Without dead ends: 16204 [2019-12-07 18:03:58,010 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:03:58,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16204 states. [2019-12-07 18:03:58,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16204 to 16115. [2019-12-07 18:03:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16115 states. [2019-12-07 18:03:58,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16115 states to 16115 states and 37120 transitions. [2019-12-07 18:03:58,183 INFO L78 Accepts]: Start accepts. Automaton has 16115 states and 37120 transitions. Word has length 50 [2019-12-07 18:03:58,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:58,184 INFO L462 AbstractCegarLoop]: Abstraction has 16115 states and 37120 transitions. [2019-12-07 18:03:58,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:03:58,184 INFO L276 IsEmpty]: Start isEmpty. Operand 16115 states and 37120 transitions. [2019-12-07 18:03:58,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 18:03:58,196 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:58,196 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:58,196 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:58,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:58,196 INFO L82 PathProgramCache]: Analyzing trace with hash -133447137, now seen corresponding path program 3 times [2019-12-07 18:03:58,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:58,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494952160] [2019-12-07 18:03:58,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:58,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:03:58,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494952160] [2019-12-07 18:03:58,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:58,256 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:03:58,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394151225] [2019-12-07 18:03:58,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:03:58,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:58,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:03:58,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:03:58,257 INFO L87 Difference]: Start difference. First operand 16115 states and 37120 transitions. Second operand 7 states. [2019-12-07 18:03:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:58,355 INFO L93 Difference]: Finished difference Result 14406 states and 33434 transitions. [2019-12-07 18:03:58,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 18:03:58,356 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 50 [2019-12-07 18:03:58,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:58,356 INFO L225 Difference]: With dead ends: 14406 [2019-12-07 18:03:58,356 INFO L226 Difference]: Without dead ends: 555 [2019-12-07 18:03:58,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:03:58,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-12-07 18:03:58,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-12-07 18:03:58,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-12-07 18:03:58,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 1123 transitions. [2019-12-07 18:03:58,361 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 1123 transitions. Word has length 50 [2019-12-07 18:03:58,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:58,362 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 1123 transitions. [2019-12-07 18:03:58,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:03:58,362 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 1123 transitions. [2019-12-07 18:03:58,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:03:58,362 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:58,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:58,362 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:58,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:58,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1960507102, now seen corresponding path program 1 times [2019-12-07 18:03:58,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:58,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977196541] [2019-12-07 18:03:58,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:03:58,443 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:03:58,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977196541] [2019-12-07 18:03:58,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:03:58,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:03:58,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774278758] [2019-12-07 18:03:58,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:03:58,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:03:58,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:03:58,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:03:58,444 INFO L87 Difference]: Start difference. First operand 555 states and 1123 transitions. Second operand 7 states. [2019-12-07 18:03:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:03:58,612 INFO L93 Difference]: Finished difference Result 1162 states and 2339 transitions. [2019-12-07 18:03:58,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:03:58,612 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-07 18:03:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:03:58,613 INFO L225 Difference]: With dead ends: 1162 [2019-12-07 18:03:58,613 INFO L226 Difference]: Without dead ends: 847 [2019-12-07 18:03:58,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:03:58,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 847 states. [2019-12-07 18:03:58,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 847 to 631. [2019-12-07 18:03:58,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 631 states. [2019-12-07 18:03:58,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 631 states to 631 states and 1247 transitions. [2019-12-07 18:03:58,619 INFO L78 Accepts]: Start accepts. Automaton has 631 states and 1247 transitions. Word has length 66 [2019-12-07 18:03:58,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:03:58,619 INFO L462 AbstractCegarLoop]: Abstraction has 631 states and 1247 transitions. [2019-12-07 18:03:58,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:03:58,619 INFO L276 IsEmpty]: Start isEmpty. Operand 631 states and 1247 transitions. [2019-12-07 18:03:58,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 18:03:58,620 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:03:58,620 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:03:58,620 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:03:58,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:03:58,620 INFO L82 PathProgramCache]: Analyzing trace with hash -1469521026, now seen corresponding path program 2 times [2019-12-07 18:03:58,620 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:03:58,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337746513] [2019-12-07 18:03:58,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:03:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:03:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:03:58,708 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:03:58,708 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:03:58,710 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_ULTIMATE.start_main_~#t525~0.offset_23| 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t525~0.base_34| 4) |v_#length_27|) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t525~0.base_34|) 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t525~0.base_34| 1)) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t525~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t525~0.base_34|) |v_ULTIMATE.start_main_~#t525~0.offset_23| 0)) |v_#memory_int_25|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t525~0.base_34|) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t527~0.base=|v_ULTIMATE.start_main_~#t527~0.base_28|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t528~0.base=|v_ULTIMATE.start_main_~#t528~0.base_22|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t526~0.offset=|v_ULTIMATE.start_main_~#t526~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ULTIMATE.start_main_~#t527~0.offset=|v_ULTIMATE.start_main_~#t527~0.offset_17|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t528~0.offset=|v_ULTIMATE.start_main_~#t528~0.offset_16|, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ULTIMATE.start_main_~#t526~0.base=|v_ULTIMATE.start_main_~#t526~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t525~0.offset=|v_ULTIMATE.start_main_~#t525~0.offset_23|, ULTIMATE.start_main_~#t525~0.base=|v_ULTIMATE.start_main_~#t525~0.base_34|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t527~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t528~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t526~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t527~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t528~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t526~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t525~0.offset, ULTIMATE.start_main_~#t525~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:03:58,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t526~0.base_11| 4)) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t526~0.base_11| 1)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t526~0.base_11|) 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t526~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t526~0.base_11|) |v_ULTIMATE.start_main_~#t526~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t526~0.base_11|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t526~0.base_11|) (= |v_ULTIMATE.start_main_~#t526~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t526~0.base=|v_ULTIMATE.start_main_~#t526~0.base_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t526~0.offset=|v_ULTIMATE.start_main_~#t526~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t526~0.base, #length, ULTIMATE.start_main_~#t526~0.offset] because there is no mapped edge [2019-12-07 18:03:58,711 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t527~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t527~0.base_11|) |v_ULTIMATE.start_main_~#t527~0.offset_11| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t527~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t527~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t527~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t527~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t527~0.base_11|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t527~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t527~0.offset=|v_ULTIMATE.start_main_~#t527~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t527~0.base=|v_ULTIMATE.start_main_~#t527~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t527~0.offset, #length, ULTIMATE.start_main_~#t527~0.base] because there is no mapped edge [2019-12-07 18:03:58,712 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t528~0.base_9| 1) |v_#valid_35|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t528~0.base_9| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t528~0.base_9|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t528~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t528~0.base_9|) |v_ULTIMATE.start_main_~#t528~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t528~0.base_9|) (= |v_ULTIMATE.start_main_~#t528~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t528~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t528~0.base=|v_ULTIMATE.start_main_~#t528~0.base_9|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t528~0.offset=|v_ULTIMATE.start_main_~#t528~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t528~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t528~0.offset, #length] because there is no mapped edge [2019-12-07 18:03:58,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z~0_In-1858744388 ~z$mem_tmp~0_Out-1858744388) (= ~weak$$choice0~0_Out-1858744388 |P3Thread1of1ForFork2_#t~nondet26_In-1858744388|) (= ~z$r_buff1_thd3~0_Out-1858744388 ~z$r_buff0_thd3~0_In-1858744388) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1858744388)) (= ~weak$$choice2~0_Out-1858744388 ~z$flush_delayed~0_Out-1858744388) (= ~z$r_buff1_thd1~0_Out-1858744388 ~z$r_buff0_thd1~0_In-1858744388) (= ~z$r_buff0_thd0~0_In-1858744388 ~z$r_buff1_thd0~0_Out-1858744388) (= ~z$r_buff0_thd4~0_Out-1858744388 1) (= ~z$r_buff1_thd4~0_Out-1858744388 ~z$r_buff0_thd4~0_In-1858744388) (= |P3Thread1of1ForFork2_#t~nondet27_In-1858744388| ~weak$$choice2~0_Out-1858744388) (= ~z$r_buff1_thd2~0_Out-1858744388 ~z$r_buff0_thd2~0_In-1858744388)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-1858744388|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-1858744388|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858744388, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1858744388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1858744388, ~z~0=~z~0_In-1858744388, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1858744388, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1858744388} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-1858744388|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-1858744388, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-1858744388|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1858744388, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1858744388, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1858744388, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1858744388, ~z$flush_delayed~0=~z$flush_delayed~0_Out-1858744388, ~weak$$choice0~0=~weak$$choice0~0_Out-1858744388, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858744388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1858744388, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1858744388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1858744388, ~z~0=~z~0_In-1858744388, ~weak$$choice2~0=~weak$$choice2~0_Out-1858744388, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1858744388, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:03:58,713 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1169645616 256) 0)) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1169645616| |P3Thread1of1ForFork2_#t~ite28_Out-1169645616|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1169645616 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In-1169645616 |P3Thread1of1ForFork2_#t~ite28_Out-1169645616|) (or .cse1 .cse2)) (and (not .cse2) .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-1169645616| ~z$w_buff0~0_In-1169645616) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1169645616, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169645616, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1169645616, ~z$w_buff1~0=~z$w_buff1~0_In-1169645616} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1169645616|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1169645616|, ~z$w_buff0~0=~z$w_buff0~0_In-1169645616, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169645616, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1169645616, ~z$w_buff1~0=~z$w_buff1~0_In-1169645616} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:03:58,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:03:58,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1931179487 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1931179487| ~z$mem_tmp~0_In1931179487)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1931179487| ~z~0_In1931179487)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1931179487, ~z$flush_delayed~0=~z$flush_delayed~0_In1931179487, ~z~0=~z~0_In1931179487} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1931179487, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1931179487|, ~z$flush_delayed~0=~z$flush_delayed~0_In1931179487, ~z~0=~z~0_In1931179487} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:03:58,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 18:03:58,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:03:58,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2144081535 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-2144081535 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-2144081535| ~z$w_buff0_used~0_In-2144081535)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-2144081535| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144081535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2144081535} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2144081535|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144081535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2144081535} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:03:58,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1281823070 256) 0))) (or (and (= ~z$mem_tmp~0_In-1281823070 |P2Thread1of1ForFork1_#t~ite25_Out-1281823070|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-1281823070| ~z~0_In-1281823070)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1281823070, ~z$flush_delayed~0=~z$flush_delayed~0_In-1281823070, ~z~0=~z~0_In-1281823070} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1281823070, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1281823070|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1281823070, ~z~0=~z~0_In-1281823070} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:03:58,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1703162264 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1703162264 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1703162264 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1703162264 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1703162264| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-1703162264| ~z$w_buff1_used~0_In-1703162264) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1703162264, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1703162264} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1703162264|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1703162264, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1703162264} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:03:58,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In232769166 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In232769166 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In232769166 ~z$r_buff0_thd4~0_Out232769166))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out232769166) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In232769166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In232769166} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out232769166|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In232769166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out232769166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:03:58,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-313546918 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-313546918 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-313546918 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-313546918 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-313546918| ~z$r_buff1_thd4~0_In-313546918) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-313546918| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-313546918} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-313546918|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-313546918} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:03:58,726 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:03:58,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:03:58,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:03:58,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In554329280 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In554329280 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out554329280| ~z~0_In554329280) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out554329280| ~z$w_buff1~0_In554329280) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In554329280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In554329280, ~z$w_buff1~0=~z$w_buff1~0_In554329280, ~z~0=~z~0_In554329280} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In554329280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In554329280, ~z$w_buff1~0=~z$w_buff1~0_In554329280, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out554329280|, ~z~0=~z~0_In554329280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:03:58,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:03:58,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1612300402 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1612300402 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1612300402|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1612300402 |ULTIMATE.start_main_#t~ite61_Out1612300402|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1612300402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1612300402} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1612300402, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1612300402|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:03:58,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In369741545 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In369741545 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In369741545 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In369741545 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out369741545| ~z$w_buff1_used~0_In369741545) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite62_Out369741545| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In369741545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In369741545, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In369741545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In369741545} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out369741545|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In369741545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In369741545, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In369741545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In369741545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:03:58,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2135930166 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2135930166 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out2135930166|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In2135930166 |ULTIMATE.start_main_#t~ite63_Out2135930166|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2135930166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:03:58,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In2114768361 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2114768361 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2114768361 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2114768361 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out2114768361| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out2114768361| ~z$r_buff1_thd0~0_In2114768361) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2114768361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2114768361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2114768361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2114768361} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2114768361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2114768361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2114768361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2114768361, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2114768361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:03:58,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:03:58,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:03:58 BasicIcfg [2019-12-07 18:03:58,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:03:58,798 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:03:58,798 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:03:58,798 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:03:58,799 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:02:34" (3/4) ... [2019-12-07 18:03:58,800 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:03:58,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L851: Formula: (let ((.cse0 (store |v_#valid_85| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= v_~z$r_buff0_thd2~0_131 0) (= 0 v_~z$flush_delayed~0_223) (= |v_ULTIMATE.start_main_~#t525~0.offset_23| 0) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t525~0.base_34| 4) |v_#length_27|) (= 0 v_~__unbuffered_p3_EAX~0_84) (= |v_#NULL.offset_6| 0) (= v_~z$w_buff1~0_366 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t525~0.base_34|) 0) (= v_~z$r_buff0_thd0~0_214 0) (= v_~z$r_buff1_thd2~0_149 0) (= |v_#valid_83| (store .cse0 |v_ULTIMATE.start_main_~#t525~0.base_34| 1)) (= v_~z$read_delayed~0_8 0) (= v_~z$r_buff1_thd1~0_149 0) (= v_~z$read_delayed_var~0.base_8 0) (= v_~main$tmp_guard1~0_56 0) (= v_~z$r_buff0_thd1~0_132 0) (= 0 v_~z$r_buff1_thd4~0_351) (= (store |v_#memory_int_26| |v_ULTIMATE.start_main_~#t525~0.base_34| (store (select |v_#memory_int_26| |v_ULTIMATE.start_main_~#t525~0.base_34|) |v_ULTIMATE.start_main_~#t525~0.offset_23| 0)) |v_#memory_int_25|) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t525~0.base_34|) (= v_~a~0_48 0) (= 0 v_~z$mem_tmp~0_195) (= 0 |v_#NULL.base_6|) (= v_~z$w_buff1_used~0_712 0) (= v_~z$r_buff1_thd0~0_223 0) (= 0 v_~__unbuffered_p2_EAX~0_71) (< 0 |v_#StackHeapBarrier_20|) (= v_~z$w_buff0~0_640 0) (= v_~main$tmp_guard0~0_47 0) (= 0 v_~__unbuffered_p3_EBX~0_61) (= v_~y~0_94 0) (= 0 v_~z$r_buff0_thd3~0_453) (= v_~z$w_buff0_used~0_1093 0) (= v_~weak$$choice2~0_273 0) (= 0 v_~weak$$choice0~0_182) (= 0 v_~z$r_buff0_thd4~0_575) (= v_~z~0_310 0) (= 0 v_~__unbuffered_p0_EAX~0_80) (= 0 v_~z$r_buff1_thd3~0_381) (= v_~z$read_delayed_var~0.offset_8 0) (= v_~x~0_47 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_85|, #memory_int=|v_#memory_int_26|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_7|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_7|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_149, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_~#t527~0.base=|v_ULTIMATE.start_main_~#t527~0.base_28|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_111|, ~a~0=v_~a~0_48, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_214, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_80, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_575, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_84, #length=|v_#length_27|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_71, ~z$mem_tmp~0=v_~z$mem_tmp~0_195, ULTIMATE.start_main_~#t528~0.base=|v_ULTIMATE.start_main_~#t528~0.base_22|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_712, ~z$flush_delayed~0=v_~z$flush_delayed~0_223, ULTIMATE.start_main_~#t526~0.offset=|v_ULTIMATE.start_main_~#t526~0.offset_24|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_43|, ~weak$$choice0~0=v_~weak$$choice0~0_182, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_183|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_149, ULTIMATE.start_main_~#t527~0.offset=|v_ULTIMATE.start_main_~#t527~0.offset_17|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_453, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ~x~0=v_~x~0_47, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_351, ULTIMATE.start_main_#t~nondet58=|v_ULTIMATE.start_main_#t~nondet58_24|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t528~0.offset=|v_ULTIMATE.start_main_~#t528~0.offset_16|, ~z$w_buff1~0=v_~z$w_buff1~0_366, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_223, ULTIMATE.start_main_~#t526~0.base=|v_ULTIMATE.start_main_~#t526~0.base_36|, ~y~0=v_~y~0_94, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_131, ULTIMATE.start_main_~#t525~0.offset=|v_ULTIMATE.start_main_~#t525~0.offset_23|, ULTIMATE.start_main_~#t525~0.base=|v_ULTIMATE.start_main_~#t525~0.base_34|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_1093, ~z$w_buff0~0=v_~z$w_buff0~0_640, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_381, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_51|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_47, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_61, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_37|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_58|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_29|, #valid=|v_#valid_83|, #memory_int=|v_#memory_int_25|, ~z~0=v_~z~0_310, ~weak$$choice2~0=v_~weak$$choice2~0_273, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_132} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ~z$r_buff1_thd2~0, #NULL.offset, ULTIMATE.start_main_~#t527~0.base, ULTIMATE.start_main_#t~ite64, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t528~0.base, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_~#t526~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_~#t527~0.offset, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~nondet58, ULTIMATE.start_main_#t~nondet56, ~z$read_delayed~0, ULTIMATE.start_main_~#t528~0.offset, ~z$w_buff1~0, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t526~0.base, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t525~0.offset, ULTIMATE.start_main_~#t525~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-07 18:03:58,801 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1031] [1031] L851-1-->L853: Formula: (and (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t526~0.base_11| 4)) (= |v_#valid_45| (store |v_#valid_46| |v_ULTIMATE.start_main_~#t526~0.base_11| 1)) (= (select |v_#valid_46| |v_ULTIMATE.start_main_~#t526~0.base_11|) 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t526~0.base_11| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t526~0.base_11|) |v_ULTIMATE.start_main_~#t526~0.offset_10| 1)) |v_#memory_int_21|) (not (= 0 |v_ULTIMATE.start_main_~#t526~0.base_11|)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t526~0.base_11|) (= |v_ULTIMATE.start_main_~#t526~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_5|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t526~0.base=|v_ULTIMATE.start_main_~#t526~0.base_11|, #length=|v_#length_23|, ULTIMATE.start_main_~#t526~0.offset=|v_ULTIMATE.start_main_~#t526~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t526~0.base, #length, ULTIMATE.start_main_~#t526~0.offset] because there is no mapped edge [2019-12-07 18:03:58,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1030] [1030] L853-1-->L855: Formula: (and (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t527~0.base_11| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t527~0.base_11|) |v_ULTIMATE.start_main_~#t527~0.offset_11| 2)) |v_#memory_int_19|) (= 0 |v_ULTIMATE.start_main_~#t527~0.offset_11|) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t527~0.base_11| 4) |v_#length_21|) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t527~0.base_11|)) (not (= |v_ULTIMATE.start_main_~#t527~0.base_11| 0)) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t527~0.base_11|) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t527~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_43|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_5|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_~#t527~0.offset=|v_ULTIMATE.start_main_~#t527~0.offset_11|, #length=|v_#length_21|, ULTIMATE.start_main_~#t527~0.base=|v_ULTIMATE.start_main_~#t527~0.base_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet56, #memory_int, ULTIMATE.start_main_~#t527~0.offset, #length, ULTIMATE.start_main_~#t527~0.base] because there is no mapped edge [2019-12-07 18:03:58,802 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L855-1-->L857: Formula: (and (= (store |v_#valid_36| |v_ULTIMATE.start_main_~#t528~0.base_9| 1) |v_#valid_35|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t528~0.base_9| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t528~0.base_9|) 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t528~0.base_9| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t528~0.base_9|) |v_ULTIMATE.start_main_~#t528~0.offset_8| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t528~0.base_9|) (= |v_ULTIMATE.start_main_~#t528~0.offset_8| 0) (not (= 0 |v_ULTIMATE.start_main_~#t528~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t528~0.base=|v_ULTIMATE.start_main_~#t528~0.base_9|, ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_4|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_~#t528~0.offset=|v_ULTIMATE.start_main_~#t528~0.offset_8|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t528~0.base, ULTIMATE.start_main_#t~nondet57, #valid, #memory_int, ULTIMATE.start_main_~#t528~0.offset, #length] because there is no mapped edge [2019-12-07 18:03:58,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L4-->L813: Formula: (and (= ~z~0_In-1858744388 ~z$mem_tmp~0_Out-1858744388) (= ~weak$$choice0~0_Out-1858744388 |P3Thread1of1ForFork2_#t~nondet26_In-1858744388|) (= ~z$r_buff1_thd3~0_Out-1858744388 ~z$r_buff0_thd3~0_In-1858744388) (not (= 0 P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1858744388)) (= ~weak$$choice2~0_Out-1858744388 ~z$flush_delayed~0_Out-1858744388) (= ~z$r_buff1_thd1~0_Out-1858744388 ~z$r_buff0_thd1~0_In-1858744388) (= ~z$r_buff0_thd0~0_In-1858744388 ~z$r_buff1_thd0~0_Out-1858744388) (= ~z$r_buff0_thd4~0_Out-1858744388 1) (= ~z$r_buff1_thd4~0_Out-1858744388 ~z$r_buff0_thd4~0_In-1858744388) (= |P3Thread1of1ForFork2_#t~nondet27_In-1858744388| ~weak$$choice2~0_Out-1858744388) (= ~z$r_buff1_thd2~0_Out-1858744388 ~z$r_buff0_thd2~0_In-1858744388)) InVars {P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_In-1858744388|, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_In-1858744388|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858744388, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1858744388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1858744388, ~z~0=~z~0_In-1858744388, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1858744388, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1858744388} OutVars{P3Thread1of1ForFork2_#t~nondet26=|P3Thread1of1ForFork2_#t~nondet26_Out-1858744388|, ~z$mem_tmp~0=~z$mem_tmp~0_Out-1858744388, P3Thread1of1ForFork2_#t~nondet27=|P3Thread1of1ForFork2_#t~nondet27_Out-1858744388|, P3Thread1of1ForFork2___VERIFIER_assert_~expression=P3Thread1of1ForFork2___VERIFIER_assert_~expression_In-1858744388, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out-1858744388, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out-1858744388, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out-1858744388, ~z$flush_delayed~0=~z$flush_delayed~0_Out-1858744388, ~weak$$choice0~0=~weak$$choice0~0_Out-1858744388, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1858744388, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out-1858744388, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out-1858744388, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-1858744388, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1858744388, ~z~0=~z~0_In-1858744388, ~weak$$choice2~0=~weak$$choice2~0_Out-1858744388, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1858744388, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1858744388} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~nondet26, ~z$mem_tmp~0, P3Thread1of1ForFork2_#t~nondet27, ~weak$$choice0~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd4~0, ~z$flush_delayed~0, ~weak$$choice2~0] because there is no mapped edge [2019-12-07 18:03:58,803 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L813-2-->L813-5: Formula: (let ((.cse2 (= (mod ~z$w_buff0_used~0_In-1169645616 256) 0)) (.cse0 (= |P3Thread1of1ForFork2_#t~ite29_Out-1169645616| |P3Thread1of1ForFork2_#t~ite28_Out-1169645616|)) (.cse1 (= (mod ~z$r_buff0_thd4~0_In-1169645616 256) 0))) (or (and .cse0 (= ~z$w_buff1~0_In-1169645616 |P3Thread1of1ForFork2_#t~ite28_Out-1169645616|) (or .cse1 .cse2)) (and (not .cse2) .cse0 (= |P3Thread1of1ForFork2_#t~ite28_Out-1169645616| ~z$w_buff0~0_In-1169645616) (not .cse1)))) InVars {~z$w_buff0~0=~z$w_buff0~0_In-1169645616, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169645616, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1169645616, ~z$w_buff1~0=~z$w_buff1~0_In-1169645616} OutVars{P3Thread1of1ForFork2_#t~ite29=|P3Thread1of1ForFork2_#t~ite29_Out-1169645616|, P3Thread1of1ForFork2_#t~ite28=|P3Thread1of1ForFork2_#t~ite28_Out-1169645616|, ~z$w_buff0~0=~z$w_buff0~0_In-1169645616, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1169645616, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1169645616, ~z$w_buff1~0=~z$w_buff1~0_In-1169645616} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite29, P3Thread1of1ForFork2_#t~ite28] because there is no mapped edge [2019-12-07 18:03:58,806 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L818-->L819: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_61 256))) (= v_~z$r_buff0_thd4~0_131 v_~z$r_buff0_thd4~0_130)) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_131, ~weak$$choice2~0=v_~weak$$choice2~0_61} OutVars{P3Thread1of1ForFork2_#t~ite42=|v_P3Thread1of1ForFork2_#t~ite42_10|, P3Thread1of1ForFork2_#t~ite43=|v_P3Thread1of1ForFork2_#t~ite43_9|, P3Thread1of1ForFork2_#t~ite44=|v_P3Thread1of1ForFork2_#t~ite44_9|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_130, ~weak$$choice2~0=v_~weak$$choice2~0_61} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite42, P3Thread1of1ForFork2_#t~ite43, P3Thread1of1ForFork2_#t~ite44, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:03:58,807 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In1931179487 256) 0))) (or (and (not .cse0) (= |P3Thread1of1ForFork2_#t~ite48_Out1931179487| ~z$mem_tmp~0_In1931179487)) (and .cse0 (= |P3Thread1of1ForFork2_#t~ite48_Out1931179487| ~z~0_In1931179487)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1931179487, ~z$flush_delayed~0=~z$flush_delayed~0_In1931179487, ~z~0=~z~0_In1931179487} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1931179487, P3Thread1of1ForFork2_#t~ite48=|P3Thread1of1ForFork2_#t~ite48_Out1931179487|, ~z$flush_delayed~0=~z$flush_delayed~0_In1931179487, ~z~0=~z~0_In1931179487} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite48] because there is no mapped edge [2019-12-07 18:03:58,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] P0ENTRY-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork3_#res.base_3|) (= |v_P0Thread1of1ForFork3_#in~arg.offset_12| v_P0Thread1of1ForFork3_~arg.offset_10) (= v_P0Thread1of1ForFork3_~arg.base_10 |v_P0Thread1of1ForFork3_#in~arg.base_12|) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= v_~a~0_15 1) (= |v_P0Thread1of1ForFork3_#res.offset_3| 0) (= v_~x~0_17 v_~__unbuffered_p0_EAX~0_19)) InVars {P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} OutVars{~a~0=v_~a~0_15, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_19, P0Thread1of1ForFork3_#in~arg.offset=|v_P0Thread1of1ForFork3_#in~arg.offset_12|, P0Thread1of1ForFork3_~arg.base=v_P0Thread1of1ForFork3_~arg.base_10, P0Thread1of1ForFork3_#res.base=|v_P0Thread1of1ForFork3_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork3_#res.offset=|v_P0Thread1of1ForFork3_#res.offset_3|, P0Thread1of1ForFork3_~arg.offset=v_P0Thread1of1ForFork3_~arg.offset_10, P0Thread1of1ForFork3_#in~arg.base=|v_P0Thread1of1ForFork3_#in~arg.base_12|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork3_~arg.base, P0Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork3_#res.offset, P0Thread1of1ForFork3_~arg.offset] because there is no mapped edge [2019-12-07 18:03:58,808 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_P1Thread1of1ForFork0_~arg.base_4 |v_P1Thread1of1ForFork0_#in~arg.base_6|) (= v_~y~0_35 1) (= (+ v_~__unbuffered_cnt~0_41 1) v_~__unbuffered_cnt~0_40) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= v_P1Thread1of1ForFork0_~arg.offset_4 |v_P1Thread1of1ForFork0_#in~arg.offset_6|) (= 1 v_~x~0_8)) InVars {P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41} OutVars{P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_4, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_4, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_6|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_40, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~y~0=v_~y~0_35, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|, ~x~0=v_~x~0_8} AuxVars[] AssignedVars[P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, ~y~0, P1Thread1of1ForFork0_#res.base, ~x~0] because there is no mapped edge [2019-12-07 18:03:58,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [985] [985] L829-->L829-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-2144081535 256))) (.cse0 (= (mod ~z$r_buff0_thd4~0_In-2144081535 256) 0))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite51_Out-2144081535| ~z$w_buff0_used~0_In-2144081535)) (and (not .cse1) (not .cse0) (= |P3Thread1of1ForFork2_#t~ite51_Out-2144081535| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144081535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2144081535} OutVars{P3Thread1of1ForFork2_#t~ite51=|P3Thread1of1ForFork2_#t~ite51_Out-2144081535|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-2144081535, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-2144081535} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite51] because there is no mapped edge [2019-12-07 18:03:58,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [972] [972] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~z$flush_delayed~0_In-1281823070 256) 0))) (or (and (= ~z$mem_tmp~0_In-1281823070 |P2Thread1of1ForFork1_#t~ite25_Out-1281823070|) (not .cse0)) (and .cse0 (= |P2Thread1of1ForFork1_#t~ite25_Out-1281823070| ~z~0_In-1281823070)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1281823070, ~z$flush_delayed~0=~z$flush_delayed~0_In-1281823070, ~z~0=~z~0_In-1281823070} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1281823070, P2Thread1of1ForFork1_#t~ite25=|P2Thread1of1ForFork1_#t~ite25_Out-1281823070|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1281823070, ~z~0=~z~0_In-1281823070} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-07 18:03:58,815 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [988] [988] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1703162264 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-1703162264 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1703162264 256))) (.cse3 (= (mod ~z$r_buff1_thd4~0_In-1703162264 256) 0))) (or (and (= |P3Thread1of1ForFork2_#t~ite52_Out-1703162264| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork2_#t~ite52_Out-1703162264| ~z$w_buff1_used~0_In-1703162264) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1703162264, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1703162264} OutVars{P3Thread1of1ForFork2_#t~ite52=|P3Thread1of1ForFork2_#t~ite52_Out-1703162264|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-1703162264, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1703162264, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1703162264, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1703162264} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite52] because there is no mapped edge [2019-12-07 18:03:58,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [996] [996] L831-->L832: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In232769166 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd4~0_In232769166 256) 0)) (.cse2 (= ~z$r_buff0_thd4~0_In232769166 ~z$r_buff0_thd4~0_Out232769166))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd4~0_Out232769166) (not .cse1)) (and .cse1 .cse2) (and .cse0 .cse2))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In232769166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In232769166} OutVars{P3Thread1of1ForFork2_#t~ite53=|P3Thread1of1ForFork2_#t~ite53_Out232769166|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In232769166, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out232769166} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite53, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-07 18:03:58,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L832-->L832-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd4~0_In-313546918 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-313546918 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-313546918 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd4~0_In-313546918 256)))) (or (and (or .cse0 .cse1) (= |P3Thread1of1ForFork2_#t~ite54_Out-313546918| ~z$r_buff1_thd4~0_In-313546918) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork2_#t~ite54_Out-313546918| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-313546918} OutVars{P3Thread1of1ForFork2_#t~ite54=|P3Thread1of1ForFork2_#t~ite54_Out-313546918|, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-313546918, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-313546918, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-313546918, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-313546918} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54] because there is no mapped edge [2019-12-07 18:03:58,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L832-2-->P3EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_52 1) v_~__unbuffered_cnt~0_51) (= |v_P3Thread1of1ForFork2_#t~ite54_22| v_~z$r_buff1_thd4~0_191) (= 0 |v_P3Thread1of1ForFork2_#res.base_3|) (= 0 |v_P3Thread1of1ForFork2_#res.offset_3|)) InVars {P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52} OutVars{P3Thread1of1ForFork2_#t~ite54=|v_P3Thread1of1ForFork2_#t~ite54_21|, P3Thread1of1ForFork2_#res.base=|v_P3Thread1of1ForFork2_#res.base_3|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_191, P3Thread1of1ForFork2_#res.offset=|v_P3Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_51} AuxVars[] AssignedVars[P3Thread1of1ForFork2_#t~ite54, P3Thread1of1ForFork2_#res.base, ~z$r_buff1_thd4~0, P3Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-07 18:03:58,816 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1023] [1023] L783-2-->P2EXIT: Formula: (and (= v_~__unbuffered_cnt~0_61 (+ v_~__unbuffered_cnt~0_62 1)) (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= 0 v_~z$flush_delayed~0_137) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= v_~z~0_175 |v_P2Thread1of1ForFork1_#t~ite25_36|)) InVars {P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~z$flush_delayed~0=v_~z$flush_delayed~0_137, ~z~0=v_~z~0_175, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~z$flush_delayed~0, ~z~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 18:03:58,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L861-->L863-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (or (= 0 (mod v_~z$w_buff0_used~0_139 256)) (= 0 (mod v_~z$r_buff0_thd0~0_18 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_139, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-07 18:03:58,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L863-2-->L863-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In554329280 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In554329280 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite59_Out554329280| ~z~0_In554329280) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite59_Out554329280| ~z$w_buff1~0_In554329280) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In554329280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In554329280, ~z$w_buff1~0=~z$w_buff1~0_In554329280, ~z~0=~z~0_In554329280} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In554329280, ~z$w_buff1_used~0=~z$w_buff1_used~0_In554329280, ~z$w_buff1~0=~z$w_buff1~0_In554329280, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out554329280|, ~z~0=~z~0_In554329280} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-07 18:03:58,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [946] [946] L863-4-->L864: Formula: (= v_~z~0_54 |v_ULTIMATE.start_main_#t~ite59_8|) InVars {ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_8|} OutVars{ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_7|, ~z~0=v_~z~0_54} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite59, ~z~0] because there is no mapped edge [2019-12-07 18:03:58,817 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [978] [978] L864-->L864-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In1612300402 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1612300402 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite61_Out1612300402|) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1612300402 |ULTIMATE.start_main_#t~ite61_Out1612300402|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1612300402, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1612300402} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1612300402, ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1612300402|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1612300402} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-07 18:03:58,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [973] [973] L865-->L865-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In369741545 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In369741545 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In369741545 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In369741545 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite62_Out369741545| ~z$w_buff1_used~0_In369741545) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite62_Out369741545| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In369741545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In369741545, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In369741545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In369741545} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out369741545|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In369741545, ~z$w_buff0_used~0=~z$w_buff0_used~0_In369741545, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In369741545, ~z$w_buff1_used~0=~z$w_buff1_used~0_In369741545} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-07 18:03:58,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L866-->L866-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2135930166 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In2135930166 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite63_Out2135930166|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd0~0_In2135930166 |ULTIMATE.start_main_#t~ite63_Out2135930166|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out2135930166|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2135930166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2135930166} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-07 18:03:58,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [980] [980] L867-->L867-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In2114768361 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In2114768361 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In2114768361 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In2114768361 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite64_Out2114768361| 0)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite64_Out2114768361| ~z$r_buff1_thd0~0_In2114768361) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2114768361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2114768361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2114768361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2114768361} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2114768361, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2114768361, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2114768361, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2114768361, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out2114768361|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-07 18:03:58,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L867-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_19 (ite (= 0 (ite (not (and (= 0 v_~__unbuffered_p0_EAX~0_31) (= 0 v_~__unbuffered_p2_EAX~0_33) (= v_~y~0_56 2) (= 1 v_~__unbuffered_p3_EAX~0_35) (= 0 v_~__unbuffered_p3_EBX~0_22))) 1 0)) 0 1)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_171 |v_ULTIMATE.start_main_#t~ite64_41|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_41|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_31, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_171, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_22, ~y~0=v_~y~0_56, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_40|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite64, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:03:58,881 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1885eb0e-43af-4dd1-8106-0edbf1cf3153/bin/uautomizer/witness.graphml [2019-12-07 18:03:58,881 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:03:58,882 INFO L168 Benchmark]: Toolchain (without parser) took 85324.06 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 938.0 MB in the beginning and 3.5 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:03:58,883 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:03:58,883 INFO L168 Benchmark]: CACSL2BoogieTranslator took 411.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:58,883 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.89 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:03:58,883 INFO L168 Benchmark]: Boogie Preprocessor took 26.94 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:03:58,884 INFO L168 Benchmark]: RCFGBuilder took 444.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:58,884 INFO L168 Benchmark]: TraceAbstraction took 84315.64 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2019-12-07 18:03:58,884 INFO L168 Benchmark]: Witness Printer took 82.99 ms. Allocated memory is still 7.2 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. [2019-12-07 18:03:58,886 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 960.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 411.46 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -127.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.89 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 26.94 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 444.01 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.0 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 84315.64 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 3.6 GB in the end (delta: -2.6 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 82.99 ms. Allocated memory is still 7.2 GB. Free memory was 3.6 GB in the beginning and 3.5 GB in the end (delta: 37.9 MB). Peak memory consumption was 37.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.2s, 211 ProgramPointsBefore, 112 ProgramPointsAfterwards, 254 TransitionsBefore, 131 TransitionsAfterwards, 26510 CoEnabledTransitionPairs, 8 FixpointIterations, 37 TrivialSequentialCompositions, 46 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 29 ChoiceCompositions, 11182 VarBasedMoverChecksPositive, 338 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 381 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.4s, 0 MoverChecksTotal, 142340 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L851] FCALL, FORK 0 pthread_create(&t525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] FCALL, FORK 0 pthread_create(&t527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L857] FCALL, FORK 0 pthread_create(&t528, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] 4 z$w_buff1 = z$w_buff0 [L797] 4 z$w_buff0 = 1 [L798] 4 z$w_buff1_used = z$w_buff0_used [L799] 4 z$w_buff0_used = (_Bool)1 [L813] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L813] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L814] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L815] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L816] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L817] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L819] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L819] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L820] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 z = z$flush_delayed ? z$mem_tmp : z [L822] 4 z$flush_delayed = (_Bool)0 [L825] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L768] 3 y = 2 [L771] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 3 z$flush_delayed = weak$$choice2 [L774] 3 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L776] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L777] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L778] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L779] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L780] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L781] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L781] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L782] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L828] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L829] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L830] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L859] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L865] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L866] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 2 error locations. Result: UNSAFE, OverallTime: 84.1s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 20.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4374 SDtfs, 5788 SDslu, 6370 SDs, 0 SdLazy, 1688 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 105 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=298751occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 48.9s AutomataMinimizationTime, 20 MinimizatonAttempts, 150313 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 725 NumberOfCodeBlocks, 725 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 166427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...