./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/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 0ad75676076b2f4fd97a0e8b61d888447e8e32fb ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 15:47:29,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:47:29,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:47:29,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:47:29,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:47:29,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:47:29,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:47:29,616 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:47:29,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:47:29,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:47:29,619 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:47:29,620 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:47:29,620 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:47:29,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:47:29,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:47:29,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:47:29,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:47:29,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:47:29,625 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:47:29,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:47:29,628 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:47:29,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:47:29,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:47:29,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:47:29,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:47:29,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:47:29,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:47:29,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:47:29,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:47:29,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:47:29,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:47:29,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:47:29,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:47:29,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:47:29,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:47:29,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:47:29,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:47:29,637 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:47:29,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:47:29,638 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:47:29,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:47:29,639 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 15:47:29,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:47:29,652 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:47:29,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:47:29,653 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:47:29,653 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 15:47:29,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:47:29,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:47:29,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:47:29,654 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:47:29,654 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:47:29,654 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 15:47:29,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:47:29,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 15:47:29,655 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:47:29,655 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 15:47:29,655 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:47:29,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 15:47:29,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:47:29,656 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:47:29,656 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:47:29,656 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:47:29,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:47:29,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:47:29,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:47:29,657 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 15:47:29,657 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 15:47:29,657 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:47:29,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 15:47:29,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:47:29,657 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_fbc7e85c-011f-4189-adbe-1a6cda99a195/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 -> 0ad75676076b2f4fd97a0e8b61d888447e8e32fb [2019-12-07 15:47:29,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:47:29,771 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:47:29,773 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:47:29,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:47:29,775 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:47:29,776 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-12-07 15:47:29,814 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/data/0d8a21679/2e421ad8122e4232885777041f7110fa/FLAG4c0e626ae [2019-12-07 15:47:30,269 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:47:30,270 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/sv-benchmarks/c/pthread-wmm/safe033_power.opt.i [2019-12-07 15:47:30,281 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/data/0d8a21679/2e421ad8122e4232885777041f7110fa/FLAG4c0e626ae [2019-12-07 15:47:30,290 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/data/0d8a21679/2e421ad8122e4232885777041f7110fa [2019-12-07 15:47:30,292 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:47:30,293 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:47:30,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:47:30,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:47:30,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:47:30,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,298 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@551fb3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30, skipping insertion in model container [2019-12-07 15:47:30,298 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:47:30,329 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:47:30,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:47:30,571 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:47:30,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:47:30,658 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:47:30,658 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30 WrapperNode [2019-12-07 15:47:30,658 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:47:30,659 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:47:30,659 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:47:30,659 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:47:30,665 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,677 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,696 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:47:30,696 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:47:30,696 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:47:30,696 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:47:30,703 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,703 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,706 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,706 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,713 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,715 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,717 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... [2019-12-07 15:47:30,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:47:30,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:47:30,721 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:47:30,721 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:47:30,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/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 15:47:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 15:47:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 15:47:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:47:30,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:47:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 15:47:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 15:47:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 15:47:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 15:47:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 15:47:30,768 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:47:30,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:47:30,770 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 15:47:31,083 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:47:31,083 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:47:31,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:47:31 BoogieIcfgContainer [2019-12-07 15:47:31,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:47:31,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:47:31,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:47:31,087 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:47:31,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:47:30" (1/3) ... [2019-12-07 15:47:31,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda43c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:47:31, skipping insertion in model container [2019-12-07 15:47:31,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:47:30" (2/3) ... [2019-12-07 15:47:31,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2fda43c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:47:31, skipping insertion in model container [2019-12-07 15:47:31,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:47:31" (3/3) ... [2019-12-07 15:47:31,089 INFO L109 eAbstractionObserver]: Analyzing ICFG safe033_power.opt.i [2019-12-07 15:47:31,095 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 15:47:31,095 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:47:31,100 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 15:47:31,101 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 15:47:31,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,122 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,123 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,124 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,125 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,126 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,127 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,128 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,129 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,130 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,131 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,132 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,133 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,134 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,135 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,136 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,137 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 15:47:31,147 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-07 15:47:31,160 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:47:31,160 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 15:47:31,160 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:47:31,160 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:47:31,160 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:47:31,160 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:47:31,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:47:31,160 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:47:31,170 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 134 places, 162 transitions [2019-12-07 15:47:31,172 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 15:47:31,215 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 15:47:31,215 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:47:31,223 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 15:47:31,233 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 134 places, 162 transitions [2019-12-07 15:47:31,254 INFO L134 PetriNetUnfolder]: 35/160 cut-off events. [2019-12-07 15:47:31,254 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 15:47:31,257 INFO L76 FinitePrefix]: Finished finitePrefix Result has 167 conditions, 160 events. 35/160 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 558 event pairs. 6/129 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-07 15:47:31,265 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-07 15:47:31,266 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 15:47:33,734 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 79 [2019-12-07 15:47:33,871 INFO L206 etLargeBlockEncoding]: Checked pairs total: 40283 [2019-12-07 15:47:33,871 INFO L214 etLargeBlockEncoding]: Total number of compositions: 100 [2019-12-07 15:47:33,873 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 66 places, 78 transitions [2019-12-07 15:47:34,112 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6362 states. [2019-12-07 15:47:34,113 INFO L276 IsEmpty]: Start isEmpty. Operand 6362 states. [2019-12-07 15:47:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:47:34,117 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:34,118 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:47:34,118 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:34,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:34,122 INFO L82 PathProgramCache]: Analyzing trace with hash 673057218, now seen corresponding path program 1 times [2019-12-07 15:47:34,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:34,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31866160] [2019-12-07 15:47:34,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:34,267 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 15:47:34,267 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31866160] [2019-12-07 15:47:34,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:34,268 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:47:34,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524867270] [2019-12-07 15:47:34,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:34,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:34,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:34,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:34,283 INFO L87 Difference]: Start difference. First operand 6362 states. Second operand 3 states. [2019-12-07 15:47:34,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:34,462 INFO L93 Difference]: Finished difference Result 6240 states and 21110 transitions. [2019-12-07 15:47:34,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:34,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-07 15:47:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:34,536 INFO L225 Difference]: With dead ends: 6240 [2019-12-07 15:47:34,536 INFO L226 Difference]: Without dead ends: 5850 [2019-12-07 15:47:34,537 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 15:47:34,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5850 states. [2019-12-07 15:47:34,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5850 to 5850. [2019-12-07 15:47:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2019-12-07 15:47:34,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 19754 transitions. [2019-12-07 15:47:34,753 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 19754 transitions. Word has length 5 [2019-12-07 15:47:34,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:34,753 INFO L462 AbstractCegarLoop]: Abstraction has 5850 states and 19754 transitions. [2019-12-07 15:47:34,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:34,754 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 19754 transitions. [2019-12-07 15:47:34,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 15:47:34,756 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:34,756 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:34,756 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:34,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:34,757 INFO L82 PathProgramCache]: Analyzing trace with hash 93905246, now seen corresponding path program 1 times [2019-12-07 15:47:34,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:34,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165934932] [2019-12-07 15:47:34,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:34,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:34,816 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 15:47:34,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165934932] [2019-12-07 15:47:34,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:34,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:34,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402594677] [2019-12-07 15:47:34,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:34,818 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:34,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:34,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:34,819 INFO L87 Difference]: Start difference. First operand 5850 states and 19754 transitions. Second operand 4 states. [2019-12-07 15:47:35,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:35,055 INFO L93 Difference]: Finished difference Result 9088 states and 29317 transitions. [2019-12-07 15:47:35,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:35,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 15:47:35,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:35,107 INFO L225 Difference]: With dead ends: 9088 [2019-12-07 15:47:35,108 INFO L226 Difference]: Without dead ends: 9073 [2019-12-07 15:47:35,108 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 15:47:35,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9073 states. [2019-12-07 15:47:35,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9073 to 8163. [2019-12-07 15:47:35,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8163 states. [2019-12-07 15:47:35,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8163 states to 8163 states and 26811 transitions. [2019-12-07 15:47:35,301 INFO L78 Accepts]: Start accepts. Automaton has 8163 states and 26811 transitions. Word has length 11 [2019-12-07 15:47:35,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:35,302 INFO L462 AbstractCegarLoop]: Abstraction has 8163 states and 26811 transitions. [2019-12-07 15:47:35,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:35,302 INFO L276 IsEmpty]: Start isEmpty. Operand 8163 states and 26811 transitions. [2019-12-07 15:47:35,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:47:35,305 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:35,305 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:35,305 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:35,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:35,306 INFO L82 PathProgramCache]: Analyzing trace with hash 1893769716, now seen corresponding path program 1 times [2019-12-07 15:47:35,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:35,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815653024] [2019-12-07 15:47:35,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:35,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:35,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:35,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815653024] [2019-12-07 15:47:35,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:35,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:35,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15635933] [2019-12-07 15:47:35,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:35,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:35,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:35,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:35,340 INFO L87 Difference]: Start difference. First operand 8163 states and 26811 transitions. Second operand 3 states. [2019-12-07 15:47:35,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:35,404 INFO L93 Difference]: Finished difference Result 10304 states and 33095 transitions. [2019-12-07 15:47:35,405 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:35,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-07 15:47:35,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:35,428 INFO L225 Difference]: With dead ends: 10304 [2019-12-07 15:47:35,428 INFO L226 Difference]: Without dead ends: 10304 [2019-12-07 15:47:35,428 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 15:47:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10304 states. [2019-12-07 15:47:35,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10304 to 8837. [2019-12-07 15:47:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8837 states. [2019-12-07 15:47:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8837 states to 8837 states and 28865 transitions. [2019-12-07 15:47:35,633 INFO L78 Accepts]: Start accepts. Automaton has 8837 states and 28865 transitions. Word has length 14 [2019-12-07 15:47:35,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:35,633 INFO L462 AbstractCegarLoop]: Abstraction has 8837 states and 28865 transitions. [2019-12-07 15:47:35,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:35,633 INFO L276 IsEmpty]: Start isEmpty. Operand 8837 states and 28865 transitions. [2019-12-07 15:47:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:47:35,635 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:35,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:35,635 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:35,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:35,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1890038153, now seen corresponding path program 1 times [2019-12-07 15:47:35,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:35,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387808333] [2019-12-07 15:47:35,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:35,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:35,676 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 15:47:35,676 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387808333] [2019-12-07 15:47:35,676 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:35,676 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:35,676 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724630984] [2019-12-07 15:47:35,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:35,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:35,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:35,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:35,677 INFO L87 Difference]: Start difference. First operand 8837 states and 28865 transitions. Second operand 4 states. [2019-12-07 15:47:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:35,798 INFO L93 Difference]: Finished difference Result 10707 states and 34201 transitions. [2019-12-07 15:47:35,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:35,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:47:35,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:35,813 INFO L225 Difference]: With dead ends: 10707 [2019-12-07 15:47:35,813 INFO L226 Difference]: Without dead ends: 10697 [2019-12-07 15:47:35,813 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 15:47:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10697 states. [2019-12-07 15:47:35,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10697 to 9298. [2019-12-07 15:47:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9298 states. [2019-12-07 15:47:35,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9298 states to 9298 states and 30231 transitions. [2019-12-07 15:47:35,979 INFO L78 Accepts]: Start accepts. Automaton has 9298 states and 30231 transitions. Word has length 14 [2019-12-07 15:47:35,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:35,979 INFO L462 AbstractCegarLoop]: Abstraction has 9298 states and 30231 transitions. [2019-12-07 15:47:35,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:35,979 INFO L276 IsEmpty]: Start isEmpty. Operand 9298 states and 30231 transitions. [2019-12-07 15:47:35,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:47:35,980 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:35,981 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:35,981 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:35,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:35,981 INFO L82 PathProgramCache]: Analyzing trace with hash 422006117, now seen corresponding path program 1 times [2019-12-07 15:47:35,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:35,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196621870] [2019-12-07 15:47:35,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:35,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:36,014 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 15:47:36,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196621870] [2019-12-07 15:47:36,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:36,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:36,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910963522] [2019-12-07 15:47:36,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:36,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:36,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:36,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:36,016 INFO L87 Difference]: Start difference. First operand 9298 states and 30231 transitions. Second operand 4 states. [2019-12-07 15:47:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:36,145 INFO L93 Difference]: Finished difference Result 11850 states and 37991 transitions. [2019-12-07 15:47:36,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:47:36,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-07 15:47:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:36,160 INFO L225 Difference]: With dead ends: 11850 [2019-12-07 15:47:36,160 INFO L226 Difference]: Without dead ends: 11835 [2019-12-07 15:47:36,160 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 15:47:36,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11835 states. [2019-12-07 15:47:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11835 to 9707. [2019-12-07 15:47:36,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9707 states. [2019-12-07 15:47:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9707 states to 9707 states and 31642 transitions. [2019-12-07 15:47:36,369 INFO L78 Accepts]: Start accepts. Automaton has 9707 states and 31642 transitions. Word has length 14 [2019-12-07 15:47:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:36,370 INFO L462 AbstractCegarLoop]: Abstraction has 9707 states and 31642 transitions. [2019-12-07 15:47:36,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 9707 states and 31642 transitions. [2019-12-07 15:47:36,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 15:47:36,373 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:36,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:36,373 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:36,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:36,373 INFO L82 PathProgramCache]: Analyzing trace with hash -247442678, now seen corresponding path program 1 times [2019-12-07 15:47:36,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:36,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774684415] [2019-12-07 15:47:36,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:36,403 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 15:47:36,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774684415] [2019-12-07 15:47:36,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:36,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:36,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800640717] [2019-12-07 15:47:36,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:36,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:36,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:36,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:36,405 INFO L87 Difference]: Start difference. First operand 9707 states and 31642 transitions. Second operand 3 states. [2019-12-07 15:47:36,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:36,416 INFO L93 Difference]: Finished difference Result 1607 states and 3887 transitions. [2019-12-07 15:47:36,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:36,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-07 15:47:36,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:36,419 INFO L225 Difference]: With dead ends: 1607 [2019-12-07 15:47:36,419 INFO L226 Difference]: Without dead ends: 1607 [2019-12-07 15:47:36,419 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 15:47:36,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-12-07 15:47:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1607. [2019-12-07 15:47:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1607 states. [2019-12-07 15:47:36,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1607 states to 1607 states and 3887 transitions. [2019-12-07 15:47:36,436 INFO L78 Accepts]: Start accepts. Automaton has 1607 states and 3887 transitions. Word has length 16 [2019-12-07 15:47:36,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:36,436 INFO L462 AbstractCegarLoop]: Abstraction has 1607 states and 3887 transitions. [2019-12-07 15:47:36,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:36,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1607 states and 3887 transitions. [2019-12-07 15:47:36,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:47:36,438 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:36,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:36,438 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:36,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:36,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1141853416, now seen corresponding path program 1 times [2019-12-07 15:47:36,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:36,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058558350] [2019-12-07 15:47:36,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:36,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:47:36,496 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058558350] [2019-12-07 15:47:36,497 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:36,497 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:36,497 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6670419] [2019-12-07 15:47:36,497 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:36,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:36,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:36,498 INFO L87 Difference]: Start difference. First operand 1607 states and 3887 transitions. Second operand 5 states. [2019-12-07 15:47:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:36,622 INFO L93 Difference]: Finished difference Result 2202 states and 5235 transitions. [2019-12-07 15:47:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:47:36,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 15:47:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:36,625 INFO L225 Difference]: With dead ends: 2202 [2019-12-07 15:47:36,625 INFO L226 Difference]: Without dead ends: 2200 [2019-12-07 15:47:36,625 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:47:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-12-07 15:47:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 1723. [2019-12-07 15:47:36,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-12-07 15:47:36,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 4159 transitions. [2019-12-07 15:47:36,652 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 4159 transitions. Word has length 26 [2019-12-07 15:47:36,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:36,653 INFO L462 AbstractCegarLoop]: Abstraction has 1723 states and 4159 transitions. [2019-12-07 15:47:36,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:36,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 4159 transitions. [2019-12-07 15:47:36,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:47:36,655 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:36,656 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:36,656 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:36,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:36,656 INFO L82 PathProgramCache]: Analyzing trace with hash -344365836, now seen corresponding path program 1 times [2019-12-07 15:47:36,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:36,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028517115] [2019-12-07 15:47:36,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:36,682 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 15:47:36,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028517115] [2019-12-07 15:47:36,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:36,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:36,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752174306] [2019-12-07 15:47:36,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:36,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:36,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:36,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:36,683 INFO L87 Difference]: Start difference. First operand 1723 states and 4159 transitions. Second operand 3 states. [2019-12-07 15:47:36,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:36,711 INFO L93 Difference]: Finished difference Result 2209 states and 5197 transitions. [2019-12-07 15:47:36,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:36,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-07 15:47:36,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:36,713 INFO L225 Difference]: With dead ends: 2209 [2019-12-07 15:47:36,714 INFO L226 Difference]: Without dead ends: 2209 [2019-12-07 15:47:36,714 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 15:47:36,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2209 states. [2019-12-07 15:47:36,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2209 to 1753. [2019-12-07 15:47:36,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1753 states. [2019-12-07 15:47:36,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1753 states to 1753 states and 4059 transitions. [2019-12-07 15:47:36,731 INFO L78 Accepts]: Start accepts. Automaton has 1753 states and 4059 transitions. Word has length 26 [2019-12-07 15:47:36,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:36,731 INFO L462 AbstractCegarLoop]: Abstraction has 1753 states and 4059 transitions. [2019-12-07 15:47:36,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:36,731 INFO L276 IsEmpty]: Start isEmpty. Operand 1753 states and 4059 transitions. [2019-12-07 15:47:36,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 15:47:36,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:36,733 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:36,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:36,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:36,733 INFO L82 PathProgramCache]: Analyzing trace with hash -281839928, now seen corresponding path program 1 times [2019-12-07 15:47:36,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:36,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896524903] [2019-12-07 15:47:36,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:36,790 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 15:47:36,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896524903] [2019-12-07 15:47:36,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:36,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:47:36,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683646162] [2019-12-07 15:47:36,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:36,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:36,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:36,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:36,792 INFO L87 Difference]: Start difference. First operand 1753 states and 4059 transitions. Second operand 5 states. [2019-12-07 15:47:37,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,027 INFO L93 Difference]: Finished difference Result 2526 states and 5750 transitions. [2019-12-07 15:47:37,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:47:37,027 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-07 15:47:37,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,030 INFO L225 Difference]: With dead ends: 2526 [2019-12-07 15:47:37,030 INFO L226 Difference]: Without dead ends: 2526 [2019-12-07 15:47:37,030 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:37,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2526 states. [2019-12-07 15:47:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2526 to 2091. [2019-12-07 15:47:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2091 states. [2019-12-07 15:47:37,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2091 states to 2091 states and 4785 transitions. [2019-12-07 15:47:37,050 INFO L78 Accepts]: Start accepts. Automaton has 2091 states and 4785 transitions. Word has length 26 [2019-12-07 15:47:37,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,051 INFO L462 AbstractCegarLoop]: Abstraction has 2091 states and 4785 transitions. [2019-12-07 15:47:37,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:37,051 INFO L276 IsEmpty]: Start isEmpty. Operand 2091 states and 4785 transitions. [2019-12-07 15:47:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:47:37,054 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,054 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 15:47:37,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1359644488, now seen corresponding path program 1 times [2019-12-07 15:47:37,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523886903] [2019-12-07 15:47:37,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:37,099 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 15:47:37,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523886903] [2019-12-07 15:47:37,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:37,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:37,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113147] [2019-12-07 15:47:37,100 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:47:37,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:37,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:47:37,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:47:37,101 INFO L87 Difference]: Start difference. First operand 2091 states and 4785 transitions. Second operand 5 states. [2019-12-07 15:47:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,217 INFO L93 Difference]: Finished difference Result 2585 states and 5903 transitions. [2019-12-07 15:47:37,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:47:37,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-07 15:47:37,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,222 INFO L225 Difference]: With dead ends: 2585 [2019-12-07 15:47:37,222 INFO L226 Difference]: Without dead ends: 2583 [2019-12-07 15:47:37,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:47:37,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2019-12-07 15:47:37,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2064. [2019-12-07 15:47:37,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2064 states. [2019-12-07 15:47:37,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 4700 transitions. [2019-12-07 15:47:37,248 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 4700 transitions. Word has length 27 [2019-12-07 15:47:37,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,249 INFO L462 AbstractCegarLoop]: Abstraction has 2064 states and 4700 transitions. [2019-12-07 15:47:37,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:47:37,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 4700 transitions. [2019-12-07 15:47:37,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 15:47:37,251 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,251 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 15:47:37,251 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,251 INFO L82 PathProgramCache]: Analyzing trace with hash 620709763, now seen corresponding path program 1 times [2019-12-07 15:47:37,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382106256] [2019-12-07 15:47:37,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:37,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 15:47:37,279 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382106256] [2019-12-07 15:47:37,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:37,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:37,280 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746286522] [2019-12-07 15:47:37,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:37,280 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:37,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:37,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:37,280 INFO L87 Difference]: Start difference. First operand 2064 states and 4700 transitions. Second operand 3 states. [2019-12-07 15:47:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,291 INFO L93 Difference]: Finished difference Result 3553 states and 8133 transitions. [2019-12-07 15:47:37,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:37,291 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 15:47:37,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,294 INFO L225 Difference]: With dead ends: 3553 [2019-12-07 15:47:37,294 INFO L226 Difference]: Without dead ends: 1801 [2019-12-07 15:47:37,294 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 15:47:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1801 states. [2019-12-07 15:47:37,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1801 to 1775. [2019-12-07 15:47:37,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1775 states. [2019-12-07 15:47:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 3993 transitions. [2019-12-07 15:47:37,311 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 3993 transitions. Word has length 27 [2019-12-07 15:47:37,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,311 INFO L462 AbstractCegarLoop]: Abstraction has 1775 states and 3993 transitions. [2019-12-07 15:47:37,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 3993 transitions. [2019-12-07 15:47:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 15:47:37,313 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,313 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 15:47:37,313 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash -607500421, now seen corresponding path program 1 times [2019-12-07 15:47:37,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,313 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913451689] [2019-12-07 15:47:37,313 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:37,340 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 15:47:37,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913451689] [2019-12-07 15:47:37,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:37,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 15:47:37,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223720580] [2019-12-07 15:47:37,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:47:37,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:37,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:47:37,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:47:37,342 INFO L87 Difference]: Start difference. First operand 1775 states and 3993 transitions. Second operand 4 states. [2019-12-07 15:47:37,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,355 INFO L93 Difference]: Finished difference Result 900 states and 1848 transitions. [2019-12-07 15:47:37,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:47:37,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-07 15:47:37,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,356 INFO L225 Difference]: With dead ends: 900 [2019-12-07 15:47:37,356 INFO L226 Difference]: Without dead ends: 770 [2019-12-07 15:47:37,356 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 15:47:37,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2019-12-07 15:47:37,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 740. [2019-12-07 15:47:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 740 states. [2019-12-07 15:47:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 740 states to 740 states and 1569 transitions. [2019-12-07 15:47:37,363 INFO L78 Accepts]: Start accepts. Automaton has 740 states and 1569 transitions. Word has length 28 [2019-12-07 15:47:37,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,363 INFO L462 AbstractCegarLoop]: Abstraction has 740 states and 1569 transitions. [2019-12-07 15:47:37,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:47:37,363 INFO L276 IsEmpty]: Start isEmpty. Operand 740 states and 1569 transitions. [2019-12-07 15:47:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 15:47:37,364 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,364 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] [2019-12-07 15:47:37,364 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,365 INFO L82 PathProgramCache]: Analyzing trace with hash 822694706, now seen corresponding path program 1 times [2019-12-07 15:47:37,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612098798] [2019-12-07 15:47:37,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:37,419 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 15:47:37,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612098798] [2019-12-07 15:47:37,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:37,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-07 15:47:37,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581456832] [2019-12-07 15:47:37,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:37,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:37,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:37,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:37,420 INFO L87 Difference]: Start difference. First operand 740 states and 1569 transitions. Second operand 6 states. [2019-12-07 15:47:37,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,660 INFO L93 Difference]: Finished difference Result 858 states and 1790 transitions. [2019-12-07 15:47:37,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:47:37,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-07 15:47:37,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,662 INFO L225 Difference]: With dead ends: 858 [2019-12-07 15:47:37,662 INFO L226 Difference]: Without dead ends: 858 [2019-12-07 15:47:37,662 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:47:37,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 858 states. [2019-12-07 15:47:37,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 858 to 758. [2019-12-07 15:47:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 758 states. [2019-12-07 15:47:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1602 transitions. [2019-12-07 15:47:37,696 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1602 transitions. Word has length 41 [2019-12-07 15:47:37,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,696 INFO L462 AbstractCegarLoop]: Abstraction has 758 states and 1602 transitions. [2019-12-07 15:47:37,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:37,696 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1602 transitions. [2019-12-07 15:47:37,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 15:47:37,698 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,698 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] [2019-12-07 15:47:37,698 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,698 INFO L82 PathProgramCache]: Analyzing trace with hash -692166072, now seen corresponding path program 2 times [2019-12-07 15:47:37,698 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,698 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040678054] [2019-12-07 15:47:37,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:37,736 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 15:47:37,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040678054] [2019-12-07 15:47:37,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:37,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:47:37,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811932122] [2019-12-07 15:47:37,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:47:37,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:37,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:47:37,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:47:37,738 INFO L87 Difference]: Start difference. First operand 758 states and 1602 transitions. Second operand 3 states. [2019-12-07 15:47:37,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,751 INFO L93 Difference]: Finished difference Result 758 states and 1600 transitions. [2019-12-07 15:47:37,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:47:37,751 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-07 15:47:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,753 INFO L225 Difference]: With dead ends: 758 [2019-12-07 15:47:37,753 INFO L226 Difference]: Without dead ends: 758 [2019-12-07 15:47:37,753 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 15:47:37,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 758 states. [2019-12-07 15:47:37,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 758 to 633. [2019-12-07 15:47:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2019-12-07 15:47:37,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 1363 transitions. [2019-12-07 15:47:37,762 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 1363 transitions. Word has length 41 [2019-12-07 15:47:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,762 INFO L462 AbstractCegarLoop]: Abstraction has 633 states and 1363 transitions. [2019-12-07 15:47:37,762 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:47:37,762 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 1363 transitions. [2019-12-07 15:47:37,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:47:37,763 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,763 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:37,764 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,764 INFO L82 PathProgramCache]: Analyzing trace with hash 501545049, now seen corresponding path program 1 times [2019-12-07 15:47:37,764 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,764 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290603540] [2019-12-07 15:47:37,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:47:37,832 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 15:47:37,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290603540] [2019-12-07 15:47:37,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:47:37,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 15:47:37,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080192929] [2019-12-07 15:47:37,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:47:37,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 15:47:37,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:47:37,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:47:37,834 INFO L87 Difference]: Start difference. First operand 633 states and 1363 transitions. Second operand 6 states. [2019-12-07 15:47:37,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:47:37,970 INFO L93 Difference]: Finished difference Result 1026 states and 2144 transitions. [2019-12-07 15:47:37,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:47:37,970 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 15:47:37,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:47:37,971 INFO L225 Difference]: With dead ends: 1026 [2019-12-07 15:47:37,971 INFO L226 Difference]: Without dead ends: 699 [2019-12-07 15:47:37,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-07 15:47:37,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-12-07 15:47:37,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 657. [2019-12-07 15:47:37,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2019-12-07 15:47:37,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 1390 transitions. [2019-12-07 15:47:37,978 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 1390 transitions. Word has length 42 [2019-12-07 15:47:37,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:47:37,978 INFO L462 AbstractCegarLoop]: Abstraction has 657 states and 1390 transitions. [2019-12-07 15:47:37,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:47:37,978 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 1390 transitions. [2019-12-07 15:47:37,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 15:47:37,979 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:47:37,979 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:47:37,979 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 15:47:37,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:47:37,980 INFO L82 PathProgramCache]: Analyzing trace with hash -296631181, now seen corresponding path program 2 times [2019-12-07 15:47:37,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 15:47:37,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356159462] [2019-12-07 15:47:37,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:47:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:47:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:47:38,045 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 15:47:38,045 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:47:38,048 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2563~0.base_24| 4) |v_#length_15|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0) (= 0 v_~x$w_buff0~0_579) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24| 1)) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24|) 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2563~0.base=|v_ULTIMATE.start_main_~#t2563~0.base_24|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2563~0.offset=|v_ULTIMATE.start_main_~#t2563~0.offset_18|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_25|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2563~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2564~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2563~0.offset, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2564~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:47:38,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11|) |v_ULTIMATE.start_main_~#t2564~0.offset_9| 1)) |v_#memory_int_5|) (not (= |v_ULTIMATE.start_main_~#t2564~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t2564~0.offset_9|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2564~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2564~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_11|, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2564~0.base, ULTIMATE.start_main_~#t2564~0.offset] because there is no mapped edge [2019-12-07 15:47:38,049 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 15:47:38,050 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1306386081 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1306386081| ~x$w_buff0~0_In-1306386081) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In-1306386081| |P0Thread1of1ForFork1_#t~ite8_Out-1306386081|)) (and (= ~x$w_buff0~0_In-1306386081 |P0Thread1of1ForFork1_#t~ite8_Out-1306386081|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1306386081 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1306386081 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1306386081 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1306386081 256) 0)))) (= |P0Thread1of1ForFork1_#t~ite9_Out-1306386081| |P0Thread1of1ForFork1_#t~ite8_Out-1306386081|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1306386081, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1306386081, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1306386081|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1306386081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1306386081, ~weak$$choice2~0=~weak$$choice2~0_In-1306386081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1306386081} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1306386081, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1306386081, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1306386081|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1306386081|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1306386081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1306386081, ~weak$$choice2~0=~weak$$choice2~0_In-1306386081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1306386081} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 15:47:38,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 15:47:38,052 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:47:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2059878142 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2059878142 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-2059878142| ~x$w_buff0_used~0_In-2059878142)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2059878142|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2059878142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2059878142} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2059878142, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2059878142|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2059878142} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:47:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In116447601 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In116447601 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In116447601 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In116447601 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out116447601|)) (and (= ~x$w_buff1_used~0_In116447601 |P1Thread1of1ForFork0_#t~ite29_Out116447601|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In116447601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In116447601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In116447601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116447601} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In116447601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In116447601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In116447601, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out116447601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116447601} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 15:47:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1127032080 256))) (.cse2 (= ~x$r_buff0_thd2~0_In1127032080 ~x$r_buff0_thd2~0_Out1127032080)) (.cse1 (= (mod ~x$w_buff0_used~0_In1127032080 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1127032080)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1127032080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1127032080} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1127032080|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1127032080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1127032080} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:47:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-595979082 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-595979082 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-595979082 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-595979082 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-595979082| ~x$r_buff1_thd2~0_In-595979082) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out-595979082| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-595979082, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-595979082, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-595979082, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-595979082} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-595979082|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-595979082, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-595979082, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-595979082, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-595979082} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 15:47:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 15:47:38,053 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:47:38,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In978062386 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out978062386| |ULTIMATE.start_main_#t~ite34_Out978062386|)) (.cse1 (= (mod ~x$w_buff1_used~0_In978062386 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~x~0_In978062386 |ULTIMATE.start_main_#t~ite34_Out978062386|)) (and (= ~x$w_buff1~0_In978062386 |ULTIMATE.start_main_#t~ite34_Out978062386|) (not .cse0) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In978062386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In978062386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In978062386, ~x~0=~x~0_In978062386} OutVars{~x$w_buff1~0=~x$w_buff1~0_In978062386, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out978062386|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In978062386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In978062386, ~x~0=~x~0_In978062386, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out978062386|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 15:47:38,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1042845594 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1042845594 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1042845594| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1042845594| ~x$w_buff0_used~0_In-1042845594)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1042845594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1042845594} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1042845594, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1042845594|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1042845594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 15:47:38,054 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2044264472 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2044264472 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2044264472 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2044264472 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out2044264472| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out2044264472| ~x$w_buff1_used~0_In2044264472)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2044264472, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2044264472, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2044264472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044264472} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2044264472, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2044264472, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2044264472|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2044264472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044264472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 15:47:38,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In71070660 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In71070660 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out71070660| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out71070660| ~x$r_buff0_thd0~0_In71070660)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In71070660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71070660} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In71070660, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out71070660|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71070660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 15:47:38,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In368633034 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In368633034 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In368633034 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In368633034 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out368633034| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out368633034| ~x$r_buff1_thd0~0_In368633034)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In368633034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In368633034, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In368633034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In368633034} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In368633034, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out368633034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In368633034, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In368633034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In368633034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 15:47:38,055 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:47:38,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:47:38 BasicIcfg [2019-12-07 15:47:38,103 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:47:38,104 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:47:38,104 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:47:38,104 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:47:38,104 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:47:31" (3/4) ... [2019-12-07 15:47:38,106 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 15:47:38,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] ULTIMATE.startENTRY-->L790: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= v_~x$mem_tmp~0_13 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~x$w_buff1~0_407) (= v_~x$r_buff1_thd1~0_273 0) (= 0 v_~x$r_buff0_thd2~0_163) (= v_~x$r_buff0_thd0~0_130 0) (= v_~y~0_90 0) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2563~0.base_24| 4) |v_#length_15|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0) (= 0 v_~x$w_buff0~0_579) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24| 1)) (= 0 v_~x$w_buff1_used~0_600) (= 0 v_~x$read_delayed~0_7) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) |v_ULTIMATE.start_main_~#t2563~0.offset_18| 0)) |v_#memory_int_11|) (= 0 v_~__unbuffered_cnt~0_87) (= 0 v_~x$w_buff0_used~0_867) (= v_~weak$$choice2~0_185 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2563~0.base_24|) 0) (= 0 v_~__unbuffered_p0_EAX~0_64) (= v_~x$r_buff0_thd1~0_344 0) (= |v_#NULL.offset_5| 0) (= v_~main$tmp_guard1~0_36 0) (= v_~x$flush_delayed~0_42 0) (= 0 v_~x~0_132) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~main$tmp_guard0~0_22 0) (= v_~x$r_buff1_thd0~0_139 0) (= 0 v_~x$r_buff1_thd2~0_124) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2563~0.base_24|) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_12))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_579, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_8|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_344, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_42, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_273, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_36, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ULTIMATE.start_main_~#t2563~0.base=|v_ULTIMATE.start_main_~#t2563~0.base_24|, #length=|v_#length_15|, ~y~0=v_~y~0_90, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_130, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_77|, ~x$w_buff1~0=v_~x$w_buff1~0_407, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_75|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_85|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_600, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_124, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_45|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_47|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_22, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_18|, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_139, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_163, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_53|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_867, ~weak$$choice0~0=v_~weak$$choice0~0_12, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t2563~0.offset=|v_ULTIMATE.start_main_~#t2563~0.offset_18|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_87, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_25|, ~weak$$choice2~0=v_~weak$$choice2~0_185, ~x~0=v_~x~0_132, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_#t~nondet32, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet33, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2563~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2564~0.offset, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ~x$read_delayed_var~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2563~0.offset, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2564~0.base, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-07 15:47:38,107 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [652] [652] L790-1-->L792: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11| 1)) (= (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t2564~0.base_11|) |v_ULTIMATE.start_main_~#t2564~0.offset_9| 1)) |v_#memory_int_5|) (not (= |v_ULTIMATE.start_main_~#t2564~0.base_11| 0)) (= 0 |v_ULTIMATE.start_main_~#t2564~0.offset_9|) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t2564~0.base_11|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t2564~0.base_11|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t2564~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_5|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_main_~#t2564~0.base=|v_ULTIMATE.start_main_~#t2564~0.base_11|, ULTIMATE.start_main_~#t2564~0.offset=|v_ULTIMATE.start_main_~#t2564~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2564~0.base, ULTIMATE.start_main_~#t2564~0.offset] because there is no mapped edge [2019-12-07 15:47:38,108 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [571] [571] L5-->L767: Formula: (and (= v_~x$r_buff1_thd0~0_14 v_~x$r_buff0_thd0~0_20) (= v_~x$r_buff1_thd2~0_10 v_~x$r_buff0_thd2~0_16) (= 1 v_~y~0_6) (= 1 v_~x$r_buff0_thd2~0_15) (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20 0)) (= v_~x$r_buff1_thd1~0_21 v_~x$r_buff0_thd1~0_41)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_16} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_20, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_41, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_20, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_10, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_15, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_14} AuxVars[] AssignedVars[~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-07 15:47:38,109 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [662] [662] L733-->L733-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1306386081 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite9_Out-1306386081| ~x$w_buff0~0_In-1306386081) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite8_In-1306386081| |P0Thread1of1ForFork1_#t~ite8_Out-1306386081|)) (and (= ~x$w_buff0~0_In-1306386081 |P0Thread1of1ForFork1_#t~ite8_Out-1306386081|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1306386081 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1306386081 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1306386081 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1306386081 256) 0)))) (= |P0Thread1of1ForFork1_#t~ite9_Out-1306386081| |P0Thread1of1ForFork1_#t~ite8_Out-1306386081|) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1306386081, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1306386081, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_In-1306386081|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1306386081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1306386081, ~weak$$choice2~0=~weak$$choice2~0_In-1306386081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1306386081} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1306386081, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1306386081, P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-1306386081|, P0Thread1of1ForFork1_#t~ite9=|P0Thread1of1ForFork1_#t~ite9_Out-1306386081|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1306386081, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1306386081, ~weak$$choice2~0=~weak$$choice2~0_In-1306386081, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1306386081} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#t~ite9] because there is no mapped edge [2019-12-07 15:47:38,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L737-->L738: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_33 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_33} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_14|, ~weak$$choice2~0=v_~weak$$choice2~0_33} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite19] because there is no mapped edge [2019-12-07 15:47:38,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [596] [596] L740-->L748: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~x$mem_tmp~0_4 v_~x~0_29) (= v_~x$flush_delayed~0_15 0) (not (= (mod v_~x$flush_delayed~0_16 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_19|, ~x$flush_delayed~0=v_~x$flush_delayed~0_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-07 15:47:38,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [626] [626] L768-->L768-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-2059878142 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-2059878142 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-2059878142| ~x$w_buff0_used~0_In-2059878142)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-2059878142|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2059878142, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2059878142} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2059878142, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-2059878142|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2059878142} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-07 15:47:38,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd2~0_In116447601 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In116447601 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In116447601 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In116447601 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite29_Out116447601|)) (and (= ~x$w_buff1_used~0_In116447601 |P1Thread1of1ForFork0_#t~ite29_Out116447601|) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In116447601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In116447601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In116447601, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116447601} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In116447601, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In116447601, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In116447601, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out116447601|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In116447601} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-07 15:47:38,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L770-->L771: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In1127032080 256))) (.cse2 (= ~x$r_buff0_thd2~0_In1127032080 ~x$r_buff0_thd2~0_Out1127032080)) (.cse1 (= (mod ~x$w_buff0_used~0_In1127032080 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~x$r_buff0_thd2~0_Out1127032080)) (and .cse2 .cse0) (and .cse2 .cse1))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1127032080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1127032080} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1127032080|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1127032080, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1127032080} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-07 15:47:38,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [630] [630] L771-->L771-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd2~0_In-595979082 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-595979082 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-595979082 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-595979082 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite31_Out-595979082| ~x$r_buff1_thd2~0_In-595979082) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork0_#t~ite31_Out-595979082| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-595979082, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-595979082, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-595979082, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-595979082} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-595979082|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-595979082, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-595979082, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-595979082, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-595979082} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-07 15:47:38,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [651] [651] L771-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~x$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork0_#t~ite31_34|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_58, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 15:47:38,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [573] [573] L792-1-->L798: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_6 256))) (= v_~main$tmp_guard0~0_6 (ite (= 0 (ite (= 2 v_~__unbuffered_cnt~0_11) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet33, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 15:47:38,112 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [628] [628] L798-2-->L798-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In978062386 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite35_Out978062386| |ULTIMATE.start_main_#t~ite34_Out978062386|)) (.cse1 (= (mod ~x$w_buff1_used~0_In978062386 256) 0))) (or (and (or .cse0 .cse1) .cse2 (= ~x~0_In978062386 |ULTIMATE.start_main_#t~ite34_Out978062386|)) (and (= ~x$w_buff1~0_In978062386 |ULTIMATE.start_main_#t~ite34_Out978062386|) (not .cse0) .cse2 (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In978062386, ~x$w_buff1_used~0=~x$w_buff1_used~0_In978062386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In978062386, ~x~0=~x~0_In978062386} OutVars{~x$w_buff1~0=~x$w_buff1~0_In978062386, ULTIMATE.start_main_#t~ite35=|ULTIMATE.start_main_#t~ite35_Out978062386|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In978062386, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In978062386, ~x~0=~x~0_In978062386, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out978062386|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-07 15:47:38,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1042845594 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In-1042845594 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1042845594| 0)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-1042845594| ~x$w_buff0_used~0_In-1042845594)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1042845594, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1042845594} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1042845594, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-1042845594|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1042845594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-07 15:47:38,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L800-->L800-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In2044264472 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In2044264472 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd0~0_In2044264472 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In2044264472 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite37_Out2044264472| 0)) (and (or .cse1 .cse0) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite37_Out2044264472| ~x$w_buff1_used~0_In2044264472)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2044264472, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2044264472, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2044264472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044264472} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2044264472, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2044264472, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out2044264472|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In2044264472, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2044264472} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-07 15:47:38,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [632] [632] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In71070660 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In71070660 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite38_Out71070660| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite38_Out71070660| ~x$r_buff0_thd0~0_In71070660)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In71070660, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71070660} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In71070660, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out71070660|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In71070660} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-07 15:47:38,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [633] [633] L802-->L802-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd0~0_In368633034 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In368633034 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In368633034 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In368633034 256)))) (or (and (= |ULTIMATE.start_main_#t~ite39_Out368633034| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite39_Out368633034| ~x$r_buff1_thd0~0_In368633034)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In368633034, ~x$w_buff1_used~0=~x$w_buff1_used~0_In368633034, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In368633034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In368633034} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In368633034, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out368633034|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In368633034, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In368633034, ~x$w_buff0_used~0=~x$w_buff0_used~0_In368633034} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-07 15:47:38,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L802-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16| (mod v_~main$tmp_guard1~0_22 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_23 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|) (= v_~main$tmp_guard1~0_22 (ite (= 0 (ite (not (and (= v_~y~0_54 2) (= 0 v_~__unbuffered_p0_EAX~0_44))) 1 0)) 0 1)) (= v_~x$r_buff1_thd0~0_101 |v_ULTIMATE.start_main_#t~ite39_53|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_53|, ~y~0=v_~y~0_54} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_44, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_23, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_52|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~y~0=v_~y~0_54, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_101, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_16|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 15:47:38,171 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fbc7e85c-011f-4189-adbe-1a6cda99a195/bin/uautomizer/witness.graphml [2019-12-07 15:47:38,171 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:47:38,172 INFO L168 Benchmark]: Toolchain (without parser) took 7879.39 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 459.8 MB). Free memory was 938.7 MB in the beginning and 1.3 GB in the end (delta: -321.3 MB). Peak memory consumption was 138.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:47:38,173 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:47:38,173 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 15:47:38,174 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.29 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 15:47:38,174 INFO L168 Benchmark]: Boogie Preprocessor took 24.09 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 15:47:38,174 INFO L168 Benchmark]: RCFGBuilder took 363.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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:47:38,175 INFO L168 Benchmark]: TraceAbstraction took 7018.40 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 359.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -266.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:47:38,175 INFO L168 Benchmark]: Witness Printer took 67.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:47:38,177 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.99 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 938.7 MB in the beginning and 1.1 GB in the end (delta: -132.3 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 37.29 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.09 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 363.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: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7018.40 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 359.1 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -266.5 MB). Peak memory consumption was 92.6 MB. Max. memory is 11.5 GB. * Witness Printer took 67.46 ms. Allocated memory is still 1.5 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 2.7s, 134 ProgramPointsBefore, 66 ProgramPointsAfterwards, 162 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 28 TrivialSequentialCompositions, 40 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 19 ChoiceCompositions, 4187 VarBasedMoverChecksPositive, 229 VarBasedMoverChecksNegative, 93 SemBasedMoverChecksPositive, 194 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.8s, 0 MoverChecksTotal, 40283 CheckedPairsTotal, 100 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L790] FCALL, FORK 0 pthread_create(&t2563, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L792] FCALL, FORK 0 pthread_create(&t2564, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L753] 2 x$w_buff1 = x$w_buff0 [L754] 2 x$w_buff0 = 1 [L755] 2 x$w_buff1_used = x$w_buff0_used [L756] 2 x$w_buff0_used = (_Bool)1 [L723] 1 y = 2 [L728] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L729] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L730] 1 x$flush_delayed = weak$$choice2 [L731] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)=5, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L734] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L735] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L736] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L768] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L769] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L799] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L800] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L801] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 128 locations, 2 error locations. Result: UNSAFE, OverallTime: 6.8s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1660 SDtfs, 1227 SDslu, 2440 SDs, 0 SdLazy, 1428 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9707occurred 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: 1.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 8114 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 400 NumberOfCodeBlocks, 400 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 343 ConstructedInterpolants, 0 QuantifiedInterpolants, 30093 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 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...