./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/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 27a332b61d5f66b14b3f326393227d79560650d5 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 17:47:17,603 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 17:47:17,604 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 17:47:17,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 17:47:17,612 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 17:47:17,613 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 17:47:17,614 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 17:47:17,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 17:47:17,617 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 17:47:17,618 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 17:47:17,618 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 17:47:17,619 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 17:47:17,619 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 17:47:17,620 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 17:47:17,621 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 17:47:17,621 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 17:47:17,622 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 17:47:17,623 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 17:47:17,624 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 17:47:17,626 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 17:47:17,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 17:47:17,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 17:47:17,629 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 17:47:17,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 17:47:17,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 17:47:17,631 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 17:47:17,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 17:47:17,632 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 17:47:17,632 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 17:47:17,633 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 17:47:17,633 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 17:47:17,634 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 17:47:17,634 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 17:47:17,635 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 17:47:17,636 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 17:47:17,636 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 17:47:17,636 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 17:47:17,636 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 17:47:17,637 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 17:47:17,637 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 17:47:17,638 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 17:47:17,638 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 17:47:17,651 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 17:47:17,651 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 17:47:17,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 17:47:17,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 17:47:17,652 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 17:47:17,653 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 17:47:17,653 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 17:47:17,653 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 17:47:17,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 17:47:17,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 17:47:17,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 17:47:17,654 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 17:47:17,654 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 17:47:17,654 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 17:47:17,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 17:47:17,654 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 17:47:17,655 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 17:47:17,655 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 17:47:17,655 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 17:47:17,655 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 17:47:17,655 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 17:47:17,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 17:47:17,656 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 17:47:17,656 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 17:47:17,656 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 17:47:17,656 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 17:47:17,656 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 17:47:17,657 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 17:47:17,657 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 17:47:17,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_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/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 -> 27a332b61d5f66b14b3f326393227d79560650d5 [2019-12-07 17:47:17,760 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 17:47:17,768 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 17:47:17,770 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 17:47:17,772 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 17:47:17,772 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 17:47:17,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i [2019-12-07 17:47:17,815 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/data/633c95f22/c99c3d013a884319ab673440305b99c9/FLAGb4efb4e1f [2019-12-07 17:47:18,192 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 17:47:18,193 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/sv-benchmarks/c/pthread-wmm/mix032_power.oepc.i [2019-12-07 17:47:18,203 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/data/633c95f22/c99c3d013a884319ab673440305b99c9/FLAGb4efb4e1f [2019-12-07 17:47:18,212 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/data/633c95f22/c99c3d013a884319ab673440305b99c9 [2019-12-07 17:47:18,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 17:47:18,215 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 17:47:18,216 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 17:47:18,216 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 17:47:18,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 17:47:18,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,220 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a2ff042 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18, skipping insertion in model container [2019-12-07 17:47:18,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 17:47:18,263 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 17:47:18,517 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:47:18,525 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 17:47:18,570 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 17:47:18,616 INFO L208 MainTranslator]: Completed translation [2019-12-07 17:47:18,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18 WrapperNode [2019-12-07 17:47:18,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 17:47:18,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 17:47:18,617 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 17:47:18,617 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 17:47:18,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,636 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,656 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 17:47:18,656 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 17:47:18,656 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 17:47:18,656 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 17:47:18,663 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,663 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,666 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,674 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,677 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,679 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... [2019-12-07 17:47:18,683 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 17:47:18,683 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 17:47:18,683 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 17:47:18,683 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 17:47:18,684 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/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 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-07 17:47:18,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-07 17:47:18,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-07 17:47:18,728 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-07 17:47:18,728 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-07 17:47:18,729 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 17:47:18,729 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 17:47:18,730 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 17:47:19,103 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 17:47:19,103 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 17:47:19,104 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:47:19 BoogieIcfgContainer [2019-12-07 17:47:19,104 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 17:47:19,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 17:47:19,106 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 17:47:19,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 17:47:19,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 05:47:18" (1/3) ... [2019-12-07 17:47:19,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79ad98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:47:19, skipping insertion in model container [2019-12-07 17:47:19,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 05:47:18" (2/3) ... [2019-12-07 17:47:19,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e79ad98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 05:47:19, skipping insertion in model container [2019-12-07 17:47:19,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:47:19" (3/3) ... [2019-12-07 17:47:19,111 INFO L109 eAbstractionObserver]: Analyzing ICFG mix032_power.oepc.i [2019-12-07 17:47:19,118 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-07 17:47:19,118 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 17:47:19,123 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 17:47:19,123 INFO L339 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-07 17:47:19,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,149 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,149 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,150 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,150 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,151 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,152 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,153 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,154 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,155 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,160 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,161 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,161 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,162 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,163 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,164 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,165 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,166 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,167 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,168 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,169 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,170 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,171 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,172 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,173 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,174 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,175 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,176 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,177 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,178 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,179 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-07 17:47:19,196 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-07 17:47:19,209 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 17:47:19,209 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 17:47:19,209 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 17:47:19,209 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 17:47:19,209 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 17:47:19,209 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 17:47:19,209 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 17:47:19,209 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 17:47:19,220 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 180 places, 217 transitions [2019-12-07 17:47:19,221 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 17:47:19,283 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 17:47:19,284 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:47:19,293 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 702 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 17:47:19,308 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 180 places, 217 transitions [2019-12-07 17:47:19,342 INFO L134 PetriNetUnfolder]: 47/214 cut-off events. [2019-12-07 17:47:19,342 INFO L135 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-07 17:47:19,348 INFO L76 FinitePrefix]: Finished finitePrefix Result has 224 conditions, 214 events. 47/214 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 702 event pairs. 9/174 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-07 17:47:19,364 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-07 17:47:19,364 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-07 17:47:22,374 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-12-07 17:47:22,571 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 97 [2019-12-07 17:47:22,676 INFO L206 etLargeBlockEncoding]: Checked pairs total: 83556 [2019-12-07 17:47:22,677 INFO L214 etLargeBlockEncoding]: Total number of compositions: 115 [2019-12-07 17:47:22,679 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 105 transitions [2019-12-07 17:47:40,854 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129602 states. [2019-12-07 17:47:40,856 INFO L276 IsEmpty]: Start isEmpty. Operand 129602 states. [2019-12-07 17:47:40,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 17:47:40,860 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:40,861 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 17:47:40,861 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:40,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:40,865 INFO L82 PathProgramCache]: Analyzing trace with hash 923865, now seen corresponding path program 1 times [2019-12-07 17:47:40,870 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:40,870 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090470822] [2019-12-07 17:47:40,870 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:40,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:41,009 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 17:47:41,010 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090470822] [2019-12-07 17:47:41,010 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:41,010 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 17:47:41,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716508551] [2019-12-07 17:47:41,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:47:41,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:41,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:47:41,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:47:41,025 INFO L87 Difference]: Start difference. First operand 129602 states. Second operand 3 states. [2019-12-07 17:47:41,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:41,858 INFO L93 Difference]: Finished difference Result 128376 states and 546782 transitions. [2019-12-07 17:47:41,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:47:41,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 17:47:41,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:42,333 INFO L225 Difference]: With dead ends: 128376 [2019-12-07 17:47:42,334 INFO L226 Difference]: Without dead ends: 120914 [2019-12-07 17:47:42,335 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 17:47:48,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120914 states. [2019-12-07 17:47:51,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120914 to 120914. [2019-12-07 17:47:51,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120914 states. [2019-12-07 17:47:51,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120914 states to 120914 states and 514358 transitions. [2019-12-07 17:47:51,608 INFO L78 Accepts]: Start accepts. Automaton has 120914 states and 514358 transitions. Word has length 3 [2019-12-07 17:47:51,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:47:51,608 INFO L462 AbstractCegarLoop]: Abstraction has 120914 states and 514358 transitions. [2019-12-07 17:47:51,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:47:51,608 INFO L276 IsEmpty]: Start isEmpty. Operand 120914 states and 514358 transitions. [2019-12-07 17:47:51,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 17:47:51,612 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:47:51,612 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:47:51,612 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:47:51,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:47:51,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2102120012, now seen corresponding path program 1 times [2019-12-07 17:47:51,612 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:47:51,612 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080967124] [2019-12-07 17:47:51,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:47:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:47:51,678 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 17:47:51,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080967124] [2019-12-07 17:47:51,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:47:51,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:47:51,679 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243522492] [2019-12-07 17:47:51,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:47:51,680 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:47:51,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:47:51,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:47:51,680 INFO L87 Difference]: Start difference. First operand 120914 states and 514358 transitions. Second operand 4 states. [2019-12-07 17:47:52,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:47:52,666 INFO L93 Difference]: Finished difference Result 187704 states and 768206 transitions. [2019-12-07 17:47:52,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:47:52,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-07 17:47:52,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:47:53,604 INFO L225 Difference]: With dead ends: 187704 [2019-12-07 17:47:53,605 INFO L226 Difference]: Without dead ends: 187655 [2019-12-07 17:47:53,605 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 17:48:01,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187655 states. [2019-12-07 17:48:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187655 to 171775. [2019-12-07 17:48:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171775 states. [2019-12-07 17:48:04,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171775 states to 171775 states and 711726 transitions. [2019-12-07 17:48:04,611 INFO L78 Accepts]: Start accepts. Automaton has 171775 states and 711726 transitions. Word has length 11 [2019-12-07 17:48:04,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:04,612 INFO L462 AbstractCegarLoop]: Abstraction has 171775 states and 711726 transitions. [2019-12-07 17:48:04,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:04,612 INFO L276 IsEmpty]: Start isEmpty. Operand 171775 states and 711726 transitions. [2019-12-07 17:48:04,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 17:48:04,617 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:04,617 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:04,618 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:04,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:04,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1617299066, now seen corresponding path program 1 times [2019-12-07 17:48:04,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:04,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449330475] [2019-12-07 17:48:04,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:04,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:04,669 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 17:48:04,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449330475] [2019-12-07 17:48:04,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:04,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:04,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84021320] [2019-12-07 17:48:04,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:04,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:04,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:04,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:04,670 INFO L87 Difference]: Start difference. First operand 171775 states and 711726 transitions. Second operand 4 states. [2019-12-07 17:48:06,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:06,348 INFO L93 Difference]: Finished difference Result 242262 states and 982161 transitions. [2019-12-07 17:48:06,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:06,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-07 17:48:06,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:06,967 INFO L225 Difference]: With dead ends: 242262 [2019-12-07 17:48:06,967 INFO L226 Difference]: Without dead ends: 242206 [2019-12-07 17:48:06,968 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 17:48:14,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242206 states. [2019-12-07 17:48:19,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242206 to 205026. [2019-12-07 17:48:19,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205026 states. [2019-12-07 17:48:20,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205026 states to 205026 states and 845145 transitions. [2019-12-07 17:48:20,225 INFO L78 Accepts]: Start accepts. Automaton has 205026 states and 845145 transitions. Word has length 13 [2019-12-07 17:48:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:20,226 INFO L462 AbstractCegarLoop]: Abstraction has 205026 states and 845145 transitions. [2019-12-07 17:48:20,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 205026 states and 845145 transitions. [2019-12-07 17:48:20,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 17:48:20,235 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:20,235 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:20,235 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:20,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:20,236 INFO L82 PathProgramCache]: Analyzing trace with hash 947448332, now seen corresponding path program 1 times [2019-12-07 17:48:20,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:20,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366890812] [2019-12-07 17:48:20,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:20,285 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 17:48:20,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366890812] [2019-12-07 17:48:20,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:20,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:20,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485779203] [2019-12-07 17:48:20,286 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:20,286 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:20,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:20,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:20,287 INFO L87 Difference]: Start difference. First operand 205026 states and 845145 transitions. Second operand 5 states. [2019-12-07 17:48:22,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:22,128 INFO L93 Difference]: Finished difference Result 278815 states and 1138912 transitions. [2019-12-07 17:48:22,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:48:22,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-07 17:48:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:22,834 INFO L225 Difference]: With dead ends: 278815 [2019-12-07 17:48:22,834 INFO L226 Difference]: Without dead ends: 278815 [2019-12-07 17:48:22,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:30,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278815 states. [2019-12-07 17:48:33,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278815 to 233994. [2019-12-07 17:48:33,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233994 states. [2019-12-07 17:48:34,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233994 states to 233994 states and 963338 transitions. [2019-12-07 17:48:34,663 INFO L78 Accepts]: Start accepts. Automaton has 233994 states and 963338 transitions. Word has length 16 [2019-12-07 17:48:34,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:34,663 INFO L462 AbstractCegarLoop]: Abstraction has 233994 states and 963338 transitions. [2019-12-07 17:48:34,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:34,664 INFO L276 IsEmpty]: Start isEmpty. Operand 233994 states and 963338 transitions. [2019-12-07 17:48:34,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 17:48:34,678 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:34,678 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:34,678 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:34,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:34,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1320991791, now seen corresponding path program 1 times [2019-12-07 17:48:34,679 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:34,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820133788] [2019-12-07 17:48:34,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:34,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:34,718 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 17:48:34,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820133788] [2019-12-07 17:48:34,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:34,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:34,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224685440] [2019-12-07 17:48:34,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:34,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:34,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:34,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:34,720 INFO L87 Difference]: Start difference. First operand 233994 states and 963338 transitions. Second operand 3 states. [2019-12-07 17:48:34,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:34,851 INFO L93 Difference]: Finished difference Result 43149 states and 139668 transitions. [2019-12-07 17:48:34,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:34,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 17:48:34,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:34,914 INFO L225 Difference]: With dead ends: 43149 [2019-12-07 17:48:34,914 INFO L226 Difference]: Without dead ends: 43149 [2019-12-07 17:48:34,914 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 17:48:35,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43149 states. [2019-12-07 17:48:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43149 to 43029. [2019-12-07 17:48:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43029 states. [2019-12-07 17:48:37,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43029 states to 43029 states and 139308 transitions. [2019-12-07 17:48:37,784 INFO L78 Accepts]: Start accepts. Automaton has 43029 states and 139308 transitions. Word has length 18 [2019-12-07 17:48:37,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:37,784 INFO L462 AbstractCegarLoop]: Abstraction has 43029 states and 139308 transitions. [2019-12-07 17:48:37,784 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:37,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43029 states and 139308 transitions. [2019-12-07 17:48:37,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 17:48:37,789 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:37,789 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:37,789 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:37,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:37,789 INFO L82 PathProgramCache]: Analyzing trace with hash -282717849, now seen corresponding path program 1 times [2019-12-07 17:48:37,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:37,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536885608] [2019-12-07 17:48:37,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:37,843 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 17:48:37,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536885608] [2019-12-07 17:48:37,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:37,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:48:37,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521647294] [2019-12-07 17:48:37,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:48:37,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:48:37,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:48:37,845 INFO L87 Difference]: Start difference. First operand 43029 states and 139308 transitions. Second operand 6 states. [2019-12-07 17:48:38,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:38,427 INFO L93 Difference]: Finished difference Result 64122 states and 202692 transitions. [2019-12-07 17:48:38,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 17:48:38,428 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-07 17:48:38,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:38,521 INFO L225 Difference]: With dead ends: 64122 [2019-12-07 17:48:38,521 INFO L226 Difference]: Without dead ends: 64115 [2019-12-07 17:48:38,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-07 17:48:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64115 states. [2019-12-07 17:48:39,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64115 to 42953. [2019-12-07 17:48:39,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42953 states. [2019-12-07 17:48:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42953 states to 42953 states and 138310 transitions. [2019-12-07 17:48:39,395 INFO L78 Accepts]: Start accepts. Automaton has 42953 states and 138310 transitions. Word has length 22 [2019-12-07 17:48:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:39,395 INFO L462 AbstractCegarLoop]: Abstraction has 42953 states and 138310 transitions. [2019-12-07 17:48:39,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:48:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 42953 states and 138310 transitions. [2019-12-07 17:48:39,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 17:48:39,404 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:39,404 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:39,404 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:39,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:39,404 INFO L82 PathProgramCache]: Analyzing trace with hash -71664384, now seen corresponding path program 1 times [2019-12-07 17:48:39,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:39,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547857680] [2019-12-07 17:48:39,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:39,445 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 17:48:39,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547857680] [2019-12-07 17:48:39,446 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:39,446 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:39,446 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659393059] [2019-12-07 17:48:39,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:39,447 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:39,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:39,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:39,447 INFO L87 Difference]: Start difference. First operand 42953 states and 138310 transitions. Second operand 5 states. [2019-12-07 17:48:39,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:39,853 INFO L93 Difference]: Finished difference Result 59467 states and 187866 transitions. [2019-12-07 17:48:39,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 17:48:39,853 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-07 17:48:39,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:39,940 INFO L225 Difference]: With dead ends: 59467 [2019-12-07 17:48:39,940 INFO L226 Difference]: Without dead ends: 59454 [2019-12-07 17:48:39,941 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 17:48:40,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59454 states. [2019-12-07 17:48:40,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59454 to 50886. [2019-12-07 17:48:40,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50886 states. [2019-12-07 17:48:40,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50886 states to 50886 states and 163152 transitions. [2019-12-07 17:48:40,888 INFO L78 Accepts]: Start accepts. Automaton has 50886 states and 163152 transitions. Word has length 25 [2019-12-07 17:48:40,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:40,888 INFO L462 AbstractCegarLoop]: Abstraction has 50886 states and 163152 transitions. [2019-12-07 17:48:40,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:40,888 INFO L276 IsEmpty]: Start isEmpty. Operand 50886 states and 163152 transitions. [2019-12-07 17:48:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:48:40,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:40,903 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 17:48:40,903 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:40,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:40,903 INFO L82 PathProgramCache]: Analyzing trace with hash -1418175430, now seen corresponding path program 1 times [2019-12-07 17:48:40,903 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:40,903 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141609098] [2019-12-07 17:48:40,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:40,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:40,934 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 17:48:40,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141609098] [2019-12-07 17:48:40,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:40,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:40,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646778187] [2019-12-07 17:48:40,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:40,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:40,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:40,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:40,935 INFO L87 Difference]: Start difference. First operand 50886 states and 163152 transitions. Second operand 3 states. [2019-12-07 17:48:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:41,156 INFO L93 Difference]: Finished difference Result 74013 states and 234091 transitions. [2019-12-07 17:48:41,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:41,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-07 17:48:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:41,266 INFO L225 Difference]: With dead ends: 74013 [2019-12-07 17:48:41,266 INFO L226 Difference]: Without dead ends: 74013 [2019-12-07 17:48:41,267 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 17:48:41,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74013 states. [2019-12-07 17:48:42,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74013 to 56506. [2019-12-07 17:48:42,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56506 states. [2019-12-07 17:48:42,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56506 states to 56506 states and 179474 transitions. [2019-12-07 17:48:42,403 INFO L78 Accepts]: Start accepts. Automaton has 56506 states and 179474 transitions. Word has length 27 [2019-12-07 17:48:42,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:42,403 INFO L462 AbstractCegarLoop]: Abstraction has 56506 states and 179474 transitions. [2019-12-07 17:48:42,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:42,403 INFO L276 IsEmpty]: Start isEmpty. Operand 56506 states and 179474 transitions. [2019-12-07 17:48:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 17:48:42,418 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:42,419 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 17:48:42,419 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:42,419 INFO L82 PathProgramCache]: Analyzing trace with hash 1834697800, now seen corresponding path program 1 times [2019-12-07 17:48:42,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:42,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057477663] [2019-12-07 17:48:42,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:42,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:42,467 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 17:48:42,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057477663] [2019-12-07 17:48:42,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:42,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:48:42,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114223405] [2019-12-07 17:48:42,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 17:48:42,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:42,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 17:48:42,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:48:42,468 INFO L87 Difference]: Start difference. First operand 56506 states and 179474 transitions. Second operand 6 states. [2019-12-07 17:48:42,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:42,957 INFO L93 Difference]: Finished difference Result 78952 states and 245809 transitions. [2019-12-07 17:48:42,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 17:48:42,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-07 17:48:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:43,070 INFO L225 Difference]: With dead ends: 78952 [2019-12-07 17:48:43,070 INFO L226 Difference]: Without dead ends: 78910 [2019-12-07 17:48:43,070 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:48:43,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78910 states. [2019-12-07 17:48:44,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78910 to 61263. [2019-12-07 17:48:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61263 states. [2019-12-07 17:48:44,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61263 states to 61263 states and 194050 transitions. [2019-12-07 17:48:44,209 INFO L78 Accepts]: Start accepts. Automaton has 61263 states and 194050 transitions. Word has length 27 [2019-12-07 17:48:44,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:44,209 INFO L462 AbstractCegarLoop]: Abstraction has 61263 states and 194050 transitions. [2019-12-07 17:48:44,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 17:48:44,210 INFO L276 IsEmpty]: Start isEmpty. Operand 61263 states and 194050 transitions. [2019-12-07 17:48:44,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 17:48:44,229 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:44,229 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 17:48:44,229 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:44,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:44,229 INFO L82 PathProgramCache]: Analyzing trace with hash -451110081, now seen corresponding path program 1 times [2019-12-07 17:48:44,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:44,229 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781745672] [2019-12-07 17:48:44,229 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:44,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:48:44,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781745672] [2019-12-07 17:48:44,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:44,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:48:44,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952507197] [2019-12-07 17:48:44,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:44,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:44,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:44,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:44,279 INFO L87 Difference]: Start difference. First operand 61263 states and 194050 transitions. Second operand 5 states. [2019-12-07 17:48:44,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:44,908 INFO L93 Difference]: Finished difference Result 81964 states and 257627 transitions. [2019-12-07 17:48:44,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 17:48:44,908 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-07 17:48:44,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:45,036 INFO L225 Difference]: With dead ends: 81964 [2019-12-07 17:48:45,036 INFO L226 Difference]: Without dead ends: 81964 [2019-12-07 17:48:45,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:48:45,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81964 states. [2019-12-07 17:48:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81964 to 72748. [2019-12-07 17:48:46,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72748 states. [2019-12-07 17:48:46,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72748 states to 72748 states and 230494 transitions. [2019-12-07 17:48:46,307 INFO L78 Accepts]: Start accepts. Automaton has 72748 states and 230494 transitions. Word has length 28 [2019-12-07 17:48:46,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:46,308 INFO L462 AbstractCegarLoop]: Abstraction has 72748 states and 230494 transitions. [2019-12-07 17:48:46,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:46,308 INFO L276 IsEmpty]: Start isEmpty. Operand 72748 states and 230494 transitions. [2019-12-07 17:48:46,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:48:46,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:46,333 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:46,333 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:46,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:46,333 INFO L82 PathProgramCache]: Analyzing trace with hash 1998937694, now seen corresponding path program 1 times [2019-12-07 17:48:46,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:46,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598341541] [2019-12-07 17:48:46,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:46,362 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 17:48:46,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598341541] [2019-12-07 17:48:46,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:46,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:46,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121899977] [2019-12-07 17:48:46,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:46,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:46,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:46,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:46,363 INFO L87 Difference]: Start difference. First operand 72748 states and 230494 transitions. Second operand 3 states. [2019-12-07 17:48:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:46,558 INFO L93 Difference]: Finished difference Result 70151 states and 220469 transitions. [2019-12-07 17:48:46,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:46,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 17:48:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:46,659 INFO L225 Difference]: With dead ends: 70151 [2019-12-07 17:48:46,659 INFO L226 Difference]: Without dead ends: 70151 [2019-12-07 17:48:46,659 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 17:48:46,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70151 states. [2019-12-07 17:48:47,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70151 to 63570. [2019-12-07 17:48:47,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63570 states. [2019-12-07 17:48:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63570 states to 63570 states and 200645 transitions. [2019-12-07 17:48:47,814 INFO L78 Accepts]: Start accepts. Automaton has 63570 states and 200645 transitions. Word has length 29 [2019-12-07 17:48:47,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:47,814 INFO L462 AbstractCegarLoop]: Abstraction has 63570 states and 200645 transitions. [2019-12-07 17:48:47,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 63570 states and 200645 transitions. [2019-12-07 17:48:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 17:48:47,833 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:47,833 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:47,833 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:47,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:47,833 INFO L82 PathProgramCache]: Analyzing trace with hash -197713206, now seen corresponding path program 1 times [2019-12-07 17:48:47,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:47,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213483632] [2019-12-07 17:48:47,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:47,862 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 17:48:47,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213483632] [2019-12-07 17:48:47,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:47,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:47,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630889236] [2019-12-07 17:48:47,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:47,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:47,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:47,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:47,863 INFO L87 Difference]: Start difference. First operand 63570 states and 200645 transitions. Second operand 4 states. [2019-12-07 17:48:47,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:47,944 INFO L93 Difference]: Finished difference Result 25892 states and 78384 transitions. [2019-12-07 17:48:47,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:47,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-12-07 17:48:47,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:47,977 INFO L225 Difference]: With dead ends: 25892 [2019-12-07 17:48:47,977 INFO L226 Difference]: Without dead ends: 25892 [2019-12-07 17:48:47,978 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 17:48:48,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25892 states. [2019-12-07 17:48:48,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25892 to 24387. [2019-12-07 17:48:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24387 states. [2019-12-07 17:48:48,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24387 states to 24387 states and 73853 transitions. [2019-12-07 17:48:48,317 INFO L78 Accepts]: Start accepts. Automaton has 24387 states and 73853 transitions. Word has length 29 [2019-12-07 17:48:48,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:48,317 INFO L462 AbstractCegarLoop]: Abstraction has 24387 states and 73853 transitions. [2019-12-07 17:48:48,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:48,317 INFO L276 IsEmpty]: Start isEmpty. Operand 24387 states and 73853 transitions. [2019-12-07 17:48:48,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 17:48:48,333 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:48,333 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] [2019-12-07 17:48:48,333 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:48,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2065332723, now seen corresponding path program 1 times [2019-12-07 17:48:48,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:48,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056204296] [2019-12-07 17:48:48,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:48,385 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 17:48:48,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056204296] [2019-12-07 17:48:48,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:48,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-07 17:48:48,386 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603401023] [2019-12-07 17:48:48,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 17:48:48,386 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:48,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 17:48:48,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-07 17:48:48,386 INFO L87 Difference]: Start difference. First operand 24387 states and 73853 transitions. Second operand 7 states. [2019-12-07 17:48:49,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:49,057 INFO L93 Difference]: Finished difference Result 32886 states and 97245 transitions. [2019-12-07 17:48:49,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-07 17:48:49,057 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-07 17:48:49,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:49,093 INFO L225 Difference]: With dead ends: 32886 [2019-12-07 17:48:49,093 INFO L226 Difference]: Without dead ends: 32886 [2019-12-07 17:48:49,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 17:48:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32886 states. [2019-12-07 17:48:49,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32886 to 23838. [2019-12-07 17:48:49,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23838 states. [2019-12-07 17:48:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23838 states to 23838 states and 72256 transitions. [2019-12-07 17:48:49,491 INFO L78 Accepts]: Start accepts. Automaton has 23838 states and 72256 transitions. Word has length 33 [2019-12-07 17:48:49,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:49,491 INFO L462 AbstractCegarLoop]: Abstraction has 23838 states and 72256 transitions. [2019-12-07 17:48:49,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 17:48:49,491 INFO L276 IsEmpty]: Start isEmpty. Operand 23838 states and 72256 transitions. [2019-12-07 17:48:49,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 17:48:49,511 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:49,511 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:49,511 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:49,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:49,512 INFO L82 PathProgramCache]: Analyzing trace with hash -1854368583, now seen corresponding path program 1 times [2019-12-07 17:48:49,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:49,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278524425] [2019-12-07 17:48:49,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:49,540 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 17:48:49,540 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278524425] [2019-12-07 17:48:49,541 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:49,541 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:49,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812514062] [2019-12-07 17:48:49,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:49,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:49,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:49,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:49,541 INFO L87 Difference]: Start difference. First operand 23838 states and 72256 transitions. Second operand 3 states. [2019-12-07 17:48:49,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:49,602 INFO L93 Difference]: Finished difference Result 22678 states and 67797 transitions. [2019-12-07 17:48:49,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:49,602 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-07 17:48:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:49,628 INFO L225 Difference]: With dead ends: 22678 [2019-12-07 17:48:49,628 INFO L226 Difference]: Without dead ends: 22678 [2019-12-07 17:48:49,629 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 17:48:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22678 states. [2019-12-07 17:48:49,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22678 to 22162. [2019-12-07 17:48:49,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22162 states. [2019-12-07 17:48:49,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22162 states to 22162 states and 66335 transitions. [2019-12-07 17:48:49,937 INFO L78 Accepts]: Start accepts. Automaton has 22162 states and 66335 transitions. Word has length 40 [2019-12-07 17:48:49,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:49,937 INFO L462 AbstractCegarLoop]: Abstraction has 22162 states and 66335 transitions. [2019-12-07 17:48:49,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:49,937 INFO L276 IsEmpty]: Start isEmpty. Operand 22162 states and 66335 transitions. [2019-12-07 17:48:49,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-07 17:48:49,954 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:49,954 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 17:48:49,954 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:49,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:49,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1843753540, now seen corresponding path program 1 times [2019-12-07 17:48:49,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:49,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813776108] [2019-12-07 17:48:49,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:49,994 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 17:48:49,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813776108] [2019-12-07 17:48:49,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:49,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:48:49,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554379824] [2019-12-07 17:48:49,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:49,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:49,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:49,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:49,996 INFO L87 Difference]: Start difference. First operand 22162 states and 66335 transitions. Second operand 5 states. [2019-12-07 17:48:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:50,065 INFO L93 Difference]: Finished difference Result 20581 states and 62860 transitions. [2019-12-07 17:48:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:50,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2019-12-07 17:48:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:50,086 INFO L225 Difference]: With dead ends: 20581 [2019-12-07 17:48:50,086 INFO L226 Difference]: Without dead ends: 20581 [2019-12-07 17:48:50,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:50,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20581 states. [2019-12-07 17:48:50,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20581 to 18875. [2019-12-07 17:48:50,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18875 states. [2019-12-07 17:48:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18875 states to 18875 states and 57789 transitions. [2019-12-07 17:48:50,363 INFO L78 Accepts]: Start accepts. Automaton has 18875 states and 57789 transitions. Word has length 41 [2019-12-07 17:48:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:50,363 INFO L462 AbstractCegarLoop]: Abstraction has 18875 states and 57789 transitions. [2019-12-07 17:48:50,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:50,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18875 states and 57789 transitions. [2019-12-07 17:48:50,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:48:50,378 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:50,378 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:50,379 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:50,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:50,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1628177899, now seen corresponding path program 1 times [2019-12-07 17:48:50,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:50,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324607890] [2019-12-07 17:48:50,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:50,487 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 17:48:50,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324607890] [2019-12-07 17:48:50,488 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:50,488 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:50,488 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087356524] [2019-12-07 17:48:50,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:50,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:50,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:50,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:50,489 INFO L87 Difference]: Start difference. First operand 18875 states and 57789 transitions. Second operand 3 states. [2019-12-07 17:48:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:50,562 INFO L93 Difference]: Finished difference Result 23234 states and 69884 transitions. [2019-12-07 17:48:50,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:50,562 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 17:48:50,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:50,585 INFO L225 Difference]: With dead ends: 23234 [2019-12-07 17:48:50,585 INFO L226 Difference]: Without dead ends: 23234 [2019-12-07 17:48:50,585 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 17:48:50,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23234 states. [2019-12-07 17:48:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23234 to 18262. [2019-12-07 17:48:50,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18262 states. [2019-12-07 17:48:50,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18262 states to 18262 states and 55066 transitions. [2019-12-07 17:48:50,880 INFO L78 Accepts]: Start accepts. Automaton has 18262 states and 55066 transitions. Word has length 66 [2019-12-07 17:48:50,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:50,880 INFO L462 AbstractCegarLoop]: Abstraction has 18262 states and 55066 transitions. [2019-12-07 17:48:50,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:50,880 INFO L276 IsEmpty]: Start isEmpty. Operand 18262 states and 55066 transitions. [2019-12-07 17:48:50,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-07 17:48:50,895 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:50,895 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:50,895 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:50,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:50,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1017702190, now seen corresponding path program 1 times [2019-12-07 17:48:50,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:50,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474391558] [2019-12-07 17:48:50,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:50,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:50,944 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 17:48:50,944 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474391558] [2019-12-07 17:48:50,944 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:50,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 17:48:50,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989563396] [2019-12-07 17:48:50,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 17:48:50,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:50,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 17:48:50,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:50,946 INFO L87 Difference]: Start difference. First operand 18262 states and 55066 transitions. Second operand 3 states. [2019-12-07 17:48:51,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:51,025 INFO L93 Difference]: Finished difference Result 21389 states and 64650 transitions. [2019-12-07 17:48:51,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 17:48:51,026 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-07 17:48:51,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:51,047 INFO L225 Difference]: With dead ends: 21389 [2019-12-07 17:48:51,047 INFO L226 Difference]: Without dead ends: 21389 [2019-12-07 17:48:51,047 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 17:48:51,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21389 states. [2019-12-07 17:48:51,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21389 to 16890. [2019-12-07 17:48:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16890 states. [2019-12-07 17:48:51,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16890 states to 16890 states and 51344 transitions. [2019-12-07 17:48:51,314 INFO L78 Accepts]: Start accepts. Automaton has 16890 states and 51344 transitions. Word has length 66 [2019-12-07 17:48:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:51,314 INFO L462 AbstractCegarLoop]: Abstraction has 16890 states and 51344 transitions. [2019-12-07 17:48:51,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 17:48:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 16890 states and 51344 transitions. [2019-12-07 17:48:51,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:48:51,328 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:51,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 17:48:51,328 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:51,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1992119349, now seen corresponding path program 1 times [2019-12-07 17:48:51,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:51,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696248633] [2019-12-07 17:48:51,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:51,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:51,378 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 17:48:51,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696248633] [2019-12-07 17:48:51,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:51,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:51,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514944102] [2019-12-07 17:48:51,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:51,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:51,380 INFO L87 Difference]: Start difference. First operand 16890 states and 51344 transitions. Second operand 4 states. [2019-12-07 17:48:51,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:51,457 INFO L93 Difference]: Finished difference Result 16705 states and 50579 transitions. [2019-12-07 17:48:51,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:48:51,458 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 17:48:51,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:51,475 INFO L225 Difference]: With dead ends: 16705 [2019-12-07 17:48:51,475 INFO L226 Difference]: Without dead ends: 16705 [2019-12-07 17:48:51,475 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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 17:48:51,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2019-12-07 17:48:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 14642. [2019-12-07 17:48:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14642 states. [2019-12-07 17:48:51,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14642 states to 14642 states and 44238 transitions. [2019-12-07 17:48:51,701 INFO L78 Accepts]: Start accepts. Automaton has 14642 states and 44238 transitions. Word has length 67 [2019-12-07 17:48:51,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:51,701 INFO L462 AbstractCegarLoop]: Abstraction has 14642 states and 44238 transitions. [2019-12-07 17:48:51,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:51,701 INFO L276 IsEmpty]: Start isEmpty. Operand 14642 states and 44238 transitions. [2019-12-07 17:48:51,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:48:51,713 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:51,714 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:51,714 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:51,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:51,714 INFO L82 PathProgramCache]: Analyzing trace with hash 1668578459, now seen corresponding path program 1 times [2019-12-07 17:48:51,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:51,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631438753] [2019-12-07 17:48:51,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:51,808 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 17:48:51,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631438753] [2019-12-07 17:48:51,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:51,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:48:51,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956158396] [2019-12-07 17:48:51,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:48:51,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:51,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:48:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:48:51,809 INFO L87 Difference]: Start difference. First operand 14642 states and 44238 transitions. Second operand 4 states. [2019-12-07 17:48:51,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:51,895 INFO L93 Difference]: Finished difference Result 26314 states and 79589 transitions. [2019-12-07 17:48:51,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:51,895 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 17:48:51,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:51,919 INFO L225 Difference]: With dead ends: 26314 [2019-12-07 17:48:51,920 INFO L226 Difference]: Without dead ends: 23519 [2019-12-07 17:48:51,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:52,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23519 states. [2019-12-07 17:48:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23519 to 14089. [2019-12-07 17:48:52,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14089 states. [2019-12-07 17:48:52,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14089 states to 14089 states and 42503 transitions. [2019-12-07 17:48:52,182 INFO L78 Accepts]: Start accepts. Automaton has 14089 states and 42503 transitions. Word has length 67 [2019-12-07 17:48:52,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:52,182 INFO L462 AbstractCegarLoop]: Abstraction has 14089 states and 42503 transitions. [2019-12-07 17:48:52,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:48:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 14089 states and 42503 transitions. [2019-12-07 17:48:52,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:48:52,194 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:52,194 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:52,194 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:52,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:52,194 INFO L82 PathProgramCache]: Analyzing trace with hash -1376638825, now seen corresponding path program 2 times [2019-12-07 17:48:52,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:52,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302918401] [2019-12-07 17:48:52,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:52,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:52,276 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 17:48:52,276 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302918401] [2019-12-07 17:48:52,276 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:52,276 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 17:48:52,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093455808] [2019-12-07 17:48:52,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 17:48:52,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:52,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 17:48:52,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-07 17:48:52,277 INFO L87 Difference]: Start difference. First operand 14089 states and 42503 transitions. Second operand 5 states. [2019-12-07 17:48:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:48:52,368 INFO L93 Difference]: Finished difference Result 24021 states and 72709 transitions. [2019-12-07 17:48:52,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 17:48:52,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-07 17:48:52,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:48:52,380 INFO L225 Difference]: With dead ends: 24021 [2019-12-07 17:48:52,380 INFO L226 Difference]: Without dead ends: 10920 [2019-12-07 17:48:52,380 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-07 17:48:52,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10920 states. [2019-12-07 17:48:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10920 to 10920. [2019-12-07 17:48:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10920 states. [2019-12-07 17:48:52,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10920 states to 10920 states and 33116 transitions. [2019-12-07 17:48:52,539 INFO L78 Accepts]: Start accepts. Automaton has 10920 states and 33116 transitions. Word has length 67 [2019-12-07 17:48:52,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:48:52,539 INFO L462 AbstractCegarLoop]: Abstraction has 10920 states and 33116 transitions. [2019-12-07 17:48:52,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 17:48:52,539 INFO L276 IsEmpty]: Start isEmpty. Operand 10920 states and 33116 transitions. [2019-12-07 17:48:52,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:48:52,549 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:48:52,549 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:48:52,549 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:48:52,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:48:52,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1541701607, now seen corresponding path program 3 times [2019-12-07 17:48:52,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:48:52,550 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279064430] [2019-12-07 17:48:52,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:48:52,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:48:53,212 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 17:48:53,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279064430] [2019-12-07 17:48:53,213 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:48:53,213 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-12-07 17:48:53,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985524841] [2019-12-07 17:48:53,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-12-07 17:48:53,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:48:53,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-12-07 17:48:53,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=257, Unknown=0, NotChecked=0, Total=306 [2019-12-07 17:48:53,214 INFO L87 Difference]: Start difference. First operand 10920 states and 33116 transitions. Second operand 18 states. [2019-12-07 17:48:55,482 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-07 17:48:55,700 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 44 [2019-12-07 17:48:58,046 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 44 [2019-12-07 17:48:58,978 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 17:48:59,761 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-07 17:49:00,364 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-12-07 17:49:00,860 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 45 [2019-12-07 17:49:01,535 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-12-07 17:49:01,856 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-12-07 17:49:03,045 WARN L192 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 47 [2019-12-07 17:49:05,069 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 46 [2019-12-07 17:49:07,272 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 41 [2019-12-07 17:49:12,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:12,001 INFO L93 Difference]: Finished difference Result 39986 states and 122967 transitions. [2019-12-07 17:49:12,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-07 17:49:12,002 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 67 [2019-12-07 17:49:12,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:12,046 INFO L225 Difference]: With dead ends: 39986 [2019-12-07 17:49:12,046 INFO L226 Difference]: Without dead ends: 36303 [2019-12-07 17:49:12,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2725 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=1448, Invalid=7294, Unknown=0, NotChecked=0, Total=8742 [2019-12-07 17:49:12,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36303 states. [2019-12-07 17:49:12,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36303 to 11191. [2019-12-07 17:49:12,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11191 states. [2019-12-07 17:49:12,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11191 states to 11191 states and 33855 transitions. [2019-12-07 17:49:12,385 INFO L78 Accepts]: Start accepts. Automaton has 11191 states and 33855 transitions. Word has length 67 [2019-12-07 17:49:12,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:12,385 INFO L462 AbstractCegarLoop]: Abstraction has 11191 states and 33855 transitions. [2019-12-07 17:49:12,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-12-07 17:49:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 11191 states and 33855 transitions. [2019-12-07 17:49:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:49:12,396 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:12,396 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:12,396 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash -113179287, now seen corresponding path program 4 times [2019-12-07 17:49:12,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:12,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878386310] [2019-12-07 17:49:12,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:12,454 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 17:49:12,454 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878386310] [2019-12-07 17:49:12,454 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:12,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 17:49:12,455 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599203065] [2019-12-07 17:49:12,455 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 17:49:12,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:12,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 17:49:12,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 17:49:12,456 INFO L87 Difference]: Start difference. First operand 11191 states and 33855 transitions. Second operand 4 states. [2019-12-07 17:49:12,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:12,511 INFO L93 Difference]: Finished difference Result 19515 states and 59384 transitions. [2019-12-07 17:49:12,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 17:49:12,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-07 17:49:12,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:12,520 INFO L225 Difference]: With dead ends: 19515 [2019-12-07 17:49:12,520 INFO L226 Difference]: Without dead ends: 9178 [2019-12-07 17:49:12,521 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 17:49:12,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9178 states. [2019-12-07 17:49:12,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9178 to 9178. [2019-12-07 17:49:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9178 states. [2019-12-07 17:49:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9178 states to 9178 states and 27909 transitions. [2019-12-07 17:49:12,659 INFO L78 Accepts]: Start accepts. Automaton has 9178 states and 27909 transitions. Word has length 67 [2019-12-07 17:49:12,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:12,659 INFO L462 AbstractCegarLoop]: Abstraction has 9178 states and 27909 transitions. [2019-12-07 17:49:12,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 17:49:12,659 INFO L276 IsEmpty]: Start isEmpty. Operand 9178 states and 27909 transitions. [2019-12-07 17:49:12,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:49:12,666 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:12,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:12,667 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:12,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:12,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1000943315, now seen corresponding path program 5 times [2019-12-07 17:49:12,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:12,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125315554] [2019-12-07 17:49:12,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:12,783 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 17:49:12,783 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125315554] [2019-12-07 17:49:12,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:12,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:49:12,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127573840] [2019-12-07 17:49:12,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:49:12,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:12,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:49:12,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:49:12,784 INFO L87 Difference]: Start difference. First operand 9178 states and 27909 transitions. Second operand 10 states. [2019-12-07 17:49:13,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:13,622 INFO L93 Difference]: Finished difference Result 19007 states and 56406 transitions. [2019-12-07 17:49:13,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 17:49:13,622 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 17:49:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:13,634 INFO L225 Difference]: With dead ends: 19007 [2019-12-07 17:49:13,634 INFO L226 Difference]: Without dead ends: 12625 [2019-12-07 17:49:13,635 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2019-12-07 17:49:13,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12625 states. [2019-12-07 17:49:13,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12625 to 10718. [2019-12-07 17:49:13,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10718 states. [2019-12-07 17:49:13,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10718 states to 10718 states and 32101 transitions. [2019-12-07 17:49:13,804 INFO L78 Accepts]: Start accepts. Automaton has 10718 states and 32101 transitions. Word has length 67 [2019-12-07 17:49:13,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:13,804 INFO L462 AbstractCegarLoop]: Abstraction has 10718 states and 32101 transitions. [2019-12-07 17:49:13,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:49:13,804 INFO L276 IsEmpty]: Start isEmpty. Operand 10718 states and 32101 transitions. [2019-12-07 17:49:13,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:49:13,813 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:13,813 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:13,813 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:13,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:13,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1387520431, now seen corresponding path program 6 times [2019-12-07 17:49:13,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:13,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800688081] [2019-12-07 17:49:13,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:13,965 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 17:49:13,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800688081] [2019-12-07 17:49:13,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:13,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:49:13,966 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752539848] [2019-12-07 17:49:13,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:49:13,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:13,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:49:13,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:49:13,967 INFO L87 Difference]: Start difference. First operand 10718 states and 32101 transitions. Second operand 10 states. [2019-12-07 17:49:14,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:14,470 INFO L93 Difference]: Finished difference Result 19140 states and 56557 transitions. [2019-12-07 17:49:14,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-07 17:49:14,470 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 17:49:14,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:14,486 INFO L225 Difference]: With dead ends: 19140 [2019-12-07 17:49:14,486 INFO L226 Difference]: Without dead ends: 16777 [2019-12-07 17:49:14,487 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2019-12-07 17:49:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16777 states. [2019-12-07 17:49:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16777 to 13778. [2019-12-07 17:49:14,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13778 states. [2019-12-07 17:49:14,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13778 states to 13778 states and 41132 transitions. [2019-12-07 17:49:14,721 INFO L78 Accepts]: Start accepts. Automaton has 13778 states and 41132 transitions. Word has length 67 [2019-12-07 17:49:14,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:14,721 INFO L462 AbstractCegarLoop]: Abstraction has 13778 states and 41132 transitions. [2019-12-07 17:49:14,721 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:49:14,721 INFO L276 IsEmpty]: Start isEmpty. Operand 13778 states and 41132 transitions. [2019-12-07 17:49:14,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:49:14,733 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:14,734 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:14,734 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:14,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:14,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1418038161, now seen corresponding path program 7 times [2019-12-07 17:49:14,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:14,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010043724] [2019-12-07 17:49:14,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:14,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:14,883 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 17:49:14,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010043724] [2019-12-07 17:49:14,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:14,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 17:49:14,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329483170] [2019-12-07 17:49:14,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 17:49:14,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:14,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 17:49:14,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 17:49:14,885 INFO L87 Difference]: Start difference. First operand 13778 states and 41132 transitions. Second operand 10 states. [2019-12-07 17:49:15,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:15,275 INFO L93 Difference]: Finished difference Result 17191 states and 50329 transitions. [2019-12-07 17:49:15,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-07 17:49:15,275 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-07 17:49:15,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:15,288 INFO L225 Difference]: With dead ends: 17191 [2019-12-07 17:49:15,288 INFO L226 Difference]: Without dead ends: 13780 [2019-12-07 17:49:15,289 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=442, Unknown=0, NotChecked=0, Total=552 [2019-12-07 17:49:15,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13780 states. [2019-12-07 17:49:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13780 to 11019. [2019-12-07 17:49:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11019 states. [2019-12-07 17:49:15,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11019 states to 11019 states and 32652 transitions. [2019-12-07 17:49:15,464 INFO L78 Accepts]: Start accepts. Automaton has 11019 states and 32652 transitions. Word has length 67 [2019-12-07 17:49:15,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:15,464 INFO L462 AbstractCegarLoop]: Abstraction has 11019 states and 32652 transitions. [2019-12-07 17:49:15,464 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 17:49:15,464 INFO L276 IsEmpty]: Start isEmpty. Operand 11019 states and 32652 transitions. [2019-12-07 17:49:15,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:49:15,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:15,473 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:15,473 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:15,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:15,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1156359029, now seen corresponding path program 8 times [2019-12-07 17:49:15,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:15,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304946788] [2019-12-07 17:49:15,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 17:49:15,588 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 17:49:15,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304946788] [2019-12-07 17:49:15,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 17:49:15,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 17:49:15,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363346852] [2019-12-07 17:49:15,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 17:49:15,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 17:49:15,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 17:49:15,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-07 17:49:15,589 INFO L87 Difference]: Start difference. First operand 11019 states and 32652 transitions. Second operand 11 states. [2019-12-07 17:49:16,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 17:49:16,103 INFO L93 Difference]: Finished difference Result 16964 states and 49524 transitions. [2019-12-07 17:49:16,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 17:49:16,103 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2019-12-07 17:49:16,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 17:49:16,115 INFO L225 Difference]: With dead ends: 16964 [2019-12-07 17:49:16,115 INFO L226 Difference]: Without dead ends: 12700 [2019-12-07 17:49:16,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=716, Unknown=0, NotChecked=0, Total=870 [2019-12-07 17:49:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12700 states. [2019-12-07 17:49:16,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12700 to 10345. [2019-12-07 17:49:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10345 states. [2019-12-07 17:49:16,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10345 states to 10345 states and 30750 transitions. [2019-12-07 17:49:16,279 INFO L78 Accepts]: Start accepts. Automaton has 10345 states and 30750 transitions. Word has length 67 [2019-12-07 17:49:16,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 17:49:16,279 INFO L462 AbstractCegarLoop]: Abstraction has 10345 states and 30750 transitions. [2019-12-07 17:49:16,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 17:49:16,279 INFO L276 IsEmpty]: Start isEmpty. Operand 10345 states and 30750 transitions. [2019-12-07 17:49:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-07 17:49:16,287 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 17:49:16,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 17:49:16,287 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 17:49:16,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 17:49:16,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1748623595, now seen corresponding path program 9 times [2019-12-07 17:49:16,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 17:49:16,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172495896] [2019-12-07 17:49:16,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 17:49:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:49:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 17:49:16,372 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 17:49:16,372 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 17:49:16,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 17:49:16,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-07 17:49:16,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-07 17:49:16,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-221431766)) (= ~__unbuffered_p0_EAX~0_Out-221431766 ~x~0_In-221431766) (= ~b$r_buff0_thd1~0_Out-221431766 1) (= ~b$r_buff1_thd0~0_Out-221431766 ~b$r_buff0_thd0~0_In-221431766) (= ~b$r_buff1_thd3~0_Out-221431766 ~b$r_buff0_thd3~0_In-221431766) (= ~b$r_buff1_thd1~0_Out-221431766 ~b$r_buff0_thd1~0_In-221431766) (= ~b$r_buff0_thd2~0_In-221431766 ~b$r_buff1_thd2~0_Out-221431766)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-221431766, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-221431766, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-221431766, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-221431766, ~x~0=~x~0_In-221431766, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-221431766} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-221431766, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-221431766, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-221431766, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-221431766, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-221431766, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-221431766, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-221431766, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-221431766, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-221431766, ~x~0=~x~0_In-221431766, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-221431766} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 17:49:16,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In136767720 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In136767720 256) 0))) (or (and (= ~b~0_In136767720 |P1Thread1of1ForFork0_#t~ite9_Out136767720|) (or .cse0 .cse1)) (and (not .cse0) (= ~b$w_buff1~0_In136767720 |P1Thread1of1ForFork0_#t~ite9_Out136767720|) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In136767720, ~b~0=~b~0_In136767720, ~b$w_buff1~0=~b$w_buff1~0_In136767720, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In136767720} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In136767720, ~b~0=~b~0_In136767720, ~b$w_buff1~0=~b$w_buff1~0_In136767720, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out136767720|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In136767720} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 17:49:16,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_32|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_32|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_51|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_31|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 17:49:16,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In1428107490 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1428107490 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out1428107490| ~b$w_buff0_used~0_In1428107490) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out1428107490| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1428107490, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1428107490} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1428107490, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1428107490, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out1428107490|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 17:49:16,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In1319310668 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd2~0_In1319310668 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In1319310668 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd2~0_In1319310668 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite12_Out1319310668| ~b$w_buff1_used~0_In1319310668)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out1319310668| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1319310668, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1319310668, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1319310668, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1319310668} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1319310668, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1319310668, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1319310668, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1319310668|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1319310668} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 17:49:16,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In1808458810 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In1808458810 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1808458810|) (not .cse1)) (and (= ~b$r_buff0_thd2~0_In1808458810 |P1Thread1of1ForFork0_#t~ite13_Out1808458810|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1808458810, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1808458810} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1808458810, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1808458810, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1808458810|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 17:49:16,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-1083272070 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1083272070 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In-1083272070 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1083272070 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff1_thd2~0_In-1083272070 |P1Thread1of1ForFork0_#t~ite14_Out-1083272070|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-1083272070|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1083272070, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1083272070, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1083272070, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1083272070} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1083272070, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1083272070, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1083272070, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1083272070|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1083272070} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 17:49:16,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_30|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_29|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:49:16,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2126147209 256) 0))) (or (and .cse0 (= ~b$w_buff0~0_In2126147209 |P2Thread1of1ForFork1_#t~ite20_Out2126147209|) (= |P2Thread1of1ForFork1_#t~ite21_Out2126147209| |P2Thread1of1ForFork1_#t~ite20_Out2126147209|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In2126147209 256)))) (or (and .cse1 (= (mod ~b$r_buff1_thd3~0_In2126147209 256) 0)) (and .cse1 (= 0 (mod ~b$w_buff1_used~0_In2126147209 256))) (= (mod ~b$w_buff0_used~0_In2126147209 256) 0)))) (and (= |P2Thread1of1ForFork1_#t~ite20_In2126147209| |P2Thread1of1ForFork1_#t~ite20_Out2126147209|) (= |P2Thread1of1ForFork1_#t~ite21_Out2126147209| ~b$w_buff0~0_In2126147209) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2126147209, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2126147209, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In2126147209|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2126147209, ~b$w_buff0~0=~b$w_buff0~0_In2126147209, ~weak$$choice2~0=~weak$$choice2~0_In2126147209, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2126147209} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2126147209, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2126147209, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out2126147209|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out2126147209|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2126147209, ~b$w_buff0~0=~b$w_buff0~0_In2126147209, ~weak$$choice2~0=~weak$$choice2~0_In2126147209, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2126147209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:49:16,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2114014848 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-2114014848 256)))) (or (and .cse0 (= (mod ~b$r_buff1_thd3~0_In-2114014848 256) 0)) (and (= (mod ~b$w_buff1_used~0_In-2114014848 256) 0) .cse0) (= 0 (mod ~b$w_buff0_used~0_In-2114014848 256)))) .cse1 (= |P2Thread1of1ForFork1_#t~ite27_Out-2114014848| |P2Thread1of1ForFork1_#t~ite26_Out-2114014848|) (= |P2Thread1of1ForFork1_#t~ite26_Out-2114014848| ~b$w_buff0_used~0_In-2114014848)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-2114014848| ~b$w_buff0_used~0_In-2114014848) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite26_In-2114014848| |P2Thread1of1ForFork1_#t~ite26_Out-2114014848|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2114014848, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2114014848, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-2114014848|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2114014848, ~weak$$choice2~0=~weak$$choice2~0_In-2114014848, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2114014848} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2114014848, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-2114014848|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2114014848, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-2114014848|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2114014848, ~weak$$choice2~0=~weak$$choice2~0_In-2114014848, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2114014848} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 17:49:16,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:49:16,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 17:49:16,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-671787214 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-671787214 256)))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-671787214 |P2Thread1of1ForFork1_#t~ite38_Out-671787214|)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out-671787214| ~b~0_In-671787214) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-671787214, ~b~0=~b~0_In-671787214, ~b$w_buff1~0=~b$w_buff1~0_In-671787214, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-671787214} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-671787214|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-671787214, ~b~0=~b~0_In-671787214, ~b$w_buff1~0=~b$w_buff1~0_In-671787214, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-671787214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 17:49:16,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_10|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_10|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_9|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 17:49:16,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In201306404 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In201306404 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out201306404|)) (and (= |P2Thread1of1ForFork1_#t~ite40_Out201306404| ~b$w_buff0_used~0_In201306404) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In201306404, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In201306404} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In201306404, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In201306404, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out201306404|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 17:49:16,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd3~0_In-1345775623 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In-1345775623 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd3~0_In-1345775623 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-1345775623 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1345775623| ~b$w_buff1_used~0_In-1345775623) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1345775623| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1345775623, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1345775623, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1345775623, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1345775623} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1345775623, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1345775623, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1345775623, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1345775623|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1345775623} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 17:49:16,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1421356120 256))) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1421356120 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd3~0_In-1421356120 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1421356120, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1421356120} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1421356120, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1421356120, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1421356120|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 17:49:16,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff0_used~0_In1266141171 256))) (.cse2 (= (mod ~b$r_buff0_thd3~0_In1266141171 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1266141171 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1266141171 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out1266141171|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite43_Out1266141171| ~b$r_buff1_thd3~0_In1266141171) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1266141171, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1266141171, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1266141171, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1266141171} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1266141171, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1266141171, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1266141171|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1266141171, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1266141171} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 17:49:16,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= |v_P2Thread1of1ForFork1_#t~ite43_42| v_~b$r_buff1_thd3~0_140) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:49:16,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In2088449369 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In2088449369 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out2088449369|)) (and (= ~b$w_buff0_used~0_In2088449369 |P0Thread1of1ForFork2_#t~ite5_Out2088449369|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2088449369, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2088449369} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2088449369, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2088449369, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out2088449369|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 17:49:16,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In347573926 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd1~0_In347573926 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In347573926 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In347573926 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out347573926|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~b$w_buff1_used~0_In347573926 |P0Thread1of1ForFork2_#t~ite6_Out347573926|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In347573926, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In347573926, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In347573926, ~b$w_buff1_used~0=~b$w_buff1_used~0_In347573926} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In347573926, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In347573926, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In347573926, ~b$w_buff1_used~0=~b$w_buff1_used~0_In347573926, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out347573926|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 17:49:16,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1851040903 256))) (.cse2 (= ~b$r_buff0_thd1~0_In1851040903 ~b$r_buff0_thd1~0_Out1851040903)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1851040903 256)))) (or (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out1851040903) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1851040903, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1851040903} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1851040903, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1851040903, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1851040903|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 17:49:16,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd1~0_In-1463141438 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1463141438 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-1463141438 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In-1463141438 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out-1463141438| ~b$r_buff1_thd1~0_In-1463141438)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1463141438| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1463141438, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1463141438, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1463141438, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1463141438} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1463141438, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1463141438, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1463141438, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1463141438, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1463141438|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 17:49:16,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_34| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_33|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 17:49:16,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:49:16,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd0~0_In1658609246 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1658609246 256)))) (or (and (= ~b$w_buff1~0_In1658609246 |ULTIMATE.start_main_#t~ite47_Out1658609246|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b~0_In1658609246 |ULTIMATE.start_main_#t~ite47_Out1658609246|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1658609246, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1658609246, ~b~0=~b~0_In1658609246, ~b$w_buff1~0=~b$w_buff1~0_In1658609246} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1658609246, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1658609246, ~b~0=~b~0_In1658609246, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1658609246|, ~b$w_buff1~0=~b$w_buff1~0_In1658609246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 17:49:16,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 17:49:16,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1445510027 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1445510027 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1445510027| ~b$w_buff0_used~0_In1445510027)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1445510027| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1445510027, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1445510027} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1445510027, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1445510027|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1445510027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 17:49:16,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd0~0_In-909317594 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-909317594 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-909317594 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-909317594 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-909317594| 0)) (and (or .cse2 .cse3) (= ~b$w_buff1_used~0_In-909317594 |ULTIMATE.start_main_#t~ite50_Out-909317594|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-909317594, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-909317594, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-909317594, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-909317594} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-909317594|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-909317594, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-909317594, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-909317594, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-909317594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 17:49:16,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In2114761290 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In2114761290 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out2114761290| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out2114761290| ~b$r_buff0_thd0~0_In2114761290) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2114761290, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2114761290} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2114761290, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2114761290|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2114761290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 17:49:16,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In2020321206 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In2020321206 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In2020321206 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In2020321206 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff1_thd0~0_In2020321206 |ULTIMATE.start_main_#t~ite52_Out2020321206|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out2020321206| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2020321206, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2020321206, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2020321206, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2020321206} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2020321206, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2020321206|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2020321206, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2020321206, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2020321206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 17:49:16,389 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:49:16,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 05:49:16 BasicIcfg [2019-12-07 17:49:16,444 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 17:49:16,444 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 17:49:16,444 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 17:49:16,444 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 17:49:16,444 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 05:47:19" (3/4) ... [2019-12-07 17:49:16,446 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 17:49:16,446 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [905] [905] ULTIMATE.startENTRY-->L842: Formula: (let ((.cse0 (store |v_#valid_67| 0 0))) (and (= v_~b$r_buff1_thd0~0_230 0) (= v_~b$w_buff1~0_176 0) (= v_~b$mem_tmp~0_20 0) (= v_~weak$$choice2~0_144 0) (= 0 v_~b$r_buff1_thd3~0_337) (= 0 v_~b$read_delayed~0_7) (= 0 v_~b$r_buff0_thd2~0_182) (= (select .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25|) 0) (= 0 v_~__unbuffered_p0_EAX~0_176) (= v_~__unbuffered_p1_EBX~0_38 0) (= |v_#length_25| (store |v_#length_26| |v_ULTIMATE.start_main_~#t849~0.base_25| 4)) (= v_~main$tmp_guard1~0_34 0) (= v_~y~0_19 0) (= 0 v_~__unbuffered_p1_EAX~0_38) (= v_~b$r_buff0_thd0~0_204 0) (< 0 |v_#StackHeapBarrier_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t849~0.base_25|) (= 0 v_~b$r_buff1_thd1~0_215) (= v_~a~0_14 0) (= 0 v_~x~0_124) (= 0 v_~b$r_buff0_thd3~0_395) (= v_~__unbuffered_p2_EBX~0_38 0) (= v_~b$read_delayed_var~0.offset_7 0) (= v_~z~0_23 0) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p2_EAX~0_34) (= 0 v_~b$w_buff0_used~0_787) (= 0 |v_ULTIMATE.start_main_~#t849~0.offset_17|) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t849~0.base_25|) |v_ULTIMATE.start_main_~#t849~0.offset_17| 0)) |v_#memory_int_23|) (= 0 v_~b$w_buff0~0_250) (= v_~__unbuffered_cnt~0_137 0) (= 0 v_~b$w_buff1_used~0_450) (= 0 v_~b$r_buff1_thd2~0_222) (= 0 v_~weak$$choice0~0_13) (= v_~b~0_186 0) (= v_~main$tmp_guard0~0_24 0) (= v_~b$flush_delayed~0_35 0) (= 0 v_~b$read_delayed_var~0.base_7) (= 0 v_~b$r_buff0_thd1~0_323) (= (store .cse0 |v_ULTIMATE.start_main_~#t849~0.base_25| 1) |v_#valid_65|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_67|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_395, ~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_215, ~b$read_delayed_var~0.offset=v_~b$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_245|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_51|, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_787, ~a~0=v_~a~0_14, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_68|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_176, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_38, ULTIMATE.start_main_~#t849~0.base=|v_ULTIMATE.start_main_~#t849~0.base_25|, #length=|v_#length_25|, ~b$w_buff0~0=v_~b$w_buff0~0_250, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_34, ~b$r_buff0_thd0~0=v_~b$r_buff0_thd0~0_204, ~b$r_buff0_thd2~0=v_~b$r_buff0_thd2~0_182, ~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_38, ~b$flush_delayed~0=v_~b$flush_delayed~0_35, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_10|, ~b$read_delayed~0=v_~b$read_delayed~0_7, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~b$w_buff1~0=v_~b$w_buff1~0_176, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_137, ~x~0=v_~x~0_124, ~b$r_buff0_thd1~0=v_~b$r_buff0_thd1~0_323, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_45|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_21|, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_450, ULTIMATE.start_main_~#t849~0.offset=|v_ULTIMATE.start_main_~#t849~0.offset_17|, ~y~0=v_~y~0_19, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_222, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_17|, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_230, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_38, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_23|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, #NULL.base=|v_#NULL.base_4|, ~b$read_delayed_var~0.base=v_~b$read_delayed_var~0.base_7, ~b~0=v_~b~0_186, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_28|, #valid=|v_#valid_65|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_21|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_144, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_337} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, ~b$r_buff1_thd1~0, ~b$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ~b$w_buff0_used~0, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t849~0.base, #length, ~b$w_buff0~0, ~__unbuffered_p2_EAX~0, ~b$r_buff0_thd0~0, ~b$r_buff0_thd2~0, ~b$mem_tmp~0, ~__unbuffered_p2_EBX~0, ~b$flush_delayed~0, ULTIMATE.start_main_#t~nondet45, ~b$read_delayed~0, ULTIMATE.start_main_~#t850~0.offset, ~weak$$choice0~0, ~b$w_buff1~0, ~__unbuffered_cnt~0, ~x~0, ~b$r_buff0_thd1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t850~0.base, ~b$w_buff1_used~0, ULTIMATE.start_main_~#t849~0.offset, ~y~0, ~b$r_buff1_thd2~0, ULTIMATE.start_main_~#t851~0.offset, ~b$r_buff1_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~main$tmp_guard0~0, #NULL.base, ~b$read_delayed_var~0.base, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_~#t851~0.base, ~z~0, ~weak$$choice2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 17:49:16,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L842-1-->L844: Formula: (and (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t850~0.base_10| 4) |v_#length_13|) (not (= 0 |v_ULTIMATE.start_main_~#t850~0.base_10|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10| 1)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t850~0.base_10|) |v_ULTIMATE.start_main_~#t850~0.offset_9| 1)) |v_#memory_int_11|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t850~0.base_10|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t850~0.base_10|) (= |v_ULTIMATE.start_main_~#t850~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t850~0.base=|v_ULTIMATE.start_main_~#t850~0.base_10|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, #length=|v_#length_13|, ULTIMATE.start_main_~#t850~0.offset=|v_ULTIMATE.start_main_~#t850~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t850~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t850~0.offset] because there is no mapped edge [2019-12-07 17:49:16,447 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L844-1-->L846: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t851~0.base_13|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t851~0.base_13|) |v_ULTIMATE.start_main_~#t851~0.offset_11| 2)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t851~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13|)) (not (= |v_ULTIMATE.start_main_~#t851~0.base_13| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t851~0.base_13| 4)) (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t851~0.base_13| 1) |v_#valid_36|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_6|, #memory_int=|v_#memory_int_15|, #length=|v_#length_17|, ULTIMATE.start_main_~#t851~0.base=|v_ULTIMATE.start_main_~#t851~0.base_13|, ULTIMATE.start_main_~#t851~0.offset=|v_ULTIMATE.start_main_~#t851~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t851~0.base, ULTIMATE.start_main_~#t851~0.offset] because there is no mapped edge [2019-12-07 17:49:16,448 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L4-->L754: Formula: (and (not (= 0 P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-221431766)) (= ~__unbuffered_p0_EAX~0_Out-221431766 ~x~0_In-221431766) (= ~b$r_buff0_thd1~0_Out-221431766 1) (= ~b$r_buff1_thd0~0_Out-221431766 ~b$r_buff0_thd0~0_In-221431766) (= ~b$r_buff1_thd3~0_Out-221431766 ~b$r_buff0_thd3~0_In-221431766) (= ~b$r_buff1_thd1~0_Out-221431766 ~b$r_buff0_thd1~0_In-221431766) (= ~b$r_buff0_thd2~0_In-221431766 ~b$r_buff1_thd2~0_Out-221431766)) InVars {~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-221431766, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-221431766, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-221431766, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-221431766, ~x~0=~x~0_In-221431766, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-221431766} OutVars{~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out-221431766, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-221431766, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out-221431766, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-221431766, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_Out-221431766, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_Out-221431766, P0Thread1of1ForFork2___VERIFIER_assert_~expression=P0Thread1of1ForFork2___VERIFIER_assert_~expression_In-221431766, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_Out-221431766, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_Out-221431766, ~x~0=~x~0_In-221431766, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-221431766} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, ~__unbuffered_p0_EAX~0, ~b$r_buff1_thd1~0, ~b$r_buff1_thd0~0, ~b$r_buff1_thd2~0, ~b$r_buff1_thd3~0] because there is no mapped edge [2019-12-07 17:49:16,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L780-2-->L780-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In136767720 256))) (.cse1 (= (mod ~b$r_buff1_thd2~0_In136767720 256) 0))) (or (and (= ~b~0_In136767720 |P1Thread1of1ForFork0_#t~ite9_Out136767720|) (or .cse0 .cse1)) (and (not .cse0) (= ~b$w_buff1~0_In136767720 |P1Thread1of1ForFork0_#t~ite9_Out136767720|) (not .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In136767720, ~b~0=~b~0_In136767720, ~b$w_buff1~0=~b$w_buff1~0_In136767720, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In136767720} OutVars{~b$w_buff1_used~0=~b$w_buff1_used~0_In136767720, ~b~0=~b~0_In136767720, ~b$w_buff1~0=~b$w_buff1~0_In136767720, P1Thread1of1ForFork0_#t~ite9=|P1Thread1of1ForFork0_#t~ite9_Out136767720|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In136767720} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 17:49:16,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L780-4-->L781: Formula: (= v_~b~0_66 |v_P1Thread1of1ForFork0_#t~ite9_32|) InVars {P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_32|} OutVars{~b~0=v_~b~0_66, P1Thread1of1ForFork0_#t~ite10=|v_P1Thread1of1ForFork0_#t~ite10_51|, P1Thread1of1ForFork0_#t~ite9=|v_P1Thread1of1ForFork0_#t~ite9_31|} AuxVars[] AssignedVars[~b~0, P1Thread1of1ForFork0_#t~ite10, P1Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-07 17:49:16,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L781-->L781-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In1428107490 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In1428107490 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite11_Out1428107490| ~b$w_buff0_used~0_In1428107490) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork0_#t~ite11_Out1428107490| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1428107490, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1428107490} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1428107490, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1428107490, P1Thread1of1ForFork0_#t~ite11=|P1Thread1of1ForFork0_#t~ite11_Out1428107490|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-07 17:49:16,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L782-->L782-2: Formula: (let ((.cse2 (= (mod ~b$w_buff0_used~0_In1319310668 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd2~0_In1319310668 256) 0)) (.cse0 (= (mod ~b$w_buff1_used~0_In1319310668 256) 0)) (.cse1 (= (mod ~b$r_buff1_thd2~0_In1319310668 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite12_Out1319310668| ~b$w_buff1_used~0_In1319310668)) (and (= |P1Thread1of1ForFork0_#t~ite12_Out1319310668| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1319310668, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1319310668, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1319310668, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1319310668} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1319310668, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1319310668, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1319310668, P1Thread1of1ForFork0_#t~ite12=|P1Thread1of1ForFork0_#t~ite12_Out1319310668|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In1319310668} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-07 17:49:16,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [848] [848] L783-->L783-2: Formula: (let ((.cse1 (= (mod ~b$w_buff0_used~0_In1808458810 256) 0)) (.cse0 (= (mod ~b$r_buff0_thd2~0_In1808458810 256) 0))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite13_Out1808458810|) (not .cse1)) (and (= ~b$r_buff0_thd2~0_In1808458810 |P1Thread1of1ForFork0_#t~ite13_Out1808458810|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1808458810, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1808458810} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1808458810, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In1808458810, P1Thread1of1ForFork0_#t~ite13=|P1Thread1of1ForFork0_#t~ite13_Out1808458810|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-07 17:49:16,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L784-->L784-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd2~0_In-1083272070 256) 0)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1083272070 256))) (.cse2 (= (mod ~b$r_buff1_thd2~0_In-1083272070 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-1083272070 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff1_thd2~0_In-1083272070 |P1Thread1of1ForFork0_#t~ite14_Out-1083272070|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite14_Out-1083272070|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1083272070, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1083272070, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1083272070, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1083272070} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1083272070, ~b$r_buff0_thd2~0=~b$r_buff0_thd2~0_In-1083272070, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1083272070, P1Thread1of1ForFork0_#t~ite14=|P1Thread1of1ForFork0_#t~ite14_Out-1083272070|, ~b$r_buff1_thd2~0=~b$r_buff1_thd2~0_In-1083272070} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-07 17:49:16,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] L784-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.offset_3|) (= v_~__unbuffered_cnt~0_68 (+ v_~__unbuffered_cnt~0_69 1)) (= v_~b$r_buff1_thd2~0_85 |v_P1Thread1of1ForFork0_#t~ite14_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_3|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_69, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_30|} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_68, P1Thread1of1ForFork0_#t~ite14=|v_P1Thread1of1ForFork0_#t~ite14_29|, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_3|, ~b$r_buff1_thd2~0=v_~b$r_buff1_thd2~0_85, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_3|} AuxVars[] AssignedVars[~__unbuffered_cnt~0, P1Thread1of1ForFork0_#t~ite14, P1Thread1of1ForFork0_#res.offset, ~b$r_buff1_thd2~0, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-07 17:49:16,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L808-->L808-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In2126147209 256) 0))) (or (and .cse0 (= ~b$w_buff0~0_In2126147209 |P2Thread1of1ForFork1_#t~ite20_Out2126147209|) (= |P2Thread1of1ForFork1_#t~ite21_Out2126147209| |P2Thread1of1ForFork1_#t~ite20_Out2126147209|) (let ((.cse1 (= 0 (mod ~b$r_buff0_thd3~0_In2126147209 256)))) (or (and .cse1 (= (mod ~b$r_buff1_thd3~0_In2126147209 256) 0)) (and .cse1 (= 0 (mod ~b$w_buff1_used~0_In2126147209 256))) (= (mod ~b$w_buff0_used~0_In2126147209 256) 0)))) (and (= |P2Thread1of1ForFork1_#t~ite20_In2126147209| |P2Thread1of1ForFork1_#t~ite20_Out2126147209|) (= |P2Thread1of1ForFork1_#t~ite21_Out2126147209| ~b$w_buff0~0_In2126147209) (not .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2126147209, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2126147209, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_In2126147209|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2126147209, ~b$w_buff0~0=~b$w_buff0~0_In2126147209, ~weak$$choice2~0=~weak$$choice2~0_In2126147209, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2126147209} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2126147209, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In2126147209, P2Thread1of1ForFork1_#t~ite20=|P2Thread1of1ForFork1_#t~ite20_Out2126147209|, P2Thread1of1ForFork1_#t~ite21=|P2Thread1of1ForFork1_#t~ite21_Out2126147209|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2126147209, ~b$w_buff0~0=~b$w_buff0~0_In2126147209, ~weak$$choice2~0=~weak$$choice2~0_In2126147209, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In2126147209} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite20, P2Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-07 17:49:16,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [885] [885] L810-->L810-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-2114014848 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~b$r_buff0_thd3~0_In-2114014848 256)))) (or (and .cse0 (= (mod ~b$r_buff1_thd3~0_In-2114014848 256) 0)) (and (= (mod ~b$w_buff1_used~0_In-2114014848 256) 0) .cse0) (= 0 (mod ~b$w_buff0_used~0_In-2114014848 256)))) .cse1 (= |P2Thread1of1ForFork1_#t~ite27_Out-2114014848| |P2Thread1of1ForFork1_#t~ite26_Out-2114014848|) (= |P2Thread1of1ForFork1_#t~ite26_Out-2114014848| ~b$w_buff0_used~0_In-2114014848)) (and (= |P2Thread1of1ForFork1_#t~ite27_Out-2114014848| ~b$w_buff0_used~0_In-2114014848) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite26_In-2114014848| |P2Thread1of1ForFork1_#t~ite26_Out-2114014848|)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-2114014848, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2114014848, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_In-2114014848|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2114014848, ~weak$$choice2~0=~weak$$choice2~0_In-2114014848, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2114014848} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-2114014848, P2Thread1of1ForFork1_#t~ite26=|P2Thread1of1ForFork1_#t~ite26_Out-2114014848|, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-2114014848, P2Thread1of1ForFork1_#t~ite27=|P2Thread1of1ForFork1_#t~ite27_Out-2114014848|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-2114014848, ~weak$$choice2~0=~weak$$choice2~0_In-2114014848, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-2114014848} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27] because there is no mapped edge [2019-12-07 17:49:16,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L812-->L813: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~b$r_buff0_thd3~0_79 v_~b$r_buff0_thd3~0_78)) InVars {~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~b$r_buff0_thd3~0=v_~b$r_buff0_thd3~0_78, P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite31=|v_P2Thread1of1ForFork1_#t~ite31_6|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~weak$$choice2~0=v_~weak$$choice2~0_15} AuxVars[] AssignedVars[~b$r_buff0_thd3~0, P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite31, P2Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-07 17:49:16,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L815-->L819: Formula: (and (= v_~b$flush_delayed~0_7 0) (not (= (mod v_~b$flush_delayed~0_8 256) 0)) (= v_~b~0_30 v_~b$mem_tmp~0_5)) InVars {~b$mem_tmp~0=v_~b$mem_tmp~0_5, ~b$flush_delayed~0=v_~b$flush_delayed~0_8} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_5, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_5|, ~b~0=v_~b~0_30, ~b$flush_delayed~0=v_~b$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, ~b~0, ~b$flush_delayed~0] because there is no mapped edge [2019-12-07 17:49:16,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L819-2-->L819-4: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff1_used~0_In-671787214 256))) (.cse1 (= 0 (mod ~b$r_buff1_thd3~0_In-671787214 256)))) (or (and (not .cse0) (not .cse1) (= ~b$w_buff1~0_In-671787214 |P2Thread1of1ForFork1_#t~ite38_Out-671787214|)) (and (= |P2Thread1of1ForFork1_#t~ite38_Out-671787214| ~b~0_In-671787214) (or .cse0 .cse1)))) InVars {~b$w_buff1_used~0=~b$w_buff1_used~0_In-671787214, ~b~0=~b~0_In-671787214, ~b$w_buff1~0=~b$w_buff1~0_In-671787214, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-671787214} OutVars{P2Thread1of1ForFork1_#t~ite38=|P2Thread1of1ForFork1_#t~ite38_Out-671787214|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-671787214, ~b~0=~b~0_In-671787214, ~b$w_buff1~0=~b$w_buff1~0_In-671787214, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-671787214} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38] because there is no mapped edge [2019-12-07 17:49:16,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L819-4-->L820: Formula: (= v_~b~0_46 |v_P2Thread1of1ForFork1_#t~ite38_10|) InVars {P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_10|} OutVars{P2Thread1of1ForFork1_#t~ite38=|v_P2Thread1of1ForFork1_#t~ite38_9|, ~b~0=v_~b~0_46, P2Thread1of1ForFork1_#t~ite39=|v_P2Thread1of1ForFork1_#t~ite39_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite38, ~b~0, P2Thread1of1ForFork1_#t~ite39] because there is no mapped edge [2019-12-07 17:49:16,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~b$r_buff0_thd3~0_In201306404 256) 0)) (.cse0 (= (mod ~b$w_buff0_used~0_In201306404 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite40_Out201306404|)) (and (= |P2Thread1of1ForFork1_#t~ite40_Out201306404| ~b$w_buff0_used~0_In201306404) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In201306404, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In201306404} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In201306404, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In201306404, P2Thread1of1ForFork1_#t~ite40=|P2Thread1of1ForFork1_#t~ite40_Out201306404|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-07 17:49:16,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~b$r_buff1_thd3~0_In-1345775623 256) 0)) (.cse1 (= (mod ~b$w_buff1_used~0_In-1345775623 256) 0)) (.cse3 (= (mod ~b$r_buff0_thd3~0_In-1345775623 256) 0)) (.cse2 (= 0 (mod ~b$w_buff0_used~0_In-1345775623 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1345775623| ~b$w_buff1_used~0_In-1345775623) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork1_#t~ite41_Out-1345775623| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1345775623, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1345775623, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1345775623, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1345775623} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1345775623, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1345775623, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1345775623, P2Thread1of1ForFork1_#t~ite41=|P2Thread1of1ForFork1_#t~ite41_Out-1345775623|, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In-1345775623} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite41] because there is no mapped edge [2019-12-07 17:49:16,455 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L822-->L822-2: Formula: (let ((.cse0 (= 0 (mod ~b$w_buff0_used~0_In-1421356120 256))) (.cse1 (= (mod ~b$r_buff0_thd3~0_In-1421356120 256) 0))) (or (and (or .cse0 .cse1) (= ~b$r_buff0_thd3~0_In-1421356120 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite42_Out-1421356120|) (not .cse0) (not .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1421356120, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1421356120} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1421356120, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In-1421356120, P2Thread1of1ForFork1_#t~ite42=|P2Thread1of1ForFork1_#t~ite42_Out-1421356120|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite42] because there is no mapped edge [2019-12-07 17:49:16,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L823-->L823-2: Formula: (let ((.cse3 (= 0 (mod ~b$w_buff0_used~0_In1266141171 256))) (.cse2 (= (mod ~b$r_buff0_thd3~0_In1266141171 256) 0)) (.cse0 (= 0 (mod ~b$r_buff1_thd3~0_In1266141171 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1266141171 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite43_Out1266141171|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P2Thread1of1ForFork1_#t~ite43_Out1266141171| ~b$r_buff1_thd3~0_In1266141171) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1266141171, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1266141171, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1266141171, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1266141171} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1266141171, ~b$r_buff0_thd3~0=~b$r_buff0_thd3~0_In1266141171, P2Thread1of1ForFork1_#t~ite43=|P2Thread1of1ForFork1_#t~ite43_Out1266141171|, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1266141171, ~b$r_buff1_thd3~0=~b$r_buff1_thd3~0_In1266141171} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-07 17:49:16,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L823-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_3|) (= |v_P2Thread1of1ForFork1_#t~ite43_42| v_~b$r_buff1_thd3~0_140) (= 0 |v_P2Thread1of1ForFork1_#res.base_3|) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_42|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P2Thread1of1ForFork1_#t~ite43=|v_P2Thread1of1ForFork1_#t~ite43_41|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~b$r_buff1_thd3~0=v_~b$r_buff1_thd3~0_140, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_3|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite43, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, ~b$r_buff1_thd3~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-07 17:49:16,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L755-->L755-2: Formula: (let ((.cse1 (= 0 (mod ~b$w_buff0_used~0_In2088449369 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd1~0_In2088449369 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork2_#t~ite5_Out2088449369|)) (and (= ~b$w_buff0_used~0_In2088449369 |P0Thread1of1ForFork2_#t~ite5_Out2088449369|) (or .cse1 .cse0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2088449369, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2088449369} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2088449369, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In2088449369, P0Thread1of1ForFork2_#t~ite5=|P0Thread1of1ForFork2_#t~ite5_Out2088449369|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-07 17:49:16,456 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L756-->L756-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In347573926 256) 0)) (.cse1 (= (mod ~b$r_buff0_thd1~0_In347573926 256) 0)) (.cse2 (= (mod ~b$w_buff1_used~0_In347573926 256) 0)) (.cse3 (= (mod ~b$r_buff1_thd1~0_In347573926 256) 0))) (or (and (= 0 |P0Thread1of1ForFork2_#t~ite6_Out347573926|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~b$w_buff1_used~0_In347573926 |P0Thread1of1ForFork2_#t~ite6_Out347573926|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In347573926, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In347573926, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In347573926, ~b$w_buff1_used~0=~b$w_buff1_used~0_In347573926} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In347573926, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In347573926, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In347573926, ~b$w_buff1_used~0=~b$w_buff1_used~0_In347573926, P0Thread1of1ForFork2_#t~ite6=|P0Thread1of1ForFork2_#t~ite6_Out347573926|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-07 17:49:16,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L757-->L758: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd1~0_In1851040903 256))) (.cse2 (= ~b$r_buff0_thd1~0_In1851040903 ~b$r_buff0_thd1~0_Out1851040903)) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1851040903 256)))) (or (and (not .cse0) (= 0 ~b$r_buff0_thd1~0_Out1851040903) (not .cse1)) (and .cse2 .cse1) (and .cse2 .cse0))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1851040903, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In1851040903} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1851040903, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_Out1851040903, P0Thread1of1ForFork2_#t~ite7=|P0Thread1of1ForFork2_#t~ite7_Out1851040903|} AuxVars[] AssignedVars[~b$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-07 17:49:16,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L758-->L758-2: Formula: (let ((.cse1 (= (mod ~b$r_buff1_thd1~0_In-1463141438 256) 0)) (.cse0 (= 0 (mod ~b$w_buff1_used~0_In-1463141438 256))) (.cse3 (= 0 (mod ~b$w_buff0_used~0_In-1463141438 256))) (.cse2 (= 0 (mod ~b$r_buff0_thd1~0_In-1463141438 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork2_#t~ite8_Out-1463141438| ~b$r_buff1_thd1~0_In-1463141438)) (and (= |P0Thread1of1ForFork2_#t~ite8_Out-1463141438| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-1463141438, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1463141438, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1463141438, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1463141438} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In-1463141438, ~b$r_buff0_thd1~0=~b$r_buff0_thd1~0_In-1463141438, ~b$r_buff1_thd1~0=~b$r_buff1_thd1~0_In-1463141438, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-1463141438, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1463141438|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-07 17:49:16,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L758-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork2_#t~ite8_34| v_~b$r_buff1_thd1~0_103) (= (+ v_~__unbuffered_cnt~0_81 1) v_~__unbuffered_cnt~0_80) (= |v_P0Thread1of1ForFork2_#res.offset_3| 0) (= 0 |v_P0Thread1of1ForFork2_#res.base_3|)) InVars {P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_81} OutVars{~b$r_buff1_thd1~0=v_~b$r_buff1_thd1~0_103, P0Thread1of1ForFork2_#t~ite8=|v_P0Thread1of1ForFork2_#t~ite8_33|, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_3|} AuxVars[] AssignedVars[~b$r_buff1_thd1~0, P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-07 17:49:16,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L846-1-->L852: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (= v_~main$tmp_guard0~0_8 (ite (= 0 (ite (= 3 v_~__unbuffered_cnt~0_33) 1 0)) 0 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-07 17:49:16,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L852-2-->L852-4: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff1_thd0~0_In1658609246 256))) (.cse1 (= 0 (mod ~b$w_buff1_used~0_In1658609246 256)))) (or (and (= ~b$w_buff1~0_In1658609246 |ULTIMATE.start_main_#t~ite47_Out1658609246|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~b~0_In1658609246 |ULTIMATE.start_main_#t~ite47_Out1658609246|)))) InVars {~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1658609246, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1658609246, ~b~0=~b~0_In1658609246, ~b$w_buff1~0=~b$w_buff1~0_In1658609246} OutVars{~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In1658609246, ~b$w_buff1_used~0=~b$w_buff1_used~0_In1658609246, ~b~0=~b~0_In1658609246, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1658609246|, ~b$w_buff1~0=~b$w_buff1~0_In1658609246} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-07 17:49:16,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L852-4-->L853: Formula: (= v_~b~0_51 |v_ULTIMATE.start_main_#t~ite47_11|) InVars {ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|} OutVars{~b~0=v_~b~0_51, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|} AuxVars[] AssignedVars[~b~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-07 17:49:16,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L853-->L853-2: Formula: (let ((.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In1445510027 256))) (.cse0 (= 0 (mod ~b$w_buff0_used~0_In1445510027 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite49_Out1445510027| ~b$w_buff0_used~0_In1445510027)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite49_Out1445510027| 0)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In1445510027, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1445510027} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In1445510027, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1445510027|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In1445510027} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-07 17:49:16,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~b$r_buff1_thd0~0_In-909317594 256) 0)) (.cse3 (= 0 (mod ~b$w_buff1_used~0_In-909317594 256))) (.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In-909317594 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In-909317594 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite50_Out-909317594| 0)) (and (or .cse2 .cse3) (= ~b$w_buff1_used~0_In-909317594 |ULTIMATE.start_main_#t~ite50_Out-909317594|) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In-909317594, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-909317594, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-909317594, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-909317594} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-909317594|, ~b$w_buff0_used~0=~b$w_buff0_used~0_In-909317594, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In-909317594, ~b$w_buff1_used~0=~b$w_buff1_used~0_In-909317594, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In-909317594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-07 17:49:16,458 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~b$r_buff0_thd0~0_In2114761290 256))) (.cse1 (= (mod ~b$w_buff0_used~0_In2114761290 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite51_Out2114761290| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite51_Out2114761290| ~b$r_buff0_thd0~0_In2114761290) (or .cse0 .cse1)))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2114761290, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2114761290} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2114761290, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out2114761290|, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2114761290} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-07 17:49:16,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L856-->L856-2: Formula: (let ((.cse0 (= (mod ~b$w_buff0_used~0_In2020321206 256) 0)) (.cse1 (= 0 (mod ~b$r_buff0_thd0~0_In2020321206 256))) (.cse2 (= 0 (mod ~b$w_buff1_used~0_In2020321206 256))) (.cse3 (= 0 (mod ~b$r_buff1_thd0~0_In2020321206 256)))) (or (and (or .cse0 .cse1) (= ~b$r_buff1_thd0~0_In2020321206 |ULTIMATE.start_main_#t~ite52_Out2020321206|) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out2020321206| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~b$w_buff0_used~0=~b$w_buff0_used~0_In2020321206, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2020321206, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2020321206, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2020321206} OutVars{~b$w_buff0_used~0=~b$w_buff0_used~0_In2020321206, ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out2020321206|, ~b$r_buff1_thd0~0=~b$r_buff1_thd0~0_In2020321206, ~b$w_buff1_used~0=~b$w_buff1_used~0_In2020321206, ~b$r_buff0_thd0~0=~b$r_buff0_thd0~0_In2020321206} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-07 17:49:16,459 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [890] [890] L856-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~b$r_buff1_thd0~0_185 |v_ULTIMATE.start_main_#t~ite52_39|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= (ite (= (ite (not (and (= 1 v_~__unbuffered_p2_EAX~0_19) (= v_~__unbuffered_p1_EBX~0_20 0) (= 1 v_~__unbuffered_p1_EAX~0_20) (= 0 v_~__unbuffered_p0_EAX~0_139) (= v_~__unbuffered_p2_EBX~0_26 0))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_18 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_39|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_139, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_20, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~b$r_buff1_thd0~0=v_~b$r_buff1_thd0~0_185, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_20, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_19, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~b$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-07 17:49:16,512 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7aba63c4-922e-40c0-aa6d-9cf7da1308a9/bin/uautomizer/witness.graphml [2019-12-07 17:49:16,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 17:49:16,513 INFO L168 Benchmark]: Toolchain (without parser) took 118298.29 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.2 GB). Free memory was 938.2 MB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2019-12-07 17:49:16,513 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 17:49:16,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:16,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.60 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 17:49:16,514 INFO L168 Benchmark]: Boogie Preprocessor took 26.99 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 17:49:16,514 INFO L168 Benchmark]: RCFGBuilder took 421.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:16,514 INFO L168 Benchmark]: TraceAbstraction took 117338.20 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2019-12-07 17:49:16,514 INFO L168 Benchmark]: Witness Printer took 68.31 ms. Allocated memory is still 7.2 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. [2019-12-07 17:49:16,516 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 958.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.24 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 938.2 MB in the beginning and 1.1 GB in the end (delta: -142.7 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 38.60 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.99 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 421.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 60.6 MB). Peak memory consumption was 60.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 117338.20 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: -3.3 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 68.31 ms. Allocated memory is still 7.2 GB. Free memory was 4.3 GB in the beginning and 4.3 GB in the end (delta: 13.0 MB). Peak memory consumption was 13.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.4s, 180 ProgramPointsBefore, 96 ProgramPointsAfterwards, 217 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 37 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 32 ChoiceCompositions, 7698 VarBasedMoverChecksPositive, 261 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 271 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.0s, 0 MoverChecksTotal, 83556 CheckedPairsTotal, 115 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L842] FCALL, FORK 0 pthread_create(&t849, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t850, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L846] FCALL, FORK 0 pthread_create(&t851, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L739] 1 b$w_buff1 = b$w_buff0 [L740] 1 b$w_buff0 = 1 [L741] 1 b$w_buff1_used = b$w_buff0_used [L742] 1 b$w_buff0_used = (_Bool)1 [L754] EXPR 1 b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L768] 2 x = 1 [L771] 2 y = 1 [L774] 2 __unbuffered_p1_EAX = y [L777] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L780] 2 b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L754] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L781] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L782] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L783] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 3 z = 1 [L797] 3 a = 1 [L800] 3 __unbuffered_p2_EAX = a [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 b$flush_delayed = weak$$choice2 [L806] 3 b$mem_tmp = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] EXPR 3 !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) VAL [!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L807] 3 b = !b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff1) [L808] 3 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : b$w_buff0)) [L809] EXPR 3 weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1))=0, x=1, y=1, z=1] [L809] 3 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff1 : b$w_buff1)) [L810] 3 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used)) [L811] EXPR 3 weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L811] 3 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L813] EXPR 3 weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=1] [L813] 3 b$r_buff1_thd3 = weak$$choice2 ? b$r_buff1_thd3 : (!b$w_buff0_used || !b$r_buff0_thd3 && !b$w_buff1_used || !b$r_buff0_thd3 && !b$r_buff1_thd3 ? b$r_buff1_thd3 : (b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L814] 3 __unbuffered_p2_EBX = b VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=1, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L819] 3 b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L820] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L821] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L822] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L755] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L756] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L852] 0 b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=1, y=1, z=1] [L853] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L854] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L855] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 117.1s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 34.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5312 SDtfs, 7109 SDslu, 15839 SDs, 0 SdLazy, 13427 SolverSat, 321 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 37 SyntacticMatches, 17 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3294 ImplicationChecksByTransitivity, 7.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=233994occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 58.4s AutomataMinimizationTime, 26 MinimizatonAttempts, 247555 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1164 NumberOfCodeBlocks, 1164 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1071 ConstructedInterpolants, 0 QuantifiedInterpolants, 452591 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...