./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_tso.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_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/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 7df04869a813bcedcfd0bfe21f6b1fbea7b23d38 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:34:12,254 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 18:34:12,256 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 18:34:12,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 18:34:12,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 18:34:12,264 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 18:34:12,265 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 18:34:12,266 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 18:34:12,267 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 18:34:12,268 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 18:34:12,268 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 18:34:12,269 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 18:34:12,269 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 18:34:12,270 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 18:34:12,271 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 18:34:12,271 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 18:34:12,272 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 18:34:12,272 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 18:34:12,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 18:34:12,275 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 18:34:12,277 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 18:34:12,278 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 18:34:12,279 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 18:34:12,279 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 18:34:12,281 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 18:34:12,281 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 18:34:12,281 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 18:34:12,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 18:34:12,282 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 18:34:12,283 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 18:34:12,283 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 18:34:12,283 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 18:34:12,284 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 18:34:12,284 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 18:34:12,285 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 18:34:12,285 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 18:34:12,286 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 18:34:12,286 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 18:34:12,286 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 18:34:12,287 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 18:34:12,288 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 18:34:12,288 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 18:34:12,301 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 18:34:12,301 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 18:34:12,302 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 18:34:12,302 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 18:34:12,302 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 18:34:12,303 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 18:34:12,303 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 18:34:12,303 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 18:34:12,303 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 18:34:12,303 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 18:34:12,303 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 18:34:12,304 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 18:34:12,304 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 18:34:12,304 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 18:34:12,304 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 18:34:12,304 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 18:34:12,305 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 18:34:12,305 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 18:34:12,305 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 18:34:12,305 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 18:34:12,305 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 18:34:12,305 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 18:34:12,306 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 18:34:12,306 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 18:34:12,306 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 18:34:12,306 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 18:34:12,306 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 18:34:12,307 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 18:34:12,307 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 18:34:12,307 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_58e57eaf-f12c-41ce-8d09-adf8087d07ac/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 -> 7df04869a813bcedcfd0bfe21f6b1fbea7b23d38 [2019-12-07 18:34:12,418 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 18:34:12,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 18:34:12,431 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 18:34:12,432 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 18:34:12,432 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 18:34:12,433 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i [2019-12-07 18:34:12,475 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/data/7bdcedda7/44dfbfd6f4c14b319a5b452f178280c6/FLAG3edbd61f7 [2019-12-07 18:34:12,931 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 18:34:12,931 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/sv-benchmarks/c/pthread-wmm/mix056_tso.opt.i [2019-12-07 18:34:12,941 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/data/7bdcedda7/44dfbfd6f4c14b319a5b452f178280c6/FLAG3edbd61f7 [2019-12-07 18:34:12,954 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/data/7bdcedda7/44dfbfd6f4c14b319a5b452f178280c6 [2019-12-07 18:34:12,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 18:34:12,958 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 18:34:12,959 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 18:34:12,959 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 18:34:12,962 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 18:34:12,963 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:34:12" (1/1) ... [2019-12-07 18:34:12,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8002ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:12, skipping insertion in model container [2019-12-07 18:34:12,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 06:34:12" (1/1) ... [2019-12-07 18:34:12,972 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 18:34:13,009 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 18:34:13,268 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:34:13,276 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 18:34:13,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 18:34:13,361 INFO L208 MainTranslator]: Completed translation [2019-12-07 18:34:13,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13 WrapperNode [2019-12-07 18:34:13,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 18:34:13,362 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 18:34:13,362 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 18:34:13,362 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 18:34:13,367 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:34:13" (1/1) ... [2019-12-07 18:34:13,380 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:34:13" (1/1) ... [2019-12-07 18:34:13,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 18:34:13,401 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 18:34:13,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 18:34:13,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 18:34:13,408 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,411 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,411 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,423 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... [2019-12-07 18:34:13,426 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 18:34:13,426 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 18:34:13,426 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 18:34:13,426 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 18:34:13,427 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/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:34:13,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 18:34:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 18:34:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 18:34:13,467 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 18:34:13,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 18:34:13,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 18:34:13,469 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:34:13,801 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 18:34:13,801 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 18:34:13,802 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:34:13 BoogieIcfgContainer [2019-12-07 18:34:13,802 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 18:34:13,802 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 18:34:13,803 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 18:34:13,804 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 18:34:13,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 06:34:12" (1/3) ... [2019-12-07 18:34:13,805 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20739afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:34:13, skipping insertion in model container [2019-12-07 18:34:13,805 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 06:34:13" (2/3) ... [2019-12-07 18:34:13,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20739afb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 06:34:13, skipping insertion in model container [2019-12-07 18:34:13,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:34:13" (3/3) ... [2019-12-07 18:34:13,807 INFO L109 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2019-12-07 18:34:13,813 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 18:34:13,813 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 18:34:13,818 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 18:34:13,818 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 18:34:13,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,840 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,841 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,841 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,842 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,843 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,844 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,846 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 18:34:13,860 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 18:34:13,873 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 18:34:13,873 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 18:34:13,873 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 18:34:13,873 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 18:34:13,873 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 18:34:13,873 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 18:34:13,874 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 18:34:13,874 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 18:34:13,884 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-07 18:34:13,885 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 18:34:13,936 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 18:34:13,936 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:34:13,945 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 465 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 18:34:13,956 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-07 18:34:13,980 INFO L134 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-07 18:34:13,980 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 18:34:13,983 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 465 event pairs. 9/156 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-07 18:34:13,993 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 11490 [2019-12-07 18:34:13,994 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 18:34:16,596 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-07 18:34:16,677 INFO L206 etLargeBlockEncoding]: Checked pairs total: 48383 [2019-12-07 18:34:16,677 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-07 18:34:16,679 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-07 18:34:17,387 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 16526 states. [2019-12-07 18:34:17,389 INFO L276 IsEmpty]: Start isEmpty. Operand 16526 states. [2019-12-07 18:34:17,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 18:34:17,393 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:17,393 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:17,394 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:17,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:17,397 INFO L82 PathProgramCache]: Analyzing trace with hash 2128093424, now seen corresponding path program 1 times [2019-12-07 18:34:17,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:17,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915019575] [2019-12-07 18:34:17,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:17,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:17,555 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:34:17,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915019575] [2019-12-07 18:34:17,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:17,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 18:34:17,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351845795] [2019-12-07 18:34:17,560 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:17,560 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:17,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:17,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:17,571 INFO L87 Difference]: Start difference. First operand 16526 states. Second operand 3 states. [2019-12-07 18:34:17,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:17,793 INFO L93 Difference]: Finished difference Result 16398 states and 61580 transitions. [2019-12-07 18:34:17,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:17,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-07 18:34:17,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:17,915 INFO L225 Difference]: With dead ends: 16398 [2019-12-07 18:34:17,915 INFO L226 Difference]: Without dead ends: 16062 [2019-12-07 18:34:17,916 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:34:18,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16062 states. [2019-12-07 18:34:18,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16062 to 16062. [2019-12-07 18:34:18,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16062 states. [2019-12-07 18:34:18,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16062 states to 16062 states and 60376 transitions. [2019-12-07 18:34:18,546 INFO L78 Accepts]: Start accepts. Automaton has 16062 states and 60376 transitions. Word has length 7 [2019-12-07 18:34:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:18,547 INFO L462 AbstractCegarLoop]: Abstraction has 16062 states and 60376 transitions. [2019-12-07 18:34:18,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:18,548 INFO L276 IsEmpty]: Start isEmpty. Operand 16062 states and 60376 transitions. [2019-12-07 18:34:18,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:34:18,552 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:18,552 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:18,552 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:18,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1390331573, now seen corresponding path program 1 times [2019-12-07 18:34:18,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:18,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282319682] [2019-12-07 18:34:18,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:18,615 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:34:18,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282319682] [2019-12-07 18:34:18,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:18,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:34:18,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968189532] [2019-12-07 18:34:18,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:18,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:18,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:18,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:18,617 INFO L87 Difference]: Start difference. First operand 16062 states and 60376 transitions. Second operand 4 states. [2019-12-07 18:34:18,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:18,959 INFO L93 Difference]: Finished difference Result 24942 states and 90524 transitions. [2019-12-07 18:34:18,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:34:18,960 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:34:18,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:19,022 INFO L225 Difference]: With dead ends: 24942 [2019-12-07 18:34:19,022 INFO L226 Difference]: Without dead ends: 24928 [2019-12-07 18:34:19,023 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:34:19,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24928 states. [2019-12-07 18:34:19,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24928 to 22166. [2019-12-07 18:34:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22166 states. [2019-12-07 18:34:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22166 states to 22166 states and 81470 transitions. [2019-12-07 18:34:19,567 INFO L78 Accepts]: Start accepts. Automaton has 22166 states and 81470 transitions. Word has length 13 [2019-12-07 18:34:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:19,568 INFO L462 AbstractCegarLoop]: Abstraction has 22166 states and 81470 transitions. [2019-12-07 18:34:19,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:19,568 INFO L276 IsEmpty]: Start isEmpty. Operand 22166 states and 81470 transitions. [2019-12-07 18:34:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 18:34:19,570 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:19,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:19,570 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:19,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:19,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1371832765, now seen corresponding path program 1 times [2019-12-07 18:34:19,570 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:19,571 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165551338] [2019-12-07 18:34:19,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:19,614 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:34:19,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165551338] [2019-12-07 18:34:19,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:19,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:34:19,615 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550127340] [2019-12-07 18:34:19,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:19,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:19,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:19,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:19,616 INFO L87 Difference]: Start difference. First operand 22166 states and 81470 transitions. Second operand 4 states. [2019-12-07 18:34:19,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:19,870 INFO L93 Difference]: Finished difference Result 27782 states and 100994 transitions. [2019-12-07 18:34:19,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:34:19,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 18:34:19,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:19,925 INFO L225 Difference]: With dead ends: 27782 [2019-12-07 18:34:19,926 INFO L226 Difference]: Without dead ends: 27782 [2019-12-07 18:34:19,926 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:34:20,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27782 states. [2019-12-07 18:34:20,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27782 to 24630. [2019-12-07 18:34:20,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24630 states. [2019-12-07 18:34:20,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24630 states to 24630 states and 90262 transitions. [2019-12-07 18:34:20,366 INFO L78 Accepts]: Start accepts. Automaton has 24630 states and 90262 transitions. Word has length 13 [2019-12-07 18:34:20,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:20,367 INFO L462 AbstractCegarLoop]: Abstraction has 24630 states and 90262 transitions. [2019-12-07 18:34:20,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:20,367 INFO L276 IsEmpty]: Start isEmpty. Operand 24630 states and 90262 transitions. [2019-12-07 18:34:20,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 18:34:20,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:20,372 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:34:20,372 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1003212910, now seen corresponding path program 1 times [2019-12-07 18:34:20,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:20,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686288517] [2019-12-07 18:34:20,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:20,421 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:34:20,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686288517] [2019-12-07 18:34:20,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:20,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:20,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662747493] [2019-12-07 18:34:20,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:34:20,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:20,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:34:20,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:34:20,422 INFO L87 Difference]: Start difference. First operand 24630 states and 90262 transitions. Second operand 5 states. [2019-12-07 18:34:20,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:20,823 INFO L93 Difference]: Finished difference Result 33042 states and 118962 transitions. [2019-12-07 18:34:20,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 18:34:20,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-07 18:34:20,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:20,877 INFO L225 Difference]: With dead ends: 33042 [2019-12-07 18:34:20,877 INFO L226 Difference]: Without dead ends: 33028 [2019-12-07 18:34:20,877 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-07 18:34:20,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33028 states. [2019-12-07 18:34:21,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33028 to 24716. [2019-12-07 18:34:21,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24716 states. [2019-12-07 18:34:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24716 states to 24716 states and 90325 transitions. [2019-12-07 18:34:21,354 INFO L78 Accepts]: Start accepts. Automaton has 24716 states and 90325 transitions. Word has length 19 [2019-12-07 18:34:21,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:21,354 INFO L462 AbstractCegarLoop]: Abstraction has 24716 states and 90325 transitions. [2019-12-07 18:34:21,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:34:21,354 INFO L276 IsEmpty]: Start isEmpty. Operand 24716 states and 90325 transitions. [2019-12-07 18:34:21,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:34:21,374 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:21,374 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:21,374 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:21,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:21,374 INFO L82 PathProgramCache]: Analyzing trace with hash -1251036613, now seen corresponding path program 1 times [2019-12-07 18:34:21,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:21,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117648923] [2019-12-07 18:34:21,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:21,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:21,405 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:34:21,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117648923] [2019-12-07 18:34:21,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:21,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:21,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730825519] [2019-12-07 18:34:21,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:21,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:21,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:21,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:21,406 INFO L87 Difference]: Start difference. First operand 24716 states and 90325 transitions. Second operand 3 states. [2019-12-07 18:34:21,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:21,528 INFO L93 Difference]: Finished difference Result 30008 states and 109703 transitions. [2019-12-07 18:34:21,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:21,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:34:21,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:21,659 INFO L225 Difference]: With dead ends: 30008 [2019-12-07 18:34:21,659 INFO L226 Difference]: Without dead ends: 30008 [2019-12-07 18:34:21,659 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:34:21,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30008 states. [2019-12-07 18:34:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30008 to 28190. [2019-12-07 18:34:22,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28190 states. [2019-12-07 18:34:22,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28190 states to 28190 states and 103378 transitions. [2019-12-07 18:34:22,113 INFO L78 Accepts]: Start accepts. Automaton has 28190 states and 103378 transitions. Word has length 27 [2019-12-07 18:34:22,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,113 INFO L462 AbstractCegarLoop]: Abstraction has 28190 states and 103378 transitions. [2019-12-07 18:34:22,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 28190 states and 103378 transitions. [2019-12-07 18:34:22,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 18:34:22,128 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,128 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:22,128 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1250824263, now seen corresponding path program 1 times [2019-12-07 18:34:22,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458784270] [2019-12-07 18:34:22,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:22,159 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:34:22,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458784270] [2019-12-07 18:34:22,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:22,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:34:22,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038173597] [2019-12-07 18:34:22,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:22,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:22,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:22,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:22,161 INFO L87 Difference]: Start difference. First operand 28190 states and 103378 transitions. Second operand 3 states. [2019-12-07 18:34:22,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:22,207 INFO L93 Difference]: Finished difference Result 16100 states and 51114 transitions. [2019-12-07 18:34:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:22,208 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 18:34:22,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:22,229 INFO L225 Difference]: With dead ends: 16100 [2019-12-07 18:34:22,229 INFO L226 Difference]: Without dead ends: 16100 [2019-12-07 18:34:22,229 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:34:22,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16100 states. [2019-12-07 18:34:22,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16100 to 16100. [2019-12-07 18:34:22,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16100 states. [2019-12-07 18:34:22,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16100 states to 16100 states and 51114 transitions. [2019-12-07 18:34:22,461 INFO L78 Accepts]: Start accepts. Automaton has 16100 states and 51114 transitions. Word has length 27 [2019-12-07 18:34:22,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,461 INFO L462 AbstractCegarLoop]: Abstraction has 16100 states and 51114 transitions. [2019-12-07 18:34:22,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:22,461 INFO L276 IsEmpty]: Start isEmpty. Operand 16100 states and 51114 transitions. [2019-12-07 18:34:22,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 18:34:22,468 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,469 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:22,469 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,469 INFO L82 PathProgramCache]: Analyzing trace with hash 411430761, now seen corresponding path program 1 times [2019-12-07 18:34:22,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894910932] [2019-12-07 18:34:22,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:22,500 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:34:22,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894910932] [2019-12-07 18:34:22,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:22,501 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 18:34:22,501 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511081623] [2019-12-07 18:34:22,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 18:34:22,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:22,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 18:34:22,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 18:34:22,502 INFO L87 Difference]: Start difference. First operand 16100 states and 51114 transitions. Second operand 4 states. [2019-12-07 18:34:22,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:22,515 INFO L93 Difference]: Finished difference Result 2377 states and 5510 transitions. [2019-12-07 18:34:22,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 18:34:22,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 18:34:22,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:22,517 INFO L225 Difference]: With dead ends: 2377 [2019-12-07 18:34:22,517 INFO L226 Difference]: Without dead ends: 2377 [2019-12-07 18:34:22,518 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:34:22,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2377 states. [2019-12-07 18:34:22,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2377 to 2377. [2019-12-07 18:34:22,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2377 states. [2019-12-07 18:34:22,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2377 states to 2377 states and 5510 transitions. [2019-12-07 18:34:22,537 INFO L78 Accepts]: Start accepts. Automaton has 2377 states and 5510 transitions. Word has length 28 [2019-12-07 18:34:22,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,537 INFO L462 AbstractCegarLoop]: Abstraction has 2377 states and 5510 transitions. [2019-12-07 18:34:22,537 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 18:34:22,538 INFO L276 IsEmpty]: Start isEmpty. Operand 2377 states and 5510 transitions. [2019-12-07 18:34:22,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 18:34:22,540 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,540 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:34:22,540 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1388136454, now seen corresponding path program 1 times [2019-12-07 18:34:22,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073598252] [2019-12-07 18:34:22,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:22,587 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:34:22,587 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073598252] [2019-12-07 18:34:22,587 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:22,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 18:34:22,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679070645] [2019-12-07 18:34:22,588 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 18:34:22,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:22,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 18:34:22,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:34:22,589 INFO L87 Difference]: Start difference. First operand 2377 states and 5510 transitions. Second operand 5 states. [2019-12-07 18:34:22,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:22,604 INFO L93 Difference]: Finished difference Result 678 states and 1563 transitions. [2019-12-07 18:34:22,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 18:34:22,605 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-07 18:34:22,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:22,605 INFO L225 Difference]: With dead ends: 678 [2019-12-07 18:34:22,605 INFO L226 Difference]: Without dead ends: 678 [2019-12-07 18:34:22,606 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 18:34:22,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-12-07 18:34:22,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 622. [2019-12-07 18:34:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 622 states. [2019-12-07 18:34:22,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 622 states and 1431 transitions. [2019-12-07 18:34:22,611 INFO L78 Accepts]: Start accepts. Automaton has 622 states and 1431 transitions. Word has length 40 [2019-12-07 18:34:22,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,611 INFO L462 AbstractCegarLoop]: Abstraction has 622 states and 1431 transitions. [2019-12-07 18:34:22,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 18:34:22,611 INFO L276 IsEmpty]: Start isEmpty. Operand 622 states and 1431 transitions. [2019-12-07 18:34:22,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 18:34:22,613 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,613 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] [2019-12-07 18:34:22,613 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,613 INFO L82 PathProgramCache]: Analyzing trace with hash -826083081, now seen corresponding path program 1 times [2019-12-07 18:34:22,613 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,613 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730822597] [2019-12-07 18:34:22,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:22,656 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:34:22,656 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730822597] [2019-12-07 18:34:22,656 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:22,656 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:34:22,657 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505989821] [2019-12-07 18:34:22,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:22,657 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:22,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:22,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:22,657 INFO L87 Difference]: Start difference. First operand 622 states and 1431 transitions. Second operand 3 states. [2019-12-07 18:34:22,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:22,684 INFO L93 Difference]: Finished difference Result 621 states and 1429 transitions. [2019-12-07 18:34:22,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:22,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 18:34:22,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:22,685 INFO L225 Difference]: With dead ends: 621 [2019-12-07 18:34:22,685 INFO L226 Difference]: Without dead ends: 621 [2019-12-07 18:34:22,686 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:34:22,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-12-07 18:34:22,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 621. [2019-12-07 18:34:22,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-12-07 18:34:22,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 1429 transitions. [2019-12-07 18:34:22,704 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 1429 transitions. Word has length 55 [2019-12-07 18:34:22,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,704 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 1429 transitions. [2019-12-07 18:34:22,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:22,704 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 1429 transitions. [2019-12-07 18:34:22,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-07 18:34:22,705 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,705 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] [2019-12-07 18:34:22,705 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,705 INFO L82 PathProgramCache]: Analyzing trace with hash 1696047106, now seen corresponding path program 1 times [2019-12-07 18:34:22,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727078365] [2019-12-07 18:34:22,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:22,739 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:34:22,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727078365] [2019-12-07 18:34:22,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:22,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 18:34:22,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058523144] [2019-12-07 18:34:22,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 18:34:22,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 18:34:22,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 18:34:22,740 INFO L87 Difference]: Start difference. First operand 621 states and 1429 transitions. Second operand 3 states. [2019-12-07 18:34:22,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:22,750 INFO L93 Difference]: Finished difference Result 597 states and 1345 transitions. [2019-12-07 18:34:22,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 18:34:22,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-07 18:34:22,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:22,751 INFO L225 Difference]: With dead ends: 597 [2019-12-07 18:34:22,752 INFO L226 Difference]: Without dead ends: 597 [2019-12-07 18:34:22,752 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:34:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2019-12-07 18:34:22,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2019-12-07 18:34:22,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 597 states. [2019-12-07 18:34:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1345 transitions. [2019-12-07 18:34:22,757 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1345 transitions. Word has length 56 [2019-12-07 18:34:22,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,757 INFO L462 AbstractCegarLoop]: Abstraction has 597 states and 1345 transitions. [2019-12-07 18:34:22,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 18:34:22,757 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1345 transitions. [2019-12-07 18:34:22,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:22,758 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,758 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:22,758 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,758 INFO L82 PathProgramCache]: Analyzing trace with hash 816342703, now seen corresponding path program 1 times [2019-12-07 18:34:22,759 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,759 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207720342] [2019-12-07 18:34:22,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:22,854 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:22,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207720342] [2019-12-07 18:34:22,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:22,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 18:34:22,855 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976966654] [2019-12-07 18:34:22,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 18:34:22,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:22,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 18:34:22,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 18:34:22,856 INFO L87 Difference]: Start difference. First operand 597 states and 1345 transitions. Second operand 7 states. [2019-12-07 18:34:22,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:22,942 INFO L93 Difference]: Finished difference Result 1128 states and 2330 transitions. [2019-12-07 18:34:22,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 18:34:22,943 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-07 18:34:22,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:22,944 INFO L225 Difference]: With dead ends: 1128 [2019-12-07 18:34:22,944 INFO L226 Difference]: Without dead ends: 755 [2019-12-07 18:34:22,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-07 18:34:22,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 755 states. [2019-12-07 18:34:22,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 755 to 535. [2019-12-07 18:34:22,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-12-07 18:34:22,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 1166 transitions. [2019-12-07 18:34:22,951 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 1166 transitions. Word has length 57 [2019-12-07 18:34:22,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:22,952 INFO L462 AbstractCegarLoop]: Abstraction has 535 states and 1166 transitions. [2019-12-07 18:34:22,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 18:34:22,952 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 1166 transitions. [2019-12-07 18:34:22,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:22,953 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:22,953 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:22,953 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:22,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:22,953 INFO L82 PathProgramCache]: Analyzing trace with hash 729563135, now seen corresponding path program 2 times [2019-12-07 18:34:22,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:22,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678137600] [2019-12-07 18:34:22,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:22,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:23,037 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:34:23,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678137600] [2019-12-07 18:34:23,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:23,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 18:34:23,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762241498] [2019-12-07 18:34:23,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 18:34:23,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:23,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 18:34:23,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 18:34:23,038 INFO L87 Difference]: Start difference. First operand 535 states and 1166 transitions. Second operand 6 states. [2019-12-07 18:34:23,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:23,082 INFO L93 Difference]: Finished difference Result 768 states and 1621 transitions. [2019-12-07 18:34:23,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 18:34:23,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-12-07 18:34:23,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:23,083 INFO L225 Difference]: With dead ends: 768 [2019-12-07 18:34:23,083 INFO L226 Difference]: Without dead ends: 231 [2019-12-07 18:34:23,084 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 18:34:23,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2019-12-07 18:34:23,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 207. [2019-12-07 18:34:23,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-12-07 18:34:23,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 364 transitions. [2019-12-07 18:34:23,085 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 364 transitions. Word has length 57 [2019-12-07 18:34:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:23,086 INFO L462 AbstractCegarLoop]: Abstraction has 207 states and 364 transitions. [2019-12-07 18:34:23,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 18:34:23,086 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 364 transitions. [2019-12-07 18:34:23,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:23,086 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:23,086 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:23,086 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:23,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:23,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1516556909, now seen corresponding path program 3 times [2019-12-07 18:34:23,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:23,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605018956] [2019-12-07 18:34:23,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 18:34:23,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605018956] [2019-12-07 18:34:23,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:23,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 18:34:23,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261574425] [2019-12-07 18:34:23,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-07 18:34:23,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-07 18:34:23,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-07 18:34:23,280 INFO L87 Difference]: Start difference. First operand 207 states and 364 transitions. Second operand 13 states. [2019-12-07 18:34:23,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:23,588 INFO L93 Difference]: Finished difference Result 363 states and 623 transitions. [2019-12-07 18:34:23,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 18:34:23,589 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-07 18:34:23,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:23,589 INFO L225 Difference]: With dead ends: 363 [2019-12-07 18:34:23,589 INFO L226 Difference]: Without dead ends: 333 [2019-12-07 18:34:23,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-07 18:34:23,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-12-07 18:34:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 303. [2019-12-07 18:34:23,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-12-07 18:34:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 528 transitions. [2019-12-07 18:34:23,592 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 528 transitions. Word has length 57 [2019-12-07 18:34:23,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:23,592 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 528 transitions. [2019-12-07 18:34:23,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-07 18:34:23,592 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 528 transitions. [2019-12-07 18:34:23,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:23,592 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:23,593 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:23,593 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:23,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:23,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1886575453, now seen corresponding path program 4 times [2019-12-07 18:34:23,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:23,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295541183] [2019-12-07 18:34:23,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:23,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:23,771 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:34:23,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295541183] [2019-12-07 18:34:23,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:23,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-07 18:34:23,771 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385124023] [2019-12-07 18:34:23,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 18:34:23,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:23,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 18:34:23,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 18:34:23,772 INFO L87 Difference]: Start difference. First operand 303 states and 528 transitions. Second operand 14 states. [2019-12-07 18:34:24,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:24,073 INFO L93 Difference]: Finished difference Result 419 states and 709 transitions. [2019-12-07 18:34:24,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 18:34:24,073 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 57 [2019-12-07 18:34:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:24,074 INFO L225 Difference]: With dead ends: 419 [2019-12-07 18:34:24,074 INFO L226 Difference]: Without dead ends: 389 [2019-12-07 18:34:24,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=461, Unknown=0, NotChecked=0, Total=552 [2019-12-07 18:34:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-07 18:34:24,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 307. [2019-12-07 18:34:24,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-12-07 18:34:24,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 535 transitions. [2019-12-07 18:34:24,077 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 535 transitions. Word has length 57 [2019-12-07 18:34:24,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:24,077 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 535 transitions. [2019-12-07 18:34:24,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 18:34:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 535 transitions. [2019-12-07 18:34:24,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:24,078 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:24,078 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:24,078 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:24,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:24,078 INFO L82 PathProgramCache]: Analyzing trace with hash -1834190715, now seen corresponding path program 5 times [2019-12-07 18:34:24,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:24,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318159385] [2019-12-07 18:34:24,079 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:24,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:24,289 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:34:24,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318159385] [2019-12-07 18:34:24,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:24,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-07 18:34:24,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438411677] [2019-12-07 18:34:24,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 18:34:24,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:24,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 18:34:24,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-07 18:34:24,290 INFO L87 Difference]: Start difference. First operand 307 states and 535 transitions. Second operand 15 states. [2019-12-07 18:34:24,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:24,777 INFO L93 Difference]: Finished difference Result 564 states and 939 transitions. [2019-12-07 18:34:24,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 18:34:24,777 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2019-12-07 18:34:24,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:24,778 INFO L225 Difference]: With dead ends: 564 [2019-12-07 18:34:24,778 INFO L226 Difference]: Without dead ends: 534 [2019-12-07 18:34:24,778 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=122, Invalid=580, Unknown=0, NotChecked=0, Total=702 [2019-12-07 18:34:24,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2019-12-07 18:34:24,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 317. [2019-12-07 18:34:24,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2019-12-07 18:34:24,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 553 transitions. [2019-12-07 18:34:24,781 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 553 transitions. Word has length 57 [2019-12-07 18:34:24,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:24,781 INFO L462 AbstractCegarLoop]: Abstraction has 317 states and 553 transitions. [2019-12-07 18:34:24,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 18:34:24,781 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 553 transitions. [2019-12-07 18:34:24,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:24,782 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:24,782 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:24,782 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:24,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:24,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1124170117, now seen corresponding path program 6 times [2019-12-07 18:34:24,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:24,782 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015565398] [2019-12-07 18:34:24,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:24,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 18:34:24,925 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:34:24,925 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015565398] [2019-12-07 18:34:24,925 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 18:34:24,925 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 18:34:24,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697900181] [2019-12-07 18:34:24,925 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 18:34:24,926 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 18:34:24,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 18:34:24,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2019-12-07 18:34:24,926 INFO L87 Difference]: Start difference. First operand 317 states and 553 transitions. Second operand 12 states. [2019-12-07 18:34:25,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 18:34:25,145 INFO L93 Difference]: Finished difference Result 417 states and 706 transitions. [2019-12-07 18:34:25,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 18:34:25,145 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 57 [2019-12-07 18:34:25,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 18:34:25,145 INFO L225 Difference]: With dead ends: 417 [2019-12-07 18:34:25,145 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 18:34:25,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-07 18:34:25,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 18:34:25,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 315. [2019-12-07 18:34:25,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-12-07 18:34:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 549 transitions. [2019-12-07 18:34:25,148 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 549 transitions. Word has length 57 [2019-12-07 18:34:25,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 18:34:25,148 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 549 transitions. [2019-12-07 18:34:25,148 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 18:34:25,148 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 549 transitions. [2019-12-07 18:34:25,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-07 18:34:25,149 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 18:34:25,149 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 18:34:25,149 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 18:34:25,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 18:34:25,149 INFO L82 PathProgramCache]: Analyzing trace with hash 731376245, now seen corresponding path program 7 times [2019-12-07 18:34:25,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 18:34:25,150 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774465302] [2019-12-07 18:34:25,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 18:34:25,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:34:25,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 18:34:25,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 18:34:25,241 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 18:34:25,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26|)) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| 4) |v_#length_23|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26|) |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1510~0.base_26|) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ULTIMATE.start_main_~#t1510~0.base=|v_ULTIMATE.start_main_~#t1510~0.base_26|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ULTIMATE.start_main_~#t1510~0.offset=|v_ULTIMATE.start_main_~#t1510~0.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_14|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1511~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1510~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1512~0.base, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1510~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1511~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:34:25,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1511~0.offset_11| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13|) |v_ULTIMATE.start_main_~#t1511~0.offset_11| 1))) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1511~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1511~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1511~0.offset, #length, ULTIMATE.start_main_~#t1511~0.base] because there is no mapped edge [2019-12-07 18:34:25,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12|) |v_ULTIMATE.start_main_~#t1512~0.offset_10| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1512~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12|) 0) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12| 1) |v_#valid_38|) (not (= |v_ULTIMATE.start_main_~#t1512~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1512~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1512~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, #length] because there is no mapped edge [2019-12-07 18:34:25,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_10)) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0_~arg.base_6 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_161 256))))) 1 0)) (= v_P2Thread1of1ForFork0_~arg.offset_6 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_6, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_6, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:34:25,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_19) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:34:25,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In230098789 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In230098789 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out230098789| ~y$w_buff0_used~0_In230098789)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out230098789| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In230098789, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In230098789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In230098789, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out230098789|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In230098789} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 18:34:25,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In595694027 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In595694027 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out595694027| ~y~0_In595694027)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out595694027| ~y$w_buff1~0_In595694027) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In595694027, ~y$w_buff1~0=~y$w_buff1~0_In595694027, ~y~0=~y~0_In595694027, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595694027} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In595694027, ~y$w_buff1~0=~y$w_buff1~0_In595694027, ~y~0=~y~0_In595694027, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out595694027|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595694027} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 18:34:25,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_10| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_10|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_11|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 18:34:25,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1188126186 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1188126186 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1188126186 |P1Thread1of1ForFork2_#t~ite5_Out1188126186|)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out1188126186| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1188126186, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1188126186} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1188126186, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1188126186, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1188126186|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 18:34:25,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-301420775 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-301420775 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-301420775 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-301420775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out-301420775| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite6_Out-301420775| ~y$w_buff1_used~0_In-301420775)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-301420775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301420775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-301420775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301420775} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-301420775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301420775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-301420775, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-301420775|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301420775} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 18:34:25,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1177707338 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1177707338 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out1177707338| ~y$r_buff0_thd2~0_In1177707338) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1177707338| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1177707338, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1177707338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1177707338, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1177707338, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1177707338|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 18:34:25,247 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1238100874 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1238100874 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1238100874 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1238100874 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out-1238100874| ~y$w_buff1_used~0_In-1238100874) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1238100874| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1238100874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238100874, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1238100874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238100874} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1238100874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238100874, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1238100874|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1238100874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238100874} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1518420139 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1518420139 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1518420139 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1518420139 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-1518420139|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1518420139 |P1Thread1of1ForFork2_#t~ite8_Out-1518420139|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1518420139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1518420139, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1518420139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1518420139} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1518420139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1518420139, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1518420139|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1518420139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1518420139} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_56) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1563650889 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1563650889 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_In-1563650889 ~y$r_buff0_thd3~0_Out-1563650889))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd3~0_Out-1563650889 0)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563650889, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1563650889} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563650889, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1563650889, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1563650889|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1595352039 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1595352039 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1595352039 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1595352039 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1595352039| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1595352039| ~y$r_buff1_thd3~0_In1595352039) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1595352039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595352039, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1595352039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595352039} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1595352039|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1595352039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595352039, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1595352039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595352039} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite14_38| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:34:25,248 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In46451668 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In46451668 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out46451668| ~y$w_buff1~0_In46451668) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out46451668| ~y~0_In46451668) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In46451668, ~y~0=~y~0_In46451668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In46451668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In46451668} OutVars{~y$w_buff1~0=~y$w_buff1~0_In46451668, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out46451668|, ~y~0=~y~0_In46451668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In46451668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In46451668} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-07 18:34:25,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-07 18:34:25,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-63932428 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-63932428 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-63932428| ~y$w_buff0_used~0_In-63932428) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-63932428| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-63932428, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-63932428} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-63932428, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-63932428, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-63932428|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 18:34:25,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In2142049319 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2142049319 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2142049319 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2142049319 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2142049319 |ULTIMATE.start_main_#t~ite21_Out2142049319|)) (and (= |ULTIMATE.start_main_#t~ite21_Out2142049319| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142049319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142049319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2142049319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142049319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142049319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142049319, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2142049319|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2142049319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142049319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 18:34:25,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1367627842 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1367627842 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1367627842| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1367627842| ~y$r_buff0_thd0~0_In-1367627842) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1367627842, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1367627842} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1367627842, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1367627842, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1367627842|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 18:34:25,249 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1528449329 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1528449329 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1528449329 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1528449329 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1528449329|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1528449329 |ULTIMATE.start_main_#t~ite23_Out1528449329|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1528449329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1528449329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1528449329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528449329} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1528449329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1528449329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1528449329, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1528449329|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528449329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 18:34:25,250 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1220227627 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In1220227627| |ULTIMATE.start_main_#t~ite29_Out1220227627|) (= |ULTIMATE.start_main_#t~ite30_Out1220227627| ~y$w_buff0~0_In1220227627) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out1220227627| |ULTIMATE.start_main_#t~ite29_Out1220227627|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1220227627 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1220227627 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In1220227627 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1220227627 256)))) .cse0 (= ~y$w_buff0~0_In1220227627 |ULTIMATE.start_main_#t~ite29_Out1220227627|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1220227627, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1220227627|, ~y$w_buff0~0=~y$w_buff0~0_In1220227627, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220227627, ~weak$$choice2~0=~weak$$choice2~0_In1220227627, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220227627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220227627} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1220227627|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220227627, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1220227627|, ~y$w_buff0~0=~y$w_buff0~0_In1220227627, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220227627, ~weak$$choice2~0=~weak$$choice2~0_In1220227627, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220227627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220227627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 18:34:25,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:34:25,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:34:25,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:34:25,306 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 06:34:25 BasicIcfg [2019-12-07 18:34:25,307 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 18:34:25,307 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 18:34:25,307 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 18:34:25,307 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 18:34:25,307 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 06:34:13" (3/4) ... [2019-12-07 18:34:25,309 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 18:34:25,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] ULTIMATE.startENTRY-->L800: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~weak$$choice0~0_25) (= 0 v_~y$r_buff0_thd3~0_151) (= v_~y$w_buff1~0_200 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26|)) (= v_~y$w_buff0_used~0_650 0) (= v_~__unbuffered_cnt~0_109 0) (< 0 |v_#StackHeapBarrier_16|) (= 0 v_~y$w_buff0~0_308) (= 0 v_~y$r_buff1_thd3~0_122) (= v_~y$read_delayed~0_6 0) (= 0 v_~y$r_buff1_thd1~0_76) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1510~0.base_26| 1)) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| 4) |v_#length_23|) (= v_~z~0_51 0) (= v_~y$r_buff0_thd1~0_29 0) (= v_~main$tmp_guard1~0_28 0) (= v_~y$r_buff0_thd0~0_312 0) (= 0 v_~__unbuffered_p2_EAX~0_90) (= 0 v_~y$flush_delayed~0_45) (= v_~y$w_buff1_used~0_407 0) (= v_~y$r_buff0_thd2~0_88 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1510~0.base_26|) |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0)) |v_#memory_int_23|) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff1_thd2~0_131) (= v_~y$mem_tmp~0_31 0) (= |v_ULTIMATE.start_main_~#t1510~0.offset_19| 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y~0_150 0) (= v_~weak$$choice2~0_131 0) (= v_~y$r_buff1_thd0~0_254 0) (< |v_#StackHeapBarrier_16| |v_ULTIMATE.start_main_~#t1510~0.base_26|) (= v_~main$tmp_guard0~0_24 0) (= 0 |v_#NULL.base_5|) (= v_~x~0_80 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_16|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_19|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_26|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_104|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_52|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_26|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_122, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_45, ULTIMATE.start_main_~#t1510~0.base=|v_ULTIMATE.start_main_~#t1510~0.base_26|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_90, ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_34|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_142|, ULTIMATE.start_main_#t~nondet24=|v_ULTIMATE.start_main_#t~nondet24_44|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_31|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_98|, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_27|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_26|, ~weak$$choice0~0=v_~weak$$choice0~0_25, #StackHeapBarrier=|v_#StackHeapBarrier_16|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_28|, ~y$w_buff1~0=v_~y$w_buff1~0_200, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_88, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_8|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_22|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_109, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ~x~0=v_~x~0_80, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_650, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_38|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_31|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_28|, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_32|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_16|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_58|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_76, ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_21|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_44|, ULTIMATE.start_main_~#t1510~0.offset=|v_ULTIMATE.start_main_~#t1510~0.offset_19|, ~y$w_buff0~0=v_~y$w_buff0~0_308, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_151, ~y~0=v_~y~0_150, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_44|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_96|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_31|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_131, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_28|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_312, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_8|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_14|, ~z~0=v_~z~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_131, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_407} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_~#t1511~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~y$read_delayed~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ULTIMATE.start_main_~#t1510~0.base, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~nondet24, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t1512~0.base, ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_~#t1510~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t1511~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:34:25,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L800-1-->L802: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t1511~0.offset_11| 0) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13|) 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1511~0.base_13|) |v_ULTIMATE.start_main_~#t1511~0.offset_11| 1))) (= |v_#valid_40| (store |v_#valid_41| |v_ULTIMATE.start_main_~#t1511~0.base_13| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1511~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t1511~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_5|, ULTIMATE.start_main_~#t1511~0.offset=|v_ULTIMATE.start_main_~#t1511~0.offset_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1511~0.base=|v_ULTIMATE.start_main_~#t1511~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet15, ULTIMATE.start_main_~#t1511~0.offset, #length, ULTIMATE.start_main_~#t1511~0.base] because there is no mapped edge [2019-12-07 18:34:25,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L802-1-->L804: Formula: (and (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1512~0.base_12|) |v_ULTIMATE.start_main_~#t1512~0.offset_10| 2)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1512~0.base_12|) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12|) 0) (= (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1512~0.base_12| 1) |v_#valid_38|) (not (= |v_ULTIMATE.start_main_~#t1512~0.base_12| 0)) (= |v_ULTIMATE.start_main_~#t1512~0.offset_10| 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1512~0.base_12| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1512~0.base=|v_ULTIMATE.start_main_~#t1512~0.base_12|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_5|, ULTIMATE.start_main_~#t1512~0.offset=|v_ULTIMATE.start_main_~#t1512~0.offset_10|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1512~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_~#t1512~0.offset, #length] because there is no mapped edge [2019-12-07 18:34:25,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] P2ENTRY-->L4-3: Formula: (and (not (= 0 v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_10)) (= 2 v_~y$w_buff0~0_40) (= v_~y$w_buff0_used~0_161 1) (= v_~y$w_buff0~0_41 v_~y$w_buff1~0_32) (= v_P2Thread1of1ForFork0_~arg.base_6 |v_P2Thread1of1ForFork0_#in~arg.base_8|) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_10 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_6| (ite (not (and (not (= (mod v_~y$w_buff1_used~0_89 256) 0)) (not (= 0 (mod v_~y$w_buff0_used~0_161 256))))) 1 0)) (= v_P2Thread1of1ForFork0_~arg.offset_6 |v_P2Thread1of1ForFork0_#in~arg.offset_8|) (= v_~y$w_buff1_used~0_89 v_~y$w_buff0_used~0_162)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff0~0=v_~y$w_buff0~0_41, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_6, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_8|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_161, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$w_buff0~0=v_~y$w_buff0~0_40, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_6, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_8|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_10, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_89} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-07 18:34:25,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_35 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_9|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_9|) (= |v_P0Thread1of1ForFork1_#in~arg.base_21| v_P0Thread1of1ForFork1_~arg.base_19) (= v_P0Thread1of1ForFork1_~arg.offset_19 |v_P0Thread1of1ForFork1_#in~arg.offset_21|) (= v_~x~0_49 1) (= v_~__unbuffered_cnt~0_67 (+ v_~__unbuffered_cnt~0_68 1))) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|} OutVars{P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_9|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_21|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_9|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67, ~z~0=v_~z~0_35, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_21|, ~x~0=v_~x~0_49, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_19} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, ~x~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-07 18:34:25,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] L778-->L778-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In230098789 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In230098789 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out230098789| ~y$w_buff0_used~0_In230098789)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite11_Out230098789| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In230098789, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In230098789} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In230098789, P2Thread1of1ForFork0_#t~ite11=|P2Thread1of1ForFork0_#t~ite11_Out230098789|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In230098789} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 18:34:25,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [694] [694] L748-2-->L748-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In595694027 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In595694027 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite3_Out595694027| ~y~0_In595694027)) (and (= |P1Thread1of1ForFork2_#t~ite3_Out595694027| ~y$w_buff1~0_In595694027) (not .cse0) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In595694027, ~y$w_buff1~0=~y$w_buff1~0_In595694027, ~y~0=~y~0_In595694027, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595694027} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In595694027, ~y$w_buff1~0=~y$w_buff1~0_In595694027, ~y~0=~y~0_In595694027, P1Thread1of1ForFork2_#t~ite3=|P1Thread1of1ForFork2_#t~ite3_Out595694027|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In595694027} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 18:34:25,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [618] [618] L748-4-->L749: Formula: (= |v_P1Thread1of1ForFork2_#t~ite3_10| v_~y~0_21) InVars {P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_10|} OutVars{P1Thread1of1ForFork2_#t~ite4=|v_P1Thread1of1ForFork2_#t~ite4_11|, ~y~0=v_~y~0_21, P1Thread1of1ForFork2_#t~ite3=|v_P1Thread1of1ForFork2_#t~ite3_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite4, ~y~0, P1Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-07 18:34:25,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [677] [677] L749-->L749-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In1188126186 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1188126186 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1188126186 |P1Thread1of1ForFork2_#t~ite5_Out1188126186|)) (and (= |P1Thread1of1ForFork2_#t~ite5_Out1188126186| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1188126186, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1188126186} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1188126186, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1188126186, P1Thread1of1ForFork2_#t~ite5=|P1Thread1of1ForFork2_#t~ite5_Out1188126186|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 18:34:25,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L750-->L750-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-301420775 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-301420775 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-301420775 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-301420775 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork2_#t~ite6_Out-301420775| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P1Thread1of1ForFork2_#t~ite6_Out-301420775| ~y$w_buff1_used~0_In-301420775)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-301420775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301420775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-301420775, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301420775} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-301420775, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-301420775, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-301420775, P1Thread1of1ForFork2_#t~ite6=|P1Thread1of1ForFork2_#t~ite6_Out-301420775|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-301420775} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 18:34:25,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In1177707338 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1177707338 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite7_Out1177707338| ~y$r_buff0_thd2~0_In1177707338) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork2_#t~ite7_Out1177707338| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1177707338, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1177707338} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1177707338, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1177707338, P1Thread1of1ForFork2_#t~ite7=|P1Thread1of1ForFork2_#t~ite7_Out1177707338|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 18:34:25,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L779-->L779-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-1238100874 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1238100874 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1238100874 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1238100874 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite12_Out-1238100874| ~y$w_buff1_used~0_In-1238100874) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite12_Out-1238100874| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1238100874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238100874, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1238100874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238100874} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1238100874, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1238100874, P2Thread1of1ForFork0_#t~ite12=|P2Thread1of1ForFork0_#t~ite12_Out-1238100874|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1238100874, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1238100874} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 18:34:25,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] L752-->L752-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1518420139 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1518420139 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1518420139 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1518420139 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite8_Out-1518420139|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$r_buff1_thd2~0_In-1518420139 |P1Thread1of1ForFork2_#t~ite8_Out-1518420139|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1518420139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1518420139, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1518420139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1518420139} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1518420139, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1518420139, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1518420139|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1518420139, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1518420139} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 18:34:25,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L752-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_3|) (= 0 |v_P1Thread1of1ForFork2_#res.base_3|) (= |v_P1Thread1of1ForFork2_#t~ite8_26| v_~y$r_buff1_thd2~0_56) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_3|, P1Thread1of1ForFork2_#t~ite8=|v_P1Thread1of1ForFork2_#t~ite8_25|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork2_#res.offset, P1Thread1of1ForFork2_#t~ite8, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L780-->L781: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-1563650889 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1563650889 256) 0)) (.cse0 (= ~y$r_buff0_thd3~0_In-1563650889 ~y$r_buff0_thd3~0_Out-1563650889))) (or (and .cse0 .cse1) (and (not .cse1) (not .cse2) (= ~y$r_buff0_thd3~0_Out-1563650889 0)) (and .cse2 .cse0))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563650889, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1563650889} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1563650889, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-1563650889, P2Thread1of1ForFork0_#t~ite13=|P2Thread1of1ForFork0_#t~ite13_Out-1563650889|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [681] [681] L781-->L781-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In1595352039 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In1595352039 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1595352039 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1595352039 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite14_Out1595352039| 0)) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork0_#t~ite14_Out1595352039| ~y$r_buff1_thd3~0_In1595352039) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1595352039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595352039, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1595352039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595352039} OutVars{P2Thread1of1ForFork0_#t~ite14=|P2Thread1of1ForFork0_#t~ite14_Out1595352039|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1595352039, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1595352039, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1595352039, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1595352039} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L781-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#t~ite14_38| v_~y$r_buff1_thd3~0_68) (= |v_P2Thread1of1ForFork0_#res.base_3| 0) (= |v_P2Thread1of1ForFork0_#res.offset_3| 0) (= v_~__unbuffered_cnt~0_90 (+ v_~__unbuffered_cnt~0_91 1))) InVars {P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_91} OutVars{P2Thread1of1ForFork0_#t~ite14=|v_P2Thread1of1ForFork0_#t~ite14_37|, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_68, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_90, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite14, ~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [617] [617] L804-1-->L810: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_13) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_5|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet17, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L810-2-->L810-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In46451668 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In46451668 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite18_Out46451668| ~y$w_buff1~0_In46451668) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite18_Out46451668| ~y~0_In46451668) (or .cse0 .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In46451668, ~y~0=~y~0_In46451668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In46451668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In46451668} OutVars{~y$w_buff1~0=~y$w_buff1~0_In46451668, ULTIMATE.start_main_#t~ite18=|ULTIMATE.start_main_#t~ite18_Out46451668|, ~y~0=~y~0_In46451668, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In46451668, ~y$w_buff1_used~0=~y$w_buff1_used~0_In46451668} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [636] [636] L810-4-->L811: Formula: (= v_~y~0_40 |v_ULTIMATE.start_main_#t~ite18_13|) InVars {ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_13|} OutVars{ULTIMATE.start_main_#t~ite18=|v_ULTIMATE.start_main_#t~ite18_12|, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_12|, ~y~0=v_~y~0_40} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite18, ULTIMATE.start_main_#t~ite19, ~y~0] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L811-->L811-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-63932428 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-63932428 256)))) (or (and (= |ULTIMATE.start_main_#t~ite20_Out-63932428| ~y$w_buff0_used~0_In-63932428) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite20_Out-63932428| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-63932428, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-63932428} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-63932428, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-63932428, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-63932428|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-07 18:34:25,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [678] [678] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In2142049319 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In2142049319 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2142049319 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2142049319 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In2142049319 |ULTIMATE.start_main_#t~ite21_Out2142049319|)) (and (= |ULTIMATE.start_main_#t~ite21_Out2142049319| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142049319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142049319, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2142049319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142049319} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142049319, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2142049319, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out2142049319|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2142049319, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2142049319} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-07 18:34:25,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1367627842 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1367627842 256)))) (or (and (= |ULTIMATE.start_main_#t~ite22_Out-1367627842| 0) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite22_Out-1367627842| ~y$r_buff0_thd0~0_In-1367627842) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1367627842, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1367627842} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1367627842, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1367627842, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out-1367627842|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-07 18:34:25,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L814-->L814-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In1528449329 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1528449329 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1528449329 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In1528449329 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite23_Out1528449329|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1528449329 |ULTIMATE.start_main_#t~ite23_Out1528449329|) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1528449329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1528449329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1528449329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528449329} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1528449329, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1528449329, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1528449329, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out1528449329|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1528449329} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-07 18:34:25,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L822-->L822-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1220227627 256)))) (or (and (= |ULTIMATE.start_main_#t~ite29_In1220227627| |ULTIMATE.start_main_#t~ite29_Out1220227627|) (= |ULTIMATE.start_main_#t~ite30_Out1220227627| ~y$w_buff0~0_In1220227627) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite30_Out1220227627| |ULTIMATE.start_main_#t~ite29_Out1220227627|) (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1220227627 256) 0))) (or (and .cse1 (= (mod ~y$w_buff1_used~0_In1220227627 256) 0)) (and (= 0 (mod ~y$r_buff1_thd0~0_In1220227627 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1220227627 256)))) .cse0 (= ~y$w_buff0~0_In1220227627 |ULTIMATE.start_main_#t~ite29_Out1220227627|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1220227627, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_In1220227627|, ~y$w_buff0~0=~y$w_buff0~0_In1220227627, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220227627, ~weak$$choice2~0=~weak$$choice2~0_In1220227627, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220227627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220227627} OutVars{ULTIMATE.start_main_#t~ite30=|ULTIMATE.start_main_#t~ite30_Out1220227627|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220227627, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out1220227627|, ~y$w_buff0~0=~y$w_buff0~0_In1220227627, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1220227627, ~weak$$choice2~0=~weak$$choice2~0_In1220227627, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1220227627, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220227627} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite30, ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-07 18:34:25,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L826-->L827: Formula: (and (not (= (mod v_~weak$$choice2~0_27 256) 0)) (= v_~y$r_buff0_thd0~0_86 v_~y$r_buff0_thd0~0_85)) InVars {~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_86, ~weak$$choice2~0=v_~weak$$choice2~0_27} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_10|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_85, ~weak$$choice2~0=v_~weak$$choice2~0_27, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-07 18:34:25,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L829-->L832-1: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5| (mod v_~main$tmp_guard1~0_12 256)) (= v_~y~0_109 v_~y$mem_tmp~0_21) (not (= 0 (mod v_~y$flush_delayed~0_33 256))) (= 0 v_~y$flush_delayed~0_32)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_33, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_21, ~y$flush_delayed~0=v_~y$flush_delayed~0_32, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_24|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ~y~0=v_~y~0_109, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[~y$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 18:34:25,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L832-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-07 18:34:25,381 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_58e57eaf-f12c-41ce-8d09-adf8087d07ac/bin/uautomizer/witness.graphml [2019-12-07 18:34:25,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 18:34:25,383 INFO L168 Benchmark]: Toolchain (without parser) took 12424.90 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 714.1 MB). Free memory was 937.1 MB in the beginning and 851.6 MB in the end (delta: 85.5 MB). Peak memory consumption was 799.6 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:25,383 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 18:34:25,383 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:25,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.51 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:34:25,384 INFO L168 Benchmark]: Boogie Preprocessor took 24.31 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:34:25,384 INFO L168 Benchmark]: RCFGBuilder took 375.97 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:25,384 INFO L168 Benchmark]: TraceAbstraction took 11504.21 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 606.1 MB). Free memory was 1.0 GB in the beginning and 885.1 MB in the end (delta: 129.0 MB). Peak memory consumption was 735.1 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:25,385 INFO L168 Benchmark]: Witness Printer took 74.53 ms. Allocated memory is still 1.7 GB. Free memory was 885.1 MB in the beginning and 851.6 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. [2019-12-07 18:34:25,387 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 402.76 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.0 MB). Free memory was 937.1 MB in the beginning and 1.1 GB in the end (delta: -138.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.51 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. * Boogie Preprocessor took 24.31 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. * RCFGBuilder took 375.97 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: 56.3 MB). Peak memory consumption was 56.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 11504.21 ms. Allocated memory was 1.1 GB in the beginning and 1.7 GB in the end (delta: 606.1 MB). Free memory was 1.0 GB in the beginning and 885.1 MB in the end (delta: 129.0 MB). Peak memory consumption was 735.1 MB. Max. memory is 11.5 GB. * Witness Printer took 74.53 ms. Allocated memory is still 1.7 GB. Free memory was 885.1 MB in the beginning and 851.6 MB in the end (delta: 33.5 MB). Peak memory consumption was 33.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 11490 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 3955 VarBasedMoverChecksPositive, 193 VarBasedMoverChecksNegative, 45 SemBasedMoverChecksPositive, 196 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.7s, 0 MoverChecksTotal, 48383 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L800] FCALL, FORK 0 pthread_create(&t1510, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1511, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1512, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L767] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L768] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L769] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L770] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L771] 3 y$r_buff0_thd3 = (_Bool)1 [L774] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 2 x = 2 [L745] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0: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=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L777] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L748] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0: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=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L750] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L751] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L778] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L779] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 0 y$flush_delayed = weak$$choice2 [L820] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L821] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L822] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L823] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L823] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L824] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L825] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L825] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L828] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 11.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1683 SDtfs, 1834 SDslu, 4497 SDs, 0 SdLazy, 2332 SolverSat, 156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28190occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 16745 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 611 ConstructedInterpolants, 0 QuantifiedInterpolants, 136577 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...