./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix002_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix002_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 435eced382fd1041c0c07caef5d0b9d430de382c .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-635dfa2 [2018-12-09 12:14:50,752 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 12:14:50,753 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 12:14:50,759 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 12:14:50,759 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 12:14:50,760 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 12:14:50,761 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 12:14:50,761 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 12:14:50,762 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 12:14:50,763 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 12:14:50,763 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 12:14:50,763 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 12:14:50,764 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 12:14:50,764 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 12:14:50,765 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 12:14:50,765 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 12:14:50,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 12:14:50,766 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 12:14:50,767 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 12:14:50,768 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 12:14:50,768 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 12:14:50,769 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 12:14:50,770 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 12:14:50,770 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 12:14:50,770 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 12:14:50,770 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 12:14:50,771 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 12:14:50,771 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 12:14:50,772 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 12:14:50,772 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 12:14:50,772 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 12:14:50,772 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 12:14:50,773 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 12:14:50,773 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 12:14:50,773 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 12:14:50,773 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 12:14:50,773 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 12:14:50,780 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 12:14:50,780 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 12:14:50,781 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 12:14:50,781 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 12:14:50,781 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 12:14:50,781 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 12:14:50,781 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 12:14:50,781 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 12:14:50,781 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 12:14:50,781 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 12:14:50,782 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 12:14:50,782 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 12:14:50,783 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 12:14:50,783 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 12:14:50,783 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 12:14:50,784 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan 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 -> Taipan 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 -> 435eced382fd1041c0c07caef5d0b9d430de382c [2018-12-09 12:14:50,800 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 12:14:50,807 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 12:14:50,809 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 12:14:50,810 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 12:14:50,810 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 12:14:50,811 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix002_power.opt_false-unreach-call.i [2018-12-09 12:14:50,846 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/data/56665f59a/bf94acac39464aeb8903f20e5b40cfe4/FLAGb7e04393a [2018-12-09 12:14:51,255 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 12:14:51,256 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/sv-benchmarks/c/pthread-wmm/mix002_power.opt_false-unreach-call.i [2018-12-09 12:14:51,264 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/data/56665f59a/bf94acac39464aeb8903f20e5b40cfe4/FLAGb7e04393a [2018-12-09 12:14:51,668 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/data/56665f59a/bf94acac39464aeb8903f20e5b40cfe4 [2018-12-09 12:14:51,670 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 12:14:51,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 12:14:51,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 12:14:51,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 12:14:51,673 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 12:14:51,674 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:51,675 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5c87c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51, skipping insertion in model container [2018-12-09 12:14:51,675 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:51,679 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 12:14:51,701 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 12:14:51,883 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:14:51,890 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 12:14:51,964 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 12:14:51,994 INFO L195 MainTranslator]: Completed translation [2018-12-09 12:14:51,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51 WrapperNode [2018-12-09 12:14:51,994 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 12:14:51,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 12:14:51,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 12:14:51,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 12:14:52,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,013 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,032 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 12:14:52,032 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 12:14:52,032 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 12:14:52,032 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 12:14:52,038 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,039 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,049 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,051 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,053 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... [2018-12-09 12:14:52,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 12:14:52,056 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 12:14:52,056 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 12:14:52,056 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 12:14:52,057 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/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 [2018-12-09 12:14:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 12:14:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 12:14:52,095 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 12:14:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 12:14:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 12:14:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 12:14:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 12:14:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 12:14:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 12:14:52,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 12:14:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 12:14:52,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 12:14:52,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 12:14:52,098 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 12:14:52,483 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 12:14:52,484 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 12:14:52,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:14:52 BoogieIcfgContainer [2018-12-09 12:14:52,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 12:14:52,484 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 12:14:52,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 12:14:52,486 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 12:14:52,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:14:51" (1/3) ... [2018-12-09 12:14:52,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1399573e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:14:52, skipping insertion in model container [2018-12-09 12:14:52,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:14:51" (2/3) ... [2018-12-09 12:14:52,487 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1399573e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:14:52, skipping insertion in model container [2018-12-09 12:14:52,487 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:14:52" (3/3) ... [2018-12-09 12:14:52,488 INFO L112 eAbstractionObserver]: Analyzing ICFG mix002_power.opt_false-unreach-call.i [2018-12-09 12:14:52,515 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,515 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,515 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,515 WARN L317 ript$VariableManager]: TermVariabe Thread2_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,516 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,516 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,516 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,516 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,516 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,516 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,517 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet4.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet5.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,518 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,519 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,520 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,521 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,522 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,523 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,524 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,525 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,526 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,527 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,528 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,529 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,530 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,531 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,531 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,531 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe Thread1_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,532 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,533 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,534 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,535 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,536 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,537 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,538 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,539 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,540 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,541 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,542 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,543 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,544 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,545 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,546 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,547 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P2_#t~nondet57.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 12:14:52,552 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 12:14:52,553 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 12:14:52,559 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 12:14:52,572 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 12:14:52,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 12:14:52,586 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 12:14:52,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 12:14:52,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 12:14:52,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 12:14:52,586 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 12:14:52,587 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 12:14:52,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 12:14:52,593 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 191places, 243 transitions [2018-12-09 12:17:08,969 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 445148 states. [2018-12-09 12:17:08,971 INFO L276 IsEmpty]: Start isEmpty. Operand 445148 states. [2018-12-09 12:17:08,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-09 12:17:08,978 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:17:08,979 INFO L402 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] [2018-12-09 12:17:08,980 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:17:08,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:17:08,984 INFO L82 PathProgramCache]: Analyzing trace with hash 642654828, now seen corresponding path program 1 times [2018-12-09 12:17:08,985 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:17:09,019 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:17:09,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:17:09,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:17:09,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:17:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:17:09,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:17:09,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:17:09,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:17:09,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:17:09,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:17:09,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:17:09,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:17:09,137 INFO L87 Difference]: Start difference. First operand 445148 states. Second operand 4 states. [2018-12-09 12:17:17,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:17:17,536 INFO L93 Difference]: Finished difference Result 810628 states and 3886645 transitions. [2018-12-09 12:17:17,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:17:17,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2018-12-09 12:17:17,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:17:19,482 INFO L225 Difference]: With dead ends: 810628 [2018-12-09 12:17:19,482 INFO L226 Difference]: Without dead ends: 530978 [2018-12-09 12:17:19,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:17:27,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530978 states. [2018-12-09 12:17:32,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530978 to 307958. [2018-12-09 12:17:32,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307958 states. [2018-12-09 12:17:33,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307958 states to 307958 states and 1493659 transitions. [2018-12-09 12:17:33,939 INFO L78 Accepts]: Start accepts. Automaton has 307958 states and 1493659 transitions. Word has length 49 [2018-12-09 12:17:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:17:33,940 INFO L480 AbstractCegarLoop]: Abstraction has 307958 states and 1493659 transitions. [2018-12-09 12:17:33,940 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:17:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 307958 states and 1493659 transitions. [2018-12-09 12:17:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:17:33,950 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:17:33,950 INFO L402 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] [2018-12-09 12:17:33,950 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:17:33,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:17:33,951 INFO L82 PathProgramCache]: Analyzing trace with hash -559401747, now seen corresponding path program 1 times [2018-12-09 12:17:33,951 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:17:33,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:17:33,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:17:33,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:17:33,954 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:17:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:17:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:17:34,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:17:34,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:17:34,006 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:17:34,006 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:17:34,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:17:34,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:17:34,007 INFO L87 Difference]: Start difference. First operand 307958 states and 1493659 transitions. Second operand 3 states. [2018-12-09 12:17:39,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:17:39,639 INFO L93 Difference]: Finished difference Result 307958 states and 1492634 transitions. [2018-12-09 12:17:39,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:17:39,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2018-12-09 12:17:39,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:17:40,511 INFO L225 Difference]: With dead ends: 307958 [2018-12-09 12:17:40,511 INFO L226 Difference]: Without dead ends: 307958 [2018-12-09 12:17:40,512 INFO L631 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 [2018-12-09 12:17:46,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307958 states. [2018-12-09 12:17:49,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307958 to 307958. [2018-12-09 12:17:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307958 states. [2018-12-09 12:17:50,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307958 states to 307958 states and 1492634 transitions. [2018-12-09 12:17:50,949 INFO L78 Accepts]: Start accepts. Automaton has 307958 states and 1492634 transitions. Word has length 57 [2018-12-09 12:17:50,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:17:50,950 INFO L480 AbstractCegarLoop]: Abstraction has 307958 states and 1492634 transitions. [2018-12-09 12:17:50,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:17:50,950 INFO L276 IsEmpty]: Start isEmpty. Operand 307958 states and 1492634 transitions. [2018-12-09 12:17:50,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-12-09 12:17:50,955 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:17:50,956 INFO L402 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] [2018-12-09 12:17:50,956 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:17:50,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:17:50,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1183408588, now seen corresponding path program 1 times [2018-12-09 12:17:50,956 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:17:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:17:50,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:17:50,958 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:17:50,959 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:17:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:17:51,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:17:51,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:17:51,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:17:51,005 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:17:51,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:17:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:17:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:17:51,006 INFO L87 Difference]: Start difference. First operand 307958 states and 1492634 transitions. Second operand 4 states. [2018-12-09 12:17:55,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:17:55,752 INFO L93 Difference]: Finished difference Result 272412 states and 1286589 transitions. [2018-12-09 12:17:55,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 12:17:55,753 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-12-09 12:17:55,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:17:56,471 INFO L225 Difference]: With dead ends: 272412 [2018-12-09 12:17:56,471 INFO L226 Difference]: Without dead ends: 258312 [2018-12-09 12:17:56,471 INFO L631 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 [2018-12-09 12:18:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258312 states. [2018-12-09 12:18:04,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258312 to 258312. [2018-12-09 12:18:04,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258312 states. [2018-12-09 12:18:05,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258312 states to 258312 states and 1232396 transitions. [2018-12-09 12:18:05,315 INFO L78 Accepts]: Start accepts. Automaton has 258312 states and 1232396 transitions. Word has length 57 [2018-12-09 12:18:05,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:05,316 INFO L480 AbstractCegarLoop]: Abstraction has 258312 states and 1232396 transitions. [2018-12-09 12:18:05,316 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:18:05,316 INFO L276 IsEmpty]: Start isEmpty. Operand 258312 states and 1232396 transitions. [2018-12-09 12:18:05,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 12:18:05,323 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:05,323 INFO L402 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] [2018-12-09 12:18:05,324 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:05,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:05,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1028427502, now seen corresponding path program 1 times [2018-12-09 12:18:05,324 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:05,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:05,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:05,326 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:05,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:05,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:05,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:18:05,365 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:05,365 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:18:05,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:18:05,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:18:05,366 INFO L87 Difference]: Start difference. First operand 258312 states and 1232396 transitions. Second operand 5 states. [2018-12-09 12:18:05,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:05,597 INFO L93 Difference]: Finished difference Result 61672 states and 252912 transitions. [2018-12-09 12:18:05,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:18:05,598 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-09 12:18:05,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:05,696 INFO L225 Difference]: With dead ends: 61672 [2018-12-09 12:18:05,696 INFO L226 Difference]: Without dead ends: 49980 [2018-12-09 12:18:05,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:18:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49980 states. [2018-12-09 12:18:06,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49980 to 49520. [2018-12-09 12:18:06,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49520 states. [2018-12-09 12:18:06,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49520 states to 49520 states and 199434 transitions. [2018-12-09 12:18:06,786 INFO L78 Accepts]: Start accepts. Automaton has 49520 states and 199434 transitions. Word has length 58 [2018-12-09 12:18:06,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:06,786 INFO L480 AbstractCegarLoop]: Abstraction has 49520 states and 199434 transitions. [2018-12-09 12:18:06,787 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:18:06,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49520 states and 199434 transitions. [2018-12-09 12:18:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 12:18:06,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:06,790 INFO L402 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] [2018-12-09 12:18:06,790 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:06,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:06,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1388880671, now seen corresponding path program 1 times [2018-12-09 12:18:06,790 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:06,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:06,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:06,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:06,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:06,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:18:06,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:06,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:18:06,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:18:06,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:18:06,845 INFO L87 Difference]: Start difference. First operand 49520 states and 199434 transitions. Second operand 5 states. [2018-12-09 12:18:07,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:07,411 INFO L93 Difference]: Finished difference Result 100166 states and 398363 transitions. [2018-12-09 12:18:07,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:18:07,412 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2018-12-09 12:18:07,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:07,614 INFO L225 Difference]: With dead ends: 100166 [2018-12-09 12:18:07,614 INFO L226 Difference]: Without dead ends: 99791 [2018-12-09 12:18:07,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:18:07,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99791 states. [2018-12-09 12:18:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99791 to 66559. [2018-12-09 12:18:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66559 states. [2018-12-09 12:18:10,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66559 states to 66559 states and 261442 transitions. [2018-12-09 12:18:10,282 INFO L78 Accepts]: Start accepts. Automaton has 66559 states and 261442 transitions. Word has length 58 [2018-12-09 12:18:10,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:10,282 INFO L480 AbstractCegarLoop]: Abstraction has 66559 states and 261442 transitions. [2018-12-09 12:18:10,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:18:10,282 INFO L276 IsEmpty]: Start isEmpty. Operand 66559 states and 261442 transitions. [2018-12-09 12:18:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-09 12:18:10,285 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:10,285 INFO L402 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] [2018-12-09 12:18:10,286 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:10,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:10,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1403857607, now seen corresponding path program 1 times [2018-12-09 12:18:10,286 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:10,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:10,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:10,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:10,304 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:10,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:10,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:18:10,304 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:10,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:18:10,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:18:10,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:18:10,305 INFO L87 Difference]: Start difference. First operand 66559 states and 261442 transitions. Second operand 3 states. [2018-12-09 12:18:10,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:10,744 INFO L93 Difference]: Finished difference Result 122935 states and 477437 transitions. [2018-12-09 12:18:10,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:18:10,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-09 12:18:10,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:10,991 INFO L225 Difference]: With dead ends: 122935 [2018-12-09 12:18:10,991 INFO L226 Difference]: Without dead ends: 122915 [2018-12-09 12:18:10,991 INFO L631 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 [2018-12-09 12:18:11,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122915 states. [2018-12-09 12:18:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122915 to 103770. [2018-12-09 12:18:12,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103770 states. [2018-12-09 12:18:12,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103770 states to 103770 states and 403304 transitions. [2018-12-09 12:18:12,736 INFO L78 Accepts]: Start accepts. Automaton has 103770 states and 403304 transitions. Word has length 60 [2018-12-09 12:18:12,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:12,736 INFO L480 AbstractCegarLoop]: Abstraction has 103770 states and 403304 transitions. [2018-12-09 12:18:12,736 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:18:12,736 INFO L276 IsEmpty]: Start isEmpty. Operand 103770 states and 403304 transitions. [2018-12-09 12:18:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-12-09 12:18:12,743 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:12,743 INFO L402 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] [2018-12-09 12:18:12,743 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:12,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:12,744 INFO L82 PathProgramCache]: Analyzing trace with hash -151823598, now seen corresponding path program 1 times [2018-12-09 12:18:12,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:12,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:12,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:12,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:12,745 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:12,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:12,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:12,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:18:12,795 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:12,795 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:18:12,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:18:12,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:18:12,796 INFO L87 Difference]: Start difference. First operand 103770 states and 403304 transitions. Second operand 6 states. [2018-12-09 12:18:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:13,911 INFO L93 Difference]: Finished difference Result 144372 states and 554295 transitions. [2018-12-09 12:18:13,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:18:13,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2018-12-09 12:18:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:14,202 INFO L225 Difference]: With dead ends: 144372 [2018-12-09 12:18:14,202 INFO L226 Difference]: Without dead ends: 143887 [2018-12-09 12:18:14,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:18:14,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143887 states. [2018-12-09 12:18:15,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143887 to 102871. [2018-12-09 12:18:15,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102871 states. [2018-12-09 12:18:16,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102871 states to 102871 states and 400167 transitions. [2018-12-09 12:18:16,281 INFO L78 Accepts]: Start accepts. Automaton has 102871 states and 400167 transitions. Word has length 64 [2018-12-09 12:18:16,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:16,282 INFO L480 AbstractCegarLoop]: Abstraction has 102871 states and 400167 transitions. [2018-12-09 12:18:16,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:18:16,282 INFO L276 IsEmpty]: Start isEmpty. Operand 102871 states and 400167 transitions. [2018-12-09 12:18:16,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 12:18:16,303 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:16,303 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:16,303 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:16,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:16,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1070526233, now seen corresponding path program 1 times [2018-12-09 12:18:16,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:16,304 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:16,304 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:16,305 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:16,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:16,366 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:16,366 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:16,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:18:16,366 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:16,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:18:16,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:18:16,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:18:16,367 INFO L87 Difference]: Start difference. First operand 102871 states and 400167 transitions. Second operand 6 states. [2018-12-09 12:18:16,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:16,523 INFO L93 Difference]: Finished difference Result 38967 states and 133175 transitions. [2018-12-09 12:18:16,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 12:18:16,523 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 75 [2018-12-09 12:18:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:16,569 INFO L225 Difference]: With dead ends: 38967 [2018-12-09 12:18:16,569 INFO L226 Difference]: Without dead ends: 34263 [2018-12-09 12:18:16,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:18:16,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34263 states. [2018-12-09 12:18:16,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34263 to 33198. [2018-12-09 12:18:16,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33198 states. [2018-12-09 12:18:16,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33198 states to 33198 states and 112513 transitions. [2018-12-09 12:18:16,976 INFO L78 Accepts]: Start accepts. Automaton has 33198 states and 112513 transitions. Word has length 75 [2018-12-09 12:18:16,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:16,976 INFO L480 AbstractCegarLoop]: Abstraction has 33198 states and 112513 transitions. [2018-12-09 12:18:16,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:18:16,976 INFO L276 IsEmpty]: Start isEmpty. Operand 33198 states and 112513 transitions. [2018-12-09 12:18:17,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 12:18:17,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:17,011 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:17,011 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:17,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:17,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1038611019, now seen corresponding path program 1 times [2018-12-09 12:18:17,012 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:17,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:17,013 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:17,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:17,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:17,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:17,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:18:17,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:17,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:18:17,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:18:17,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:18:17,060 INFO L87 Difference]: Start difference. First operand 33198 states and 112513 transitions. Second operand 4 states. [2018-12-09 12:18:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:17,283 INFO L93 Difference]: Finished difference Result 38426 states and 128386 transitions. [2018-12-09 12:18:17,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:18:17,283 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-09 12:18:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:17,330 INFO L225 Difference]: With dead ends: 38426 [2018-12-09 12:18:17,330 INFO L226 Difference]: Without dead ends: 38426 [2018-12-09 12:18:17,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:18:17,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38426 states. [2018-12-09 12:18:17,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38426 to 36093. [2018-12-09 12:18:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36093 states. [2018-12-09 12:18:17,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36093 states to 36093 states and 121259 transitions. [2018-12-09 12:18:17,771 INFO L78 Accepts]: Start accepts. Automaton has 36093 states and 121259 transitions. Word has length 110 [2018-12-09 12:18:17,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:17,771 INFO L480 AbstractCegarLoop]: Abstraction has 36093 states and 121259 transitions. [2018-12-09 12:18:17,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:18:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 36093 states and 121259 transitions. [2018-12-09 12:18:17,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 12:18:17,806 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:17,806 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:17,807 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:17,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:17,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1179146934, now seen corresponding path program 1 times [2018-12-09 12:18:17,807 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:17,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:17,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:17,808 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:17,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:17,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:17,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:18:17,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:17,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:18:17,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:18:17,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:18:17,845 INFO L87 Difference]: Start difference. First operand 36093 states and 121259 transitions. Second operand 3 states. [2018-12-09 12:18:18,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:18,101 INFO L93 Difference]: Finished difference Result 49788 states and 165325 transitions. [2018-12-09 12:18:18,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:18:18,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 110 [2018-12-09 12:18:18,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:18,171 INFO L225 Difference]: With dead ends: 49788 [2018-12-09 12:18:18,171 INFO L226 Difference]: Without dead ends: 49788 [2018-12-09 12:18:18,171 INFO L631 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 [2018-12-09 12:18:18,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49788 states. [2018-12-09 12:18:18,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49788 to 45018. [2018-12-09 12:18:18,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45018 states. [2018-12-09 12:18:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45018 states to 45018 states and 150744 transitions. [2018-12-09 12:18:18,819 INFO L78 Accepts]: Start accepts. Automaton has 45018 states and 150744 transitions. Word has length 110 [2018-12-09 12:18:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:18,820 INFO L480 AbstractCegarLoop]: Abstraction has 45018 states and 150744 transitions. [2018-12-09 12:18:18,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:18:18,820 INFO L276 IsEmpty]: Start isEmpty. Operand 45018 states and 150744 transitions. [2018-12-09 12:18:18,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 12:18:18,863 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:18,863 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:18,863 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:18,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:18,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1634613070, now seen corresponding path program 2 times [2018-12-09 12:18:18,864 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:18,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:18,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:18,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:18,865 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:18,944 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:18,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:18,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:18:18,944 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:18,944 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:18:18,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:18:18,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:18:18,945 INFO L87 Difference]: Start difference. First operand 45018 states and 150744 transitions. Second operand 5 states. [2018-12-09 12:18:19,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:19,312 INFO L93 Difference]: Finished difference Result 57510 states and 188662 transitions. [2018-12-09 12:18:19,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:18:19,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2018-12-09 12:18:19,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:19,385 INFO L225 Difference]: With dead ends: 57510 [2018-12-09 12:18:19,385 INFO L226 Difference]: Without dead ends: 57510 [2018-12-09 12:18:19,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:18:19,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57510 states. [2018-12-09 12:18:19,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57510 to 49453. [2018-12-09 12:18:19,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49453 states. [2018-12-09 12:18:20,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49453 states to 49453 states and 164242 transitions. [2018-12-09 12:18:20,053 INFO L78 Accepts]: Start accepts. Automaton has 49453 states and 164242 transitions. Word has length 110 [2018-12-09 12:18:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:20,053 INFO L480 AbstractCegarLoop]: Abstraction has 49453 states and 164242 transitions. [2018-12-09 12:18:20,054 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:18:20,054 INFO L276 IsEmpty]: Start isEmpty. Operand 49453 states and 164242 transitions. [2018-12-09 12:18:20,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 12:18:20,107 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:20,108 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:20,108 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:20,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:20,108 INFO L82 PathProgramCache]: Analyzing trace with hash -1805318476, now seen corresponding path program 3 times [2018-12-09 12:18:20,108 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:20,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:18:20,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:20,110 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:20,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:20,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:20,151 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:20,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:18:20,151 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:20,151 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:18:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:18:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:18:20,152 INFO L87 Difference]: Start difference. First operand 49453 states and 164242 transitions. Second operand 4 states. [2018-12-09 12:18:20,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:20,362 INFO L93 Difference]: Finished difference Result 50285 states and 167010 transitions. [2018-12-09 12:18:20,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:18:20,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2018-12-09 12:18:20,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:20,434 INFO L225 Difference]: With dead ends: 50285 [2018-12-09 12:18:20,435 INFO L226 Difference]: Without dead ends: 50285 [2018-12-09 12:18:20,435 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:18:20,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50285 states. [2018-12-09 12:18:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50285 to 49709. [2018-12-09 12:18:21,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49709 states. [2018-12-09 12:18:21,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49709 states to 49709 states and 165138 transitions. [2018-12-09 12:18:21,092 INFO L78 Accepts]: Start accepts. Automaton has 49709 states and 165138 transitions. Word has length 110 [2018-12-09 12:18:21,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:21,093 INFO L480 AbstractCegarLoop]: Abstraction has 49709 states and 165138 transitions. [2018-12-09 12:18:21,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:18:21,093 INFO L276 IsEmpty]: Start isEmpty. Operand 49709 states and 165138 transitions. [2018-12-09 12:18:21,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-12-09 12:18:21,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:21,147 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:21,147 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:21,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:21,147 INFO L82 PathProgramCache]: Analyzing trace with hash 682194357, now seen corresponding path program 1 times [2018-12-09 12:18:21,147 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:21,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:21,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:18:21,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:21,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:21,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:21,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:21,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:21,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:18:21,252 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:21,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:18:21,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:18:21,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:18:21,253 INFO L87 Difference]: Start difference. First operand 49709 states and 165138 transitions. Second operand 6 states. [2018-12-09 12:18:21,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:21,421 INFO L93 Difference]: Finished difference Result 49517 states and 164066 transitions. [2018-12-09 12:18:21,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:18:21,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 110 [2018-12-09 12:18:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:21,491 INFO L225 Difference]: With dead ends: 49517 [2018-12-09 12:18:21,491 INFO L226 Difference]: Without dead ends: 49517 [2018-12-09 12:18:21,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:18:21,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49517 states. [2018-12-09 12:18:21,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49517 to 47984. [2018-12-09 12:18:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47984 states. [2018-12-09 12:18:22,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47984 states to 47984 states and 159508 transitions. [2018-12-09 12:18:22,064 INFO L78 Accepts]: Start accepts. Automaton has 47984 states and 159508 transitions. Word has length 110 [2018-12-09 12:18:22,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:22,065 INFO L480 AbstractCegarLoop]: Abstraction has 47984 states and 159508 transitions. [2018-12-09 12:18:22,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:18:22,065 INFO L276 IsEmpty]: Start isEmpty. Operand 47984 states and 159508 transitions. [2018-12-09 12:18:22,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:22,110 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:22,110 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:22,110 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:22,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1792950945, now seen corresponding path program 1 times [2018-12-09 12:18:22,111 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:22,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:22,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:22,113 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:22,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:22,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:22,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-09 12:18:22,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:22,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 12:18:22,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 12:18:22,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-09 12:18:22,203 INFO L87 Difference]: Start difference. First operand 47984 states and 159508 transitions. Second operand 8 states. [2018-12-09 12:18:23,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:23,270 INFO L93 Difference]: Finished difference Result 93932 states and 306763 transitions. [2018-12-09 12:18:23,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-12-09 12:18:23,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 112 [2018-12-09 12:18:23,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:23,406 INFO L225 Difference]: With dead ends: 93932 [2018-12-09 12:18:23,406 INFO L226 Difference]: Without dead ends: 93477 [2018-12-09 12:18:23,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=361, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:18:23,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93477 states. [2018-12-09 12:18:24,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93477 to 70459. [2018-12-09 12:18:24,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70459 states. [2018-12-09 12:18:24,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70459 states to 70459 states and 233778 transitions. [2018-12-09 12:18:24,476 INFO L78 Accepts]: Start accepts. Automaton has 70459 states and 233778 transitions. Word has length 112 [2018-12-09 12:18:24,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:24,476 INFO L480 AbstractCegarLoop]: Abstraction has 70459 states and 233778 transitions. [2018-12-09 12:18:24,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 12:18:24,476 INFO L276 IsEmpty]: Start isEmpty. Operand 70459 states and 233778 transitions. [2018-12-09 12:18:24,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:24,556 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:24,556 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:24,556 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:24,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -284258398, now seen corresponding path program 1 times [2018-12-09 12:18:24,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:24,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:24,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:24,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:24,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:24,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:24,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:24,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:18:24,648 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:24,648 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:18:24,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:18:24,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:18:24,648 INFO L87 Difference]: Start difference. First operand 70459 states and 233778 transitions. Second operand 7 states. [2018-12-09 12:18:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:25,308 INFO L93 Difference]: Finished difference Result 111119 states and 357226 transitions. [2018-12-09 12:18:25,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 12:18:25,308 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-09 12:18:25,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:25,478 INFO L225 Difference]: With dead ends: 111119 [2018-12-09 12:18:25,478 INFO L226 Difference]: Without dead ends: 111119 [2018-12-09 12:18:25,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2018-12-09 12:18:25,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111119 states. [2018-12-09 12:18:26,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111119 to 90929. [2018-12-09 12:18:26,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90929 states. [2018-12-09 12:18:26,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90929 states to 90929 states and 296549 transitions. [2018-12-09 12:18:26,905 INFO L78 Accepts]: Start accepts. Automaton has 90929 states and 296549 transitions. Word has length 112 [2018-12-09 12:18:26,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:26,906 INFO L480 AbstractCegarLoop]: Abstraction has 90929 states and 296549 transitions. [2018-12-09 12:18:26,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:18:26,906 INFO L276 IsEmpty]: Start isEmpty. Operand 90929 states and 296549 transitions. [2018-12-09 12:18:27,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:27,015 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:27,015 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:27,016 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:27,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:27,016 INFO L82 PathProgramCache]: Analyzing trace with hash -72907485, now seen corresponding path program 1 times [2018-12-09 12:18:27,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:27,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:27,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:27,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:27,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:27,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:27,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:18:27,114 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:27,114 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:18:27,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:18:27,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:18:27,114 INFO L87 Difference]: Start difference. First operand 90929 states and 296549 transitions. Second operand 7 states. [2018-12-09 12:18:27,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:27,554 INFO L93 Difference]: Finished difference Result 94591 states and 307506 transitions. [2018-12-09 12:18:27,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 12:18:27,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-09 12:18:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:27,690 INFO L225 Difference]: With dead ends: 94591 [2018-12-09 12:18:27,690 INFO L226 Difference]: Without dead ends: 94591 [2018-12-09 12:18:27,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-12-09 12:18:27,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94591 states. [2018-12-09 12:18:28,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94591 to 93782. [2018-12-09 12:18:28,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93782 states. [2018-12-09 12:18:28,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93782 states to 93782 states and 305257 transitions. [2018-12-09 12:18:28,890 INFO L78 Accepts]: Start accepts. Automaton has 93782 states and 305257 transitions. Word has length 112 [2018-12-09 12:18:28,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:28,891 INFO L480 AbstractCegarLoop]: Abstraction has 93782 states and 305257 transitions. [2018-12-09 12:18:28,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:18:28,891 INFO L276 IsEmpty]: Start isEmpty. Operand 93782 states and 305257 transitions. [2018-12-09 12:18:29,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:29,005 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:29,006 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:29,006 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:29,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:29,006 INFO L82 PathProgramCache]: Analyzing trace with hash 814596196, now seen corresponding path program 1 times [2018-12-09 12:18:29,006 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:29,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:29,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:29,007 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:29,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:29,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:29,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 12:18:29,060 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:29,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 12:18:29,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 12:18:29,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:18:29,061 INFO L87 Difference]: Start difference. First operand 93782 states and 305257 transitions. Second operand 4 states. [2018-12-09 12:18:29,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:29,603 INFO L93 Difference]: Finished difference Result 95042 states and 308980 transitions. [2018-12-09 12:18:29,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 12:18:29,603 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2018-12-09 12:18:29,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:29,741 INFO L225 Difference]: With dead ends: 95042 [2018-12-09 12:18:29,741 INFO L226 Difference]: Without dead ends: 95042 [2018-12-09 12:18:29,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 12:18:29,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95042 states. [2018-12-09 12:18:30,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95042 to 90377. [2018-12-09 12:18:30,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90377 states. [2018-12-09 12:18:30,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90377 states to 90377 states and 294308 transitions. [2018-12-09 12:18:30,861 INFO L78 Accepts]: Start accepts. Automaton has 90377 states and 294308 transitions. Word has length 112 [2018-12-09 12:18:30,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:30,861 INFO L480 AbstractCegarLoop]: Abstraction has 90377 states and 294308 transitions. [2018-12-09 12:18:30,861 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 12:18:30,861 INFO L276 IsEmpty]: Start isEmpty. Operand 90377 states and 294308 transitions. [2018-12-09 12:18:30,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:30,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:30,969 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:30,969 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:30,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:30,970 INFO L82 PathProgramCache]: Analyzing trace with hash -2139914155, now seen corresponding path program 1 times [2018-12-09 12:18:30,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:30,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:30,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:30,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:30,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:31,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:31,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:31,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 12:18:31,017 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:31,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 12:18:31,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 12:18:31,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 12:18:31,018 INFO L87 Difference]: Start difference. First operand 90377 states and 294308 transitions. Second operand 5 states. [2018-12-09 12:18:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:31,475 INFO L93 Difference]: Finished difference Result 98305 states and 317962 transitions. [2018-12-09 12:18:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 12:18:31,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2018-12-09 12:18:31,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:31,626 INFO L225 Difference]: With dead ends: 98305 [2018-12-09 12:18:31,626 INFO L226 Difference]: Without dead ends: 98305 [2018-12-09 12:18:31,626 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:18:31,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98305 states. [2018-12-09 12:18:32,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98305 to 93212. [2018-12-09 12:18:32,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93212 states. [2018-12-09 12:18:32,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93212 states to 93212 states and 302771 transitions. [2018-12-09 12:18:32,868 INFO L78 Accepts]: Start accepts. Automaton has 93212 states and 302771 transitions. Word has length 112 [2018-12-09 12:18:32,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:32,868 INFO L480 AbstractCegarLoop]: Abstraction has 93212 states and 302771 transitions. [2018-12-09 12:18:32,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 12:18:32,869 INFO L276 IsEmpty]: Start isEmpty. Operand 93212 states and 302771 transitions. [2018-12-09 12:18:32,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:32,980 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:32,981 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:32,981 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:32,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:32,981 INFO L82 PathProgramCache]: Analyzing trace with hash 1315915223, now seen corresponding path program 2 times [2018-12-09 12:18:32,981 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:32,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:32,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:32,982 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:33,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:33,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:33,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 12:18:33,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:33,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 12:18:33,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 12:18:33,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-09 12:18:33,063 INFO L87 Difference]: Start difference. First operand 93212 states and 302771 transitions. Second operand 7 states. [2018-12-09 12:18:33,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:33,603 INFO L93 Difference]: Finished difference Result 104572 states and 336949 transitions. [2018-12-09 12:18:33,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:18:33,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 112 [2018-12-09 12:18:33,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:33,763 INFO L225 Difference]: With dead ends: 104572 [2018-12-09 12:18:33,763 INFO L226 Difference]: Without dead ends: 104022 [2018-12-09 12:18:33,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:18:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104022 states. [2018-12-09 12:18:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104022 to 75947. [2018-12-09 12:18:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75947 states. [2018-12-09 12:18:34,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75947 states to 75947 states and 246129 transitions. [2018-12-09 12:18:34,881 INFO L78 Accepts]: Start accepts. Automaton has 75947 states and 246129 transitions. Word has length 112 [2018-12-09 12:18:34,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:34,881 INFO L480 AbstractCegarLoop]: Abstraction has 75947 states and 246129 transitions. [2018-12-09 12:18:34,881 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 12:18:34,881 INFO L276 IsEmpty]: Start isEmpty. Operand 75947 states and 246129 transitions. [2018-12-09 12:18:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:34,966 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:34,966 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:34,967 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:34,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:34,967 INFO L82 PathProgramCache]: Analyzing trace with hash -761294120, now seen corresponding path program 2 times [2018-12-09 12:18:34,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:34,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:34,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:18:34,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:34,969 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:34,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:34,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 12:18:34,997 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:34,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 12:18:34,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 12:18:34,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 12:18:34,998 INFO L87 Difference]: Start difference. First operand 75947 states and 246129 transitions. Second operand 3 states. [2018-12-09 12:18:35,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:35,332 INFO L93 Difference]: Finished difference Result 91947 states and 297114 transitions. [2018-12-09 12:18:35,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 12:18:35,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2018-12-09 12:18:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:35,457 INFO L225 Difference]: With dead ends: 91947 [2018-12-09 12:18:35,457 INFO L226 Difference]: Without dead ends: 91947 [2018-12-09 12:18:35,457 INFO L631 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 [2018-12-09 12:18:35,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91947 states. [2018-12-09 12:18:36,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91947 to 91562. [2018-12-09 12:18:36,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91562 states. [2018-12-09 12:18:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91562 states to 91562 states and 295991 transitions. [2018-12-09 12:18:36,556 INFO L78 Accepts]: Start accepts. Automaton has 91562 states and 295991 transitions. Word has length 112 [2018-12-09 12:18:36,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:36,556 INFO L480 AbstractCegarLoop]: Abstraction has 91562 states and 295991 transitions. [2018-12-09 12:18:36,557 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 12:18:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 91562 states and 295991 transitions. [2018-12-09 12:18:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-12-09 12:18:36,668 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:36,668 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:36,668 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:36,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:36,669 INFO L82 PathProgramCache]: Analyzing trace with hash -410494183, now seen corresponding path program 1 times [2018-12-09 12:18:36,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:36,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:18:36,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:36,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:36,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:36,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:36,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 12:18:36,744 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:36,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 12:18:36,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 12:18:36,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 12:18:36,745 INFO L87 Difference]: Start difference. First operand 91562 states and 295991 transitions. Second operand 6 states. [2018-12-09 12:18:37,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:37,373 INFO L93 Difference]: Finished difference Result 110150 states and 355563 transitions. [2018-12-09 12:18:37,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:18:37,373 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 112 [2018-12-09 12:18:37,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:37,548 INFO L225 Difference]: With dead ends: 110150 [2018-12-09 12:18:37,548 INFO L226 Difference]: Without dead ends: 110150 [2018-12-09 12:18:37,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 12:18:37,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110150 states. [2018-12-09 12:18:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110150 to 91737. [2018-12-09 12:18:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91737 states. [2018-12-09 12:18:38,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91737 states to 91737 states and 296506 transitions. [2018-12-09 12:18:38,924 INFO L78 Accepts]: Start accepts. Automaton has 91737 states and 296506 transitions. Word has length 112 [2018-12-09 12:18:38,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:38,924 INFO L480 AbstractCegarLoop]: Abstraction has 91737 states and 296506 transitions. [2018-12-09 12:18:38,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 12:18:38,924 INFO L276 IsEmpty]: Start isEmpty. Operand 91737 states and 296506 transitions. [2018-12-09 12:18:39,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 12:18:39,034 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:39,034 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:39,034 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:39,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:39,034 INFO L82 PathProgramCache]: Analyzing trace with hash -96052247, now seen corresponding path program 1 times [2018-12-09 12:18:39,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:39,035 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:39,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:39,035 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:39,153 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:39,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:18:39,153 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:39,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:18:39,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:18:39,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:18:39,154 INFO L87 Difference]: Start difference. First operand 91737 states and 296506 transitions. Second operand 10 states. [2018-12-09 12:18:39,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:39,929 INFO L93 Difference]: Finished difference Result 134301 states and 431841 transitions. [2018-12-09 12:18:39,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:18:39,930 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-09 12:18:39,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:39,999 INFO L225 Difference]: With dead ends: 134301 [2018-12-09 12:18:39,999 INFO L226 Difference]: Without dead ends: 53253 [2018-12-09 12:18:40,000 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:18:40,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53253 states. [2018-12-09 12:18:40,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53253 to 53253. [2018-12-09 12:18:40,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53253 states. [2018-12-09 12:18:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53253 states to 53253 states and 164578 transitions. [2018-12-09 12:18:40,561 INFO L78 Accepts]: Start accepts. Automaton has 53253 states and 164578 transitions. Word has length 114 [2018-12-09 12:18:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:40,561 INFO L480 AbstractCegarLoop]: Abstraction has 53253 states and 164578 transitions. [2018-12-09 12:18:40,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:18:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 53253 states and 164578 transitions. [2018-12-09 12:18:40,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 12:18:40,616 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:40,616 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:40,616 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:40,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash -478477197, now seen corresponding path program 2 times [2018-12-09 12:18:40,616 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:40,617 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 12:18:40,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:40,617 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:40,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:40,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:40,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:40,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 12:18:40,696 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:40,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 12:18:40,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 12:18:40,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-09 12:18:40,697 INFO L87 Difference]: Start difference. First operand 53253 states and 164578 transitions. Second operand 10 states. [2018-12-09 12:18:41,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:41,162 INFO L93 Difference]: Finished difference Result 68948 states and 213714 transitions. [2018-12-09 12:18:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 12:18:41,162 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2018-12-09 12:18:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:41,178 INFO L225 Difference]: With dead ends: 68948 [2018-12-09 12:18:41,178 INFO L226 Difference]: Without dead ends: 14496 [2018-12-09 12:18:41,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2018-12-09 12:18:41,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14496 states. [2018-12-09 12:18:41,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14496 to 14492. [2018-12-09 12:18:41,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14492 states. [2018-12-09 12:18:41,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14492 states to 14492 states and 46323 transitions. [2018-12-09 12:18:41,324 INFO L78 Accepts]: Start accepts. Automaton has 14492 states and 46323 transitions. Word has length 114 [2018-12-09 12:18:41,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:41,324 INFO L480 AbstractCegarLoop]: Abstraction has 14492 states and 46323 transitions. [2018-12-09 12:18:41,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 12:18:41,324 INFO L276 IsEmpty]: Start isEmpty. Operand 14492 states and 46323 transitions. [2018-12-09 12:18:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 12:18:41,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:41,337 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:41,337 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:41,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash -643420003, now seen corresponding path program 3 times [2018-12-09 12:18:41,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:41,338 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:18:41,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:41,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:41,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 12:18:41,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 12:18:41,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 12:18:41,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-09 12:18:41,442 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 12:18:41,442 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-09 12:18:41,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 12:18:41,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-12-09 12:18:41,442 INFO L87 Difference]: Start difference. First operand 14492 states and 46323 transitions. Second operand 13 states. [2018-12-09 12:18:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 12:18:41,919 INFO L93 Difference]: Finished difference Result 24585 states and 77220 transitions. [2018-12-09 12:18:41,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 12:18:41,919 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 114 [2018-12-09 12:18:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 12:18:41,938 INFO L225 Difference]: With dead ends: 24585 [2018-12-09 12:18:41,938 INFO L226 Difference]: Without dead ends: 17829 [2018-12-09 12:18:41,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=387, Unknown=0, NotChecked=0, Total=462 [2018-12-09 12:18:41,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17829 states. [2018-12-09 12:18:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17829 to 14823. [2018-12-09 12:18:42,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14823 states. [2018-12-09 12:18:42,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14823 states to 14823 states and 47136 transitions. [2018-12-09 12:18:42,101 INFO L78 Accepts]: Start accepts. Automaton has 14823 states and 47136 transitions. Word has length 114 [2018-12-09 12:18:42,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 12:18:42,101 INFO L480 AbstractCegarLoop]: Abstraction has 14823 states and 47136 transitions. [2018-12-09 12:18:42,101 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-09 12:18:42,101 INFO L276 IsEmpty]: Start isEmpty. Operand 14823 states and 47136 transitions. [2018-12-09 12:18:42,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-12-09 12:18:42,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 12:18:42,114 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 12:18:42,114 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 12:18:42,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 12:18:42,114 INFO L82 PathProgramCache]: Analyzing trace with hash 48191279, now seen corresponding path program 4 times [2018-12-09 12:18:42,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 12:18:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:42,115 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 12:18:42,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 12:18:42,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 12:18:42,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:18:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 12:18:42,194 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 12:18:42,283 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 12:18:42,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:18:42 BasicIcfg [2018-12-09 12:18:42,284 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 12:18:42,285 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 12:18:42,285 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 12:18:42,285 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 12:18:42,285 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:14:52" (3/4) ... [2018-12-09 12:18:42,287 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 12:18:42,382 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_a46437c2-9f1d-46db-99f0-882dbd7f0ee5/bin-2019/utaipan/witness.graphml [2018-12-09 12:18:42,382 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 12:18:42,383 INFO L168 Benchmark]: Toolchain (without parser) took 230713.20 ms. Allocated memory was 1.0 GB in the beginning and 7.8 GB in the end (delta: 6.8 GB). Free memory was 945.9 MB in the beginning and 5.0 GB in the end (delta: -4.1 GB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2018-12-09 12:18:42,384 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 12:18:42,384 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. [2018-12-09 12:18:42,384 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 12:18:42,385 INFO L168 Benchmark]: Boogie Preprocessor took 23.96 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. [2018-12-09 12:18:42,385 INFO L168 Benchmark]: RCFGBuilder took 428.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. [2018-12-09 12:18:42,385 INFO L168 Benchmark]: TraceAbstraction took 229799.92 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 996.9 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. [2018-12-09 12:18:42,385 INFO L168 Benchmark]: Witness Printer took 97.90 ms. Allocated memory is still 7.8 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-09 12:18:42,387 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 83.9 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -115.8 MB). Peak memory consumption was 37.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.96 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 428.04 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 996.9 MB in the end (delta: 59.5 MB). Peak memory consumption was 59.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 229799.92 ms. Allocated memory was 1.1 GB in the beginning and 7.8 GB in the end (delta: 6.7 GB). Free memory was 996.9 MB in the beginning and 5.1 GB in the end (delta: -4.1 GB). Peak memory consumption was 5.2 GB. Max. memory is 11.5 GB. * Witness Printer took 97.90 ms. Allocated memory is still 7.8 GB. Free memory was 5.1 GB in the beginning and 5.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L676] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L678] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L680] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L682] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0] [L684] -1 int __unbuffered_p2_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0] [L686] -1 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0] [L687] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0] [L688] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0] [L690] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L692] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L694] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L695] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L696] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L697] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L698] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L699] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L700] -1 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L701] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0] [L702] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L703] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L704] -1 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L705] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0] [L706] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L707] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L708] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L709] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L710] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L711] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L712] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] -1 pthread_t t43; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L822] FCALL, FORK -1 pthread_create(&t43, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L823] -1 pthread_t t44; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK -1 pthread_create(&t44, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L825] -1 pthread_t t45; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] FCALL, FORK -1 pthread_create(&t45, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 0 z$w_buff1 = z$w_buff0 [L769] 0 z$w_buff0 = 1 [L770] 0 z$w_buff1_used = z$w_buff0_used [L771] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L774] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L775] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L776] 0 z$r_buff1_thd3 = z$r_buff0_thd3 [L777] 0 z$r_buff0_thd3 = (_Bool)1 [L780] 0 weak$$choice0 = __VERIFIER_nondet_pointer() [L781] 0 weak$$choice2 = __VERIFIER_nondet_pointer() [L782] 0 z$flush_delayed = weak$$choice2 [L783] 0 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L784] 0 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L785] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L786] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L787] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L788] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L789] EXPR 0 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L789] 0 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L790] EXPR 0 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L790] 0 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L791] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] EXPR 0 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 0 z = z$flush_delayed ? z$mem_tmp : z [L793] 0 z$flush_delayed = (_Bool)0 [L796] 0 __unbuffered_p2_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L716] 1 a = 1 [L719] 1 x = 1 [L722] 1 __unbuffered_p0_EAX = x [L725] 1 __unbuffered_p0_EBX = y [L730] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L737] 2 y = 1 [L740] 2 __unbuffered_p1_EAX = y [L743] 2 weak$$choice0 = __VERIFIER_nondet_pointer() [L744] 2 weak$$choice2 = __VERIFIER_nondet_pointer() [L745] 2 z$flush_delayed = weak$$choice2 [L746] 2 z$mem_tmp = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L747] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L748] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L749] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L749] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L750] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L751] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L752] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L753] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L754] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L799] 0 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L800] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 0 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L803] EXPR 0 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L806] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L755] 2 z = z$flush_delayed ? z$mem_tmp : z [L756] 2 z$flush_delayed = (_Bool)0 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L833] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L834] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L835] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L836] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L836] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L839] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 306 locations, 3 error locations. UNSAFE Result, 229.7s OverallTime, 25 OverallIterations, 1 TraceHistogramMax, 34.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 8530 SDtfs, 10737 SDslu, 21166 SDs, 0 SdLazy, 6337 SolverSat, 422 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 238 GetRequests, 58 SyntacticMatches, 21 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=445148occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 55.2s AutomataMinimizationTime, 24 MinimizatonAttempts, 438865 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2380 NumberOfCodeBlocks, 2380 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 2242 ConstructedInterpolants, 0 QuantifiedInterpolants, 509749 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...