./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_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_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/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 ffd67b86a2dfea5b1e5d645bc032c3da98c3f249 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:09:05,004 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 19:09:05,005 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 19:09:05,013 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 19:09:05,013 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 19:09:05,014 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 19:09:05,014 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 19:09:05,015 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 19:09:05,016 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 19:09:05,016 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 19:09:05,017 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 19:09:05,017 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 19:09:05,017 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 19:09:05,018 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 19:09:05,018 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 19:09:05,018 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 19:09:05,019 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 19:09:05,020 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 19:09:05,020 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 19:09:05,021 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 19:09:05,022 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 19:09:05,023 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 19:09:05,024 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 19:09:05,024 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 19:09:05,024 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 19:09:05,025 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 19:09:05,025 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 19:09:05,026 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 19:09:05,026 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 19:09:05,027 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 19:09:05,027 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 19:09:05,027 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 19:09:05,027 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 19:09:05,027 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 19:09:05,028 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 19:09:05,028 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 19:09:05,028 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 19:09:05,037 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 19:09:05,037 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 19:09:05,038 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 19:09:05,038 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 19:09:05,038 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 19:09:05,038 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 19:09:05,039 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 19:09:05,040 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 19:09:05,040 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 19:09:05,040 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 19:09:05,040 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 19:09:05,041 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 19:09:05,042 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 19:09:05,042 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 19:09:05,042 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 19:09:05,042 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 19:09:05,042 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 19:09:05,042 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 19:09:05,043 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 19:09:05,043 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 19:09:05,043 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 19:09:05,043 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 19:09:05,043 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 19:09:05,043 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 19:09:05,043 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_f5755fb9-6ef2-4e21-afed-77529abbb09c/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 -> ffd67b86a2dfea5b1e5d645bc032c3da98c3f249 [2018-12-09 19:09:05,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 19:09:05,076 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 19:09:05,079 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 19:09:05,080 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 19:09:05,080 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 19:09:05,081 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i [2018-12-09 19:09:05,119 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/data/2057c2a27/cb6c321d4c134fd58bb694bc957c975d/FLAGb7fa59adf [2018-12-09 19:09:05,581 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 19:09:05,582 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/sv-benchmarks/c/pthread-wmm/mix056_tso.oepc_false-unreach-call.i [2018-12-09 19:09:05,590 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/data/2057c2a27/cb6c321d4c134fd58bb694bc957c975d/FLAGb7fa59adf [2018-12-09 19:09:05,599 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/data/2057c2a27/cb6c321d4c134fd58bb694bc957c975d [2018-12-09 19:09:05,601 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 19:09:05,602 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 19:09:05,602 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 19:09:05,602 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 19:09:05,604 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 19:09:05,605 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cdc5e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05, skipping insertion in model container [2018-12-09 19:09:05,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,611 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 19:09:05,633 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 19:09:05,812 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:09:05,819 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 19:09:05,901 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 19:09:05,930 INFO L195 MainTranslator]: Completed translation [2018-12-09 19:09:05,930 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05 WrapperNode [2018-12-09 19:09:05,930 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 19:09:05,931 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 19:09:05,931 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 19:09:05,931 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 19:09:05,936 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,945 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 19:09:05,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 19:09:05,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 19:09:05,962 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 19:09:05,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,980 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,983 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,985 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... [2018-12-09 19:09:05,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 19:09:05,987 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 19:09:05,987 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 19:09:05,988 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 19:09:05,988 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/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 19:09:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 19:09:06,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 19:09:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 19:09:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 19:09:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 19:09:06,019 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 19:09:06,019 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 19:09:06,020 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 19:09:06,321 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 19:09:06,321 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 19:09:06,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:09:06 BoogieIcfgContainer [2018-12-09 19:09:06,322 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 19:09:06,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 19:09:06,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 19:09:06,324 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 19:09:06,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:09:05" (1/3) ... [2018-12-09 19:09:06,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b617c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:09:06, skipping insertion in model container [2018-12-09 19:09:06,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:09:05" (2/3) ... [2018-12-09 19:09:06,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b617c94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:09:06, skipping insertion in model container [2018-12-09 19:09:06,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:09:06" (3/3) ... [2018-12-09 19:09:06,326 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_tso.oepc_false-unreach-call.i [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,347 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,348 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,349 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,350 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,351 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,352 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,353 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,354 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,355 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 19:09:06,358 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 19:09:06,359 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 19:09:06,364 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 19:09:06,373 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 19:09:06,387 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 19:09:06,387 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 19:09:06,388 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 19:09:06,388 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 19:09:06,388 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 19:09:06,388 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 19:09:06,388 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 19:09:06,388 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 19:09:06,395 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 19:09:21,489 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 19:09:21,490 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 19:09:21,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 19:09:21,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:21,498 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] [2018-12-09 19:09:21,499 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:21,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:21,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-09 19:09:21,504 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:21,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:21,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:21,538 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:21,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:21,655 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 19:09:21,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:21,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:21,656 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:21,660 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:21,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:21,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:21,669 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 19:09:23,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:23,054 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 19:09:23,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:09:23,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 19:09:23,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:23,794 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 19:09:23,794 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 19:09:23,795 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 19:09:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 19:09:28,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 19:09:28,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 19:09:29,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 19:09:29,111 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 19:09:29,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:29,112 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 19:09:29,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:29,113 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 19:09:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:09:29,120 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:29,120 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] [2018-12-09 19:09:29,120 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:29,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:29,120 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-09 19:09:29,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:29,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:29,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:29,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:29,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:29,169 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 19:09:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:29,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:09:29,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:29,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:09:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:09:29,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:09:29,171 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 19:09:29,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:29,710 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 19:09:29,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:09:29,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 19:09:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:30,032 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 19:09:30,032 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 19:09:30,032 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 19:09:31,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 19:09:32,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 19:09:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 19:09:35,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 19:09:35,067 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 19:09:35,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:35,068 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 19:09:35,068 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:09:35,068 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 19:09:35,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 19:09:35,071 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:35,071 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] [2018-12-09 19:09:35,072 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:35,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:35,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-09 19:09:35,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:35,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:35,074 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:35,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:35,074 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:35,121 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 19:09:35,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:35,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:35,121 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:35,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:35,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:35,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:35,122 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 19:09:36,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:36,758 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 19:09:36,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:36,758 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 19:09:36,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:37,925 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 19:09:37,925 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 19:09:37,926 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 19:09:39,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 19:09:42,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 19:09:42,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 19:09:43,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 19:09:43,191 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 19:09:43,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:43,191 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 19:09:43,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:43,191 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 19:09:43,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 19:09:43,197 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:43,197 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] [2018-12-09 19:09:43,197 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:43,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:43,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-09 19:09:43,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:43,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:43,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:43,199 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:43,226 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 19:09:43,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:43,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:43,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:43,227 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:43,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:43,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:43,227 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 4 states. [2018-12-09 19:09:43,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:43,940 INFO L93 Difference]: Finished difference Result 163598 states and 725472 transitions. [2018-12-09 19:09:43,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:09:43,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-09 19:09:43,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:44,337 INFO L225 Difference]: With dead ends: 163598 [2018-12-09 19:09:44,337 INFO L226 Difference]: Without dead ends: 160993 [2018-12-09 19:09:44,338 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 19:09:45,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-09 19:09:49,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-09 19:09:49,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-09 19:09:49,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716800 transitions. [2018-12-09 19:09:49,586 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716800 transitions. Word has length 51 [2018-12-09 19:09:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:49,587 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716800 transitions. [2018-12-09 19:09:49,587 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:49,587 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716800 transitions. [2018-12-09 19:09:49,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-09 19:09:49,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:49,592 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] [2018-12-09 19:09:49,592 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:49,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:49,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1667665363, now seen corresponding path program 1 times [2018-12-09 19:09:49,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:49,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:49,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:49,594 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:49,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:49,626 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 19:09:49,626 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:49,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:49,627 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:49,627 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:49,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:49,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:49,627 INFO L87 Difference]: Start difference. First operand 160993 states and 716800 transitions. Second operand 5 states. [2018-12-09 19:09:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:49,848 INFO L93 Difference]: Finished difference Result 51405 states and 209121 transitions. [2018-12-09 19:09:49,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:09:49,848 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-09 19:09:49,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:49,944 INFO L225 Difference]: With dead ends: 51405 [2018-12-09 19:09:49,944 INFO L226 Difference]: Without dead ends: 49093 [2018-12-09 19:09:49,944 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 19:09:50,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-09 19:09:50,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-09 19:09:50,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-09 19:09:50,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200467 transitions. [2018-12-09 19:09:50,916 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200467 transitions. Word has length 52 [2018-12-09 19:09:50,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:50,917 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200467 transitions. [2018-12-09 19:09:50,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:50,917 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200467 transitions. [2018-12-09 19:09:50,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:09:50,924 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:50,925 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] [2018-12-09 19:09:50,925 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:50,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:50,925 INFO L82 PathProgramCache]: Analyzing trace with hash 503624572, now seen corresponding path program 1 times [2018-12-09 19:09:50,925 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:50,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:50,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:50,927 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:50,984 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 19:09:50,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:50,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:50,985 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:50,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:50,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:50,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:50,985 INFO L87 Difference]: Start difference. First operand 49093 states and 200467 transitions. Second operand 4 states. [2018-12-09 19:09:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:51,316 INFO L93 Difference]: Finished difference Result 70361 states and 282256 transitions. [2018-12-09 19:09:51,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 19:09:51,316 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-09 19:09:51,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:51,452 INFO L225 Difference]: With dead ends: 70361 [2018-12-09 19:09:51,452 INFO L226 Difference]: Without dead ends: 70361 [2018-12-09 19:09:51,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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 19:09:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-12-09 19:09:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2018-12-09 19:09:52,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2018-12-09 19:09:52,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217408 transitions. [2018-12-09 19:09:52,334 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217408 transitions. Word has length 65 [2018-12-09 19:09:52,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:52,334 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217408 transitions. [2018-12-09 19:09:52,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:52,335 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217408 transitions. [2018-12-09 19:09:52,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 19:09:52,347 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:52,347 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] [2018-12-09 19:09:52,347 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:52,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:52,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2048532389, now seen corresponding path program 1 times [2018-12-09 19:09:52,348 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:52,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:52,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:52,350 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:52,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:52,399 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 19:09:52,399 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:52,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:52,399 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:52,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:52,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:52,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:52,400 INFO L87 Difference]: Start difference. First operand 53657 states and 217408 transitions. Second operand 6 states. [2018-12-09 19:09:52,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:52,458 INFO L93 Difference]: Finished difference Result 11001 states and 37616 transitions. [2018-12-09 19:09:52,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:52,458 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 19:09:52,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:52,470 INFO L225 Difference]: With dead ends: 11001 [2018-12-09 19:09:52,470 INFO L226 Difference]: Without dead ends: 9289 [2018-12-09 19:09:52,470 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 19:09:52,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9289 states. [2018-12-09 19:09:52,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9289 to 8774. [2018-12-09 19:09:52,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8774 states. [2018-12-09 19:09:52,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8774 states to 8774 states and 29920 transitions. [2018-12-09 19:09:52,563 INFO L78 Accepts]: Start accepts. Automaton has 8774 states and 29920 transitions. Word has length 65 [2018-12-09 19:09:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:52,564 INFO L480 AbstractCegarLoop]: Abstraction has 8774 states and 29920 transitions. [2018-12-09 19:09:52,564 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 8774 states and 29920 transitions. [2018-12-09 19:09:52,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:09:52,573 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:52,573 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] [2018-12-09 19:09:52,573 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:52,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash 877472604, now seen corresponding path program 1 times [2018-12-09 19:09:52,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:52,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:52,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:52,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:52,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:52,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:52,603 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 19:09:52,603 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:52,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 19:09:52,603 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:52,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 19:09:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 19:09:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 19:09:52,603 INFO L87 Difference]: Start difference. First operand 8774 states and 29920 transitions. Second operand 3 states. [2018-12-09 19:09:52,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:52,692 INFO L93 Difference]: Finished difference Result 9194 states and 31201 transitions. [2018-12-09 19:09:52,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 19:09:52,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 19:09:52,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:52,702 INFO L225 Difference]: With dead ends: 9194 [2018-12-09 19:09:52,702 INFO L226 Difference]: Without dead ends: 9194 [2018-12-09 19:09:52,702 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 19:09:52,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9194 states. [2018-12-09 19:09:52,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9194 to 8964. [2018-12-09 19:09:52,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8964 states. [2018-12-09 19:09:52,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8964 states to 8964 states and 30502 transitions. [2018-12-09 19:09:52,790 INFO L78 Accepts]: Start accepts. Automaton has 8964 states and 30502 transitions. Word has length 98 [2018-12-09 19:09:52,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:52,790 INFO L480 AbstractCegarLoop]: Abstraction has 8964 states and 30502 transitions. [2018-12-09 19:09:52,790 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 19:09:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 8964 states and 30502 transitions. [2018-12-09 19:09:52,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:09:52,800 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:52,800 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] [2018-12-09 19:09:52,800 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:52,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:52,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1190943875, now seen corresponding path program 1 times [2018-12-09 19:09:52,800 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:52,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:52,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:52,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:52,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:52,870 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 19:09:52,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:52,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:52,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:52,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:52,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:52,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:52,871 INFO L87 Difference]: Start difference. First operand 8964 states and 30502 transitions. Second operand 5 states. [2018-12-09 19:09:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:53,252 INFO L93 Difference]: Finished difference Result 11109 states and 37218 transitions. [2018-12-09 19:09:53,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:53,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 19:09:53,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:53,264 INFO L225 Difference]: With dead ends: 11109 [2018-12-09 19:09:53,264 INFO L226 Difference]: Without dead ends: 11109 [2018-12-09 19:09:53,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 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 19:09:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11109 states. [2018-12-09 19:09:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11109 to 9409. [2018-12-09 19:09:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9409 states. [2018-12-09 19:09:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9409 states to 9409 states and 31868 transitions. [2018-12-09 19:09:53,365 INFO L78 Accepts]: Start accepts. Automaton has 9409 states and 31868 transitions. Word has length 98 [2018-12-09 19:09:53,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:53,365 INFO L480 AbstractCegarLoop]: Abstraction has 9409 states and 31868 transitions. [2018-12-09 19:09:53,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:53,365 INFO L276 IsEmpty]: Start isEmpty. Operand 9409 states and 31868 transitions. [2018-12-09 19:09:53,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 19:09:53,375 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:53,375 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] [2018-12-09 19:09:53,376 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:53,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:53,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1198703234, now seen corresponding path program 2 times [2018-12-09 19:09:53,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:53,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:53,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:53,378 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:53,411 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 19:09:53,411 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:53,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:53,412 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:53,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:53,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:53,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:53,412 INFO L87 Difference]: Start difference. First operand 9409 states and 31868 transitions. Second operand 4 states. [2018-12-09 19:09:53,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:53,566 INFO L93 Difference]: Finished difference Result 14489 states and 49265 transitions. [2018-12-09 19:09:53,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:09:53,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 19:09:53,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:53,583 INFO L225 Difference]: With dead ends: 14489 [2018-12-09 19:09:53,583 INFO L226 Difference]: Without dead ends: 14489 [2018-12-09 19:09:53,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 19:09:53,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14489 states. [2018-12-09 19:09:53,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14489 to 9619. [2018-12-09 19:09:53,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9619 states. [2018-12-09 19:09:53,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9619 states to 9619 states and 32506 transitions. [2018-12-09 19:09:53,702 INFO L78 Accepts]: Start accepts. Automaton has 9619 states and 32506 transitions. Word has length 98 [2018-12-09 19:09:53,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:53,703 INFO L480 AbstractCegarLoop]: Abstraction has 9619 states and 32506 transitions. [2018-12-09 19:09:53,703 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:53,703 INFO L276 IsEmpty]: Start isEmpty. Operand 9619 states and 32506 transitions. [2018-12-09 19:09:53,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:53,713 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:53,714 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] [2018-12-09 19:09:53,714 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:53,714 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:53,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1564298, now seen corresponding path program 1 times [2018-12-09 19:09:53,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:53,715 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:53,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:53,715 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:53,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 19:09:53,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:53,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:53,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:53,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:53,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:53,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:53,745 INFO L87 Difference]: Start difference. First operand 9619 states and 32506 transitions. Second operand 4 states. [2018-12-09 19:09:53,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:53,857 INFO L93 Difference]: Finished difference Result 17455 states and 58925 transitions. [2018-12-09 19:09:53,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:09:53,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 19:09:53,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:53,877 INFO L225 Difference]: With dead ends: 17455 [2018-12-09 19:09:53,877 INFO L226 Difference]: Without dead ends: 17455 [2018-12-09 19:09:53,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 19:09:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17455 states. [2018-12-09 19:09:53,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17455 to 9369. [2018-12-09 19:09:53,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9369 states. [2018-12-09 19:09:54,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9369 states to 9369 states and 31371 transitions. [2018-12-09 19:09:54,007 INFO L78 Accepts]: Start accepts. Automaton has 9369 states and 31371 transitions. Word has length 100 [2018-12-09 19:09:54,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:54,007 INFO L480 AbstractCegarLoop]: Abstraction has 9369 states and 31371 transitions. [2018-12-09 19:09:54,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:54,007 INFO L276 IsEmpty]: Start isEmpty. Operand 9369 states and 31371 transitions. [2018-12-09 19:09:54,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:54,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:54,016 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] [2018-12-09 19:09:54,016 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:54,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:54,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1184911595, now seen corresponding path program 1 times [2018-12-09 19:09:54,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:54,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:54,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:54,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:54,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:54,089 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 19:09:54,089 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:54,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:54,089 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:54,090 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:54,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:54,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:54,090 INFO L87 Difference]: Start difference. First operand 9369 states and 31371 transitions. Second operand 6 states. [2018-12-09 19:09:54,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:54,245 INFO L93 Difference]: Finished difference Result 11429 states and 37784 transitions. [2018-12-09 19:09:54,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:09:54,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:54,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:54,257 INFO L225 Difference]: With dead ends: 11429 [2018-12-09 19:09:54,257 INFO L226 Difference]: Without dead ends: 11429 [2018-12-09 19:09:54,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:54,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11429 states. [2018-12-09 19:09:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11429 to 9714. [2018-12-09 19:09:54,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9714 states. [2018-12-09 19:09:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9714 states to 9714 states and 32482 transitions. [2018-12-09 19:09:54,359 INFO L78 Accepts]: Start accepts. Automaton has 9714 states and 32482 transitions. Word has length 100 [2018-12-09 19:09:54,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:54,359 INFO L480 AbstractCegarLoop]: Abstraction has 9714 states and 32482 transitions. [2018-12-09 19:09:54,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:54,359 INFO L276 IsEmpty]: Start isEmpty. Operand 9714 states and 32482 transitions. [2018-12-09 19:09:54,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:54,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:54,369 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] [2018-12-09 19:09:54,369 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:54,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:54,369 INFO L82 PathProgramCache]: Analyzing trace with hash -215330572, now seen corresponding path program 1 times [2018-12-09 19:09:54,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:54,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:54,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:54,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:54,420 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 19:09:54,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:54,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:54,420 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:54,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:54,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:54,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:54,420 INFO L87 Difference]: Start difference. First operand 9714 states and 32482 transitions. Second operand 6 states. [2018-12-09 19:09:54,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:54,539 INFO L93 Difference]: Finished difference Result 8993 states and 29747 transitions. [2018-12-09 19:09:54,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:54,540 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:54,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:54,549 INFO L225 Difference]: With dead ends: 8993 [2018-12-09 19:09:54,549 INFO L226 Difference]: Without dead ends: 8993 [2018-12-09 19:09:54,549 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:54,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8993 states. [2018-12-09 19:09:54,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8993 to 8644. [2018-12-09 19:09:54,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8644 states. [2018-12-09 19:09:54,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8644 states to 8644 states and 28726 transitions. [2018-12-09 19:09:54,631 INFO L78 Accepts]: Start accepts. Automaton has 8644 states and 28726 transitions. Word has length 100 [2018-12-09 19:09:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:54,631 INFO L480 AbstractCegarLoop]: Abstraction has 8644 states and 28726 transitions. [2018-12-09 19:09:54,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:54,632 INFO L276 IsEmpty]: Start isEmpty. Operand 8644 states and 28726 transitions. [2018-12-09 19:09:54,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:54,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:54,639 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] [2018-12-09 19:09:54,639 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:54,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:54,639 INFO L82 PathProgramCache]: Analyzing trace with hash 866833783, now seen corresponding path program 1 times [2018-12-09 19:09:54,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:54,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:54,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:54,640 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:54,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:54,688 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 19:09:54,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:54,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:54,688 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:54,688 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:54,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:54,688 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:54,689 INFO L87 Difference]: Start difference. First operand 8644 states and 28726 transitions. Second operand 6 states. [2018-12-09 19:09:54,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:54,898 INFO L93 Difference]: Finished difference Result 10024 states and 32535 transitions. [2018-12-09 19:09:54,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:54,898 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:54,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:54,908 INFO L225 Difference]: With dead ends: 10024 [2018-12-09 19:09:54,908 INFO L226 Difference]: Without dead ends: 9669 [2018-12-09 19:09:54,908 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 19:09:54,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9669 states. [2018-12-09 19:09:54,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9669 to 9094. [2018-12-09 19:09:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9094 states. [2018-12-09 19:09:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9094 states to 9094 states and 29921 transitions. [2018-12-09 19:09:54,992 INFO L78 Accepts]: Start accepts. Automaton has 9094 states and 29921 transitions. Word has length 100 [2018-12-09 19:09:54,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:54,992 INFO L480 AbstractCegarLoop]: Abstraction has 9094 states and 29921 transitions. [2018-12-09 19:09:54,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 9094 states and 29921 transitions. [2018-12-09 19:09:55,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:55,000 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:55,000 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] [2018-12-09 19:09:55,000 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:55,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:55,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1727393034, now seen corresponding path program 1 times [2018-12-09 19:09:55,000 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:55,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,002 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:55,071 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 19:09:55,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:55,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:55,071 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:55,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:55,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:55,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:55,072 INFO L87 Difference]: Start difference. First operand 9094 states and 29921 transitions. Second operand 7 states. [2018-12-09 19:09:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:55,289 INFO L93 Difference]: Finished difference Result 10057 states and 33017 transitions. [2018-12-09 19:09:55,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:55,290 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 19:09:55,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:55,301 INFO L225 Difference]: With dead ends: 10057 [2018-12-09 19:09:55,301 INFO L226 Difference]: Without dead ends: 10057 [2018-12-09 19:09:55,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:55,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10057 states. [2018-12-09 19:09:55,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10057 to 9009. [2018-12-09 19:09:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9009 states. [2018-12-09 19:09:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9009 states to 9009 states and 29673 transitions. [2018-12-09 19:09:55,396 INFO L78 Accepts]: Start accepts. Automaton has 9009 states and 29673 transitions. Word has length 100 [2018-12-09 19:09:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:55,396 INFO L480 AbstractCegarLoop]: Abstraction has 9009 states and 29673 transitions. [2018-12-09 19:09:55,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:55,396 INFO L276 IsEmpty]: Start isEmpty. Operand 9009 states and 29673 transitions. [2018-12-09 19:09:55,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:55,405 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:55,405 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] [2018-12-09 19:09:55,405 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:55,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:55,405 INFO L82 PathProgramCache]: Analyzing trace with hash -316513514, now seen corresponding path program 1 times [2018-12-09 19:09:55,405 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:55,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:55,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,406 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:55,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:55,476 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 19:09:55,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:55,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:55,477 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:55,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:55,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:55,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:55,477 INFO L87 Difference]: Start difference. First operand 9009 states and 29673 transitions. Second operand 5 states. [2018-12-09 19:09:55,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:55,556 INFO L93 Difference]: Finished difference Result 8217 states and 26961 transitions. [2018-12-09 19:09:55,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:09:55,556 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 19:09:55,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:55,564 INFO L225 Difference]: With dead ends: 8217 [2018-12-09 19:09:55,565 INFO L226 Difference]: Without dead ends: 8217 [2018-12-09 19:09:55,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:55,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8217 states. [2018-12-09 19:09:55,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8217 to 8032. [2018-12-09 19:09:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8032 states. [2018-12-09 19:09:55,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8032 states to 8032 states and 26443 transitions. [2018-12-09 19:09:55,639 INFO L78 Accepts]: Start accepts. Automaton has 8032 states and 26443 transitions. Word has length 100 [2018-12-09 19:09:55,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:55,639 INFO L480 AbstractCegarLoop]: Abstraction has 8032 states and 26443 transitions. [2018-12-09 19:09:55,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:55,639 INFO L276 IsEmpty]: Start isEmpty. Operand 8032 states and 26443 transitions. [2018-12-09 19:09:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:55,646 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:55,646 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] [2018-12-09 19:09:55,646 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:55,646 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:55,646 INFO L82 PathProgramCache]: Analyzing trace with hash 705286743, now seen corresponding path program 1 times [2018-12-09 19:09:55,646 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,647 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:55,647 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,647 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:55,691 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 19:09:55,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:55,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 19:09:55,691 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:55,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 19:09:55,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 19:09:55,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 19:09:55,692 INFO L87 Difference]: Start difference. First operand 8032 states and 26443 transitions. Second operand 4 states. [2018-12-09 19:09:55,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:55,776 INFO L93 Difference]: Finished difference Result 9376 states and 31131 transitions. [2018-12-09 19:09:55,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 19:09:55,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 19:09:55,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:55,786 INFO L225 Difference]: With dead ends: 9376 [2018-12-09 19:09:55,786 INFO L226 Difference]: Without dead ends: 9376 [2018-12-09 19:09:55,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 19:09:55,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9376 states. [2018-12-09 19:09:55,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9376 to 9248. [2018-12-09 19:09:55,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9248 states. [2018-12-09 19:09:55,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9248 states to 9248 states and 30715 transitions. [2018-12-09 19:09:55,875 INFO L78 Accepts]: Start accepts. Automaton has 9248 states and 30715 transitions. Word has length 100 [2018-12-09 19:09:55,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:55,875 INFO L480 AbstractCegarLoop]: Abstraction has 9248 states and 30715 transitions. [2018-12-09 19:09:55,875 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 19:09:55,875 INFO L276 IsEmpty]: Start isEmpty. Operand 9248 states and 30715 transitions. [2018-12-09 19:09:55,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 19:09:55,883 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:55,883 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] [2018-12-09 19:09:55,884 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:55,884 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:55,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1371922600, now seen corresponding path program 1 times [2018-12-09 19:09:55,884 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:55,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:55,885 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:55,885 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:55,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:55,958 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 19:09:55,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:55,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:55,959 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:55,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:55,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:55,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:55,959 INFO L87 Difference]: Start difference. First operand 9248 states and 30715 transitions. Second operand 6 states. [2018-12-09 19:09:56,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:56,062 INFO L93 Difference]: Finished difference Result 8096 states and 26267 transitions. [2018-12-09 19:09:56,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 19:09:56,063 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 19:09:56,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:56,070 INFO L225 Difference]: With dead ends: 8096 [2018-12-09 19:09:56,070 INFO L226 Difference]: Without dead ends: 8096 [2018-12-09 19:09:56,071 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 19:09:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8096 states. [2018-12-09 19:09:56,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8096 to 6671. [2018-12-09 19:09:56,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6671 states. [2018-12-09 19:09:56,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6671 states to 6671 states and 21861 transitions. [2018-12-09 19:09:56,140 INFO L78 Accepts]: Start accepts. Automaton has 6671 states and 21861 transitions. Word has length 100 [2018-12-09 19:09:56,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:56,140 INFO L480 AbstractCegarLoop]: Abstraction has 6671 states and 21861 transitions. [2018-12-09 19:09:56,140 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:56,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6671 states and 21861 transitions. [2018-12-09 19:09:56,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:56,146 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:56,146 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] [2018-12-09 19:09:56,146 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:56,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:56,146 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-09 19:09:56,146 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:56,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:56,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:56,147 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:56,208 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 19:09:56,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:56,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:56,208 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:56,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:56,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:56,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:56,209 INFO L87 Difference]: Start difference. First operand 6671 states and 21861 transitions. Second operand 7 states. [2018-12-09 19:09:56,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:56,529 INFO L93 Difference]: Finished difference Result 12218 states and 39640 transitions. [2018-12-09 19:09:56,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 19:09:56,530 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:09:56,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:56,542 INFO L225 Difference]: With dead ends: 12218 [2018-12-09 19:09:56,542 INFO L226 Difference]: Without dead ends: 12218 [2018-12-09 19:09:56,542 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:09:56,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12218 states. [2018-12-09 19:09:56,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12218 to 9653. [2018-12-09 19:09:56,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9653 states. [2018-12-09 19:09:56,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9653 states to 9653 states and 31719 transitions. [2018-12-09 19:09:56,643 INFO L78 Accepts]: Start accepts. Automaton has 9653 states and 31719 transitions. Word has length 102 [2018-12-09 19:09:56,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:56,644 INFO L480 AbstractCegarLoop]: Abstraction has 9653 states and 31719 transitions. [2018-12-09 19:09:56,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:56,644 INFO L276 IsEmpty]: Start isEmpty. Operand 9653 states and 31719 transitions. [2018-12-09 19:09:56,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:56,652 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:56,652 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] [2018-12-09 19:09:56,652 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:56,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:56,652 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-09 19:09:56,652 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:56,653 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:56,653 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:56,653 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:56,723 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 19:09:56,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:56,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:56,723 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:56,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:56,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:56,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:56,724 INFO L87 Difference]: Start difference. First operand 9653 states and 31719 transitions. Second operand 6 states. [2018-12-09 19:09:56,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:56,807 INFO L93 Difference]: Finished difference Result 9843 states and 32066 transitions. [2018-12-09 19:09:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:09:56,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 19:09:56,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:56,817 INFO L225 Difference]: With dead ends: 9843 [2018-12-09 19:09:56,818 INFO L226 Difference]: Without dead ends: 9843 [2018-12-09 19:09:56,818 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 19:09:56,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9843 states. [2018-12-09 19:09:56,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9843 to 9578. [2018-12-09 19:09:56,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9578 states. [2018-12-09 19:09:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9578 states to 9578 states and 31339 transitions. [2018-12-09 19:09:56,906 INFO L78 Accepts]: Start accepts. Automaton has 9578 states and 31339 transitions. Word has length 102 [2018-12-09 19:09:56,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:56,906 INFO L480 AbstractCegarLoop]: Abstraction has 9578 states and 31339 transitions. [2018-12-09 19:09:56,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 9578 states and 31339 transitions. [2018-12-09 19:09:56,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:56,914 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:56,914 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] [2018-12-09 19:09:56,914 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:56,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:56,915 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-09 19:09:56,915 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:56,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:56,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:56,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:56,916 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:56,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:56,975 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 19:09:56,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:56,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:56,976 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:56,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:56,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:56,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:56,977 INFO L87 Difference]: Start difference. First operand 9578 states and 31339 transitions. Second operand 6 states. [2018-12-09 19:09:57,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:57,116 INFO L93 Difference]: Finished difference Result 17910 states and 59425 transitions. [2018-12-09 19:09:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:57,117 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 19:09:57,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:57,137 INFO L225 Difference]: With dead ends: 17910 [2018-12-09 19:09:57,137 INFO L226 Difference]: Without dead ends: 17910 [2018-12-09 19:09:57,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 19:09:57,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17910 states. [2018-12-09 19:09:57,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17910 to 9898. [2018-12-09 19:09:57,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9898 states. [2018-12-09 19:09:57,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9898 states to 9898 states and 32205 transitions. [2018-12-09 19:09:57,269 INFO L78 Accepts]: Start accepts. Automaton has 9898 states and 32205 transitions. Word has length 102 [2018-12-09 19:09:57,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:57,269 INFO L480 AbstractCegarLoop]: Abstraction has 9898 states and 32205 transitions. [2018-12-09 19:09:57,269 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:57,269 INFO L276 IsEmpty]: Start isEmpty. Operand 9898 states and 32205 transitions. [2018-12-09 19:09:57,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:57,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:57,278 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] [2018-12-09 19:09:57,278 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:57,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:57,279 INFO L82 PathProgramCache]: Analyzing trace with hash -597334546, now seen corresponding path program 2 times [2018-12-09 19:09:57,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:57,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:57,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:57,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:57,340 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 19:09:57,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:57,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:57,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:57,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:57,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:57,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:57,341 INFO L87 Difference]: Start difference. First operand 9898 states and 32205 transitions. Second operand 7 states. [2018-12-09 19:09:57,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:57,567 INFO L93 Difference]: Finished difference Result 9958 states and 32353 transitions. [2018-12-09 19:09:57,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 19:09:57,568 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:09:57,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:57,578 INFO L225 Difference]: With dead ends: 9958 [2018-12-09 19:09:57,578 INFO L226 Difference]: Without dead ends: 9958 [2018-12-09 19:09:57,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:09:57,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9958 states. [2018-12-09 19:09:57,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9958 to 9898. [2018-12-09 19:09:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9898 states. [2018-12-09 19:09:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9898 states to 9898 states and 32190 transitions. [2018-12-09 19:09:57,672 INFO L78 Accepts]: Start accepts. Automaton has 9898 states and 32190 transitions. Word has length 102 [2018-12-09 19:09:57,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:57,672 INFO L480 AbstractCegarLoop]: Abstraction has 9898 states and 32190 transitions. [2018-12-09 19:09:57,672 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 9898 states and 32190 transitions. [2018-12-09 19:09:57,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:57,682 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:57,682 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] [2018-12-09 19:09:57,682 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:57,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:57,682 INFO L82 PathProgramCache]: Analyzing trace with hash 1904809647, now seen corresponding path program 1 times [2018-12-09 19:09:57,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:57,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:57,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:57,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:57,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:57,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:57,745 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 19:09:57,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:57,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:57,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:57,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:57,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:57,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:57,746 INFO L87 Difference]: Start difference. First operand 9898 states and 32190 transitions. Second operand 7 states. [2018-12-09 19:09:57,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:57,938 INFO L93 Difference]: Finished difference Result 14769 states and 49087 transitions. [2018-12-09 19:09:57,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 19:09:57,938 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:09:57,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:57,954 INFO L225 Difference]: With dead ends: 14769 [2018-12-09 19:09:57,954 INFO L226 Difference]: Without dead ends: 14769 [2018-12-09 19:09:57,955 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-09 19:09:57,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14769 states. [2018-12-09 19:09:58,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14769 to 8228. [2018-12-09 19:09:58,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8228 states. [2018-12-09 19:09:58,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8228 states to 8228 states and 26859 transitions. [2018-12-09 19:09:58,063 INFO L78 Accepts]: Start accepts. Automaton has 8228 states and 26859 transitions. Word has length 102 [2018-12-09 19:09:58,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:58,063 INFO L480 AbstractCegarLoop]: Abstraction has 8228 states and 26859 transitions. [2018-12-09 19:09:58,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:58,063 INFO L276 IsEmpty]: Start isEmpty. Operand 8228 states and 26859 transitions. [2018-12-09 19:09:58,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:58,070 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:58,070 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] [2018-12-09 19:09:58,070 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:58,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:58,071 INFO L82 PathProgramCache]: Analyzing trace with hash 989810927, now seen corresponding path program 1 times [2018-12-09 19:09:58,071 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:58,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:58,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:58,072 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:58,123 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 19:09:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:58,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 19:09:58,124 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:58,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 19:09:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 19:09:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 19:09:58,124 INFO L87 Difference]: Start difference. First operand 8228 states and 26859 transitions. Second operand 5 states. [2018-12-09 19:09:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:58,238 INFO L93 Difference]: Finished difference Result 9508 states and 31019 transitions. [2018-12-09 19:09:58,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:58,238 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 19:09:58,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:58,248 INFO L225 Difference]: With dead ends: 9508 [2018-12-09 19:09:58,248 INFO L226 Difference]: Without dead ends: 9508 [2018-12-09 19:09:58,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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 19:09:58,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9508 states. [2018-12-09 19:09:58,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9508 to 8420. [2018-12-09 19:09:58,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8420 states. [2018-12-09 19:09:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8420 states to 8420 states and 27483 transitions. [2018-12-09 19:09:58,333 INFO L78 Accepts]: Start accepts. Automaton has 8420 states and 27483 transitions. Word has length 102 [2018-12-09 19:09:58,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:58,333 INFO L480 AbstractCegarLoop]: Abstraction has 8420 states and 27483 transitions. [2018-12-09 19:09:58,333 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 19:09:58,333 INFO L276 IsEmpty]: Start isEmpty. Operand 8420 states and 27483 transitions. [2018-12-09 19:09:58,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:58,341 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:58,341 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] [2018-12-09 19:09:58,341 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:58,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:58,341 INFO L82 PathProgramCache]: Analyzing trace with hash -2060391888, now seen corresponding path program 1 times [2018-12-09 19:09:58,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:58,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:58,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:58,342 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:58,436 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 19:09:58,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:58,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 19:09:58,437 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:58,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 19:09:58,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 19:09:58,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 19:09:58,437 INFO L87 Difference]: Start difference. First operand 8420 states and 27483 transitions. Second operand 10 states. [2018-12-09 19:09:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:58,751 INFO L93 Difference]: Finished difference Result 15888 states and 52276 transitions. [2018-12-09 19:09:58,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 19:09:58,752 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 19:09:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:58,761 INFO L225 Difference]: With dead ends: 15888 [2018-12-09 19:09:58,761 INFO L226 Difference]: Without dead ends: 7760 [2018-12-09 19:09:58,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 19:09:58,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7760 states. [2018-12-09 19:09:58,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7760 to 7760. [2018-12-09 19:09:58,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7760 states. [2018-12-09 19:09:58,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7760 states to 7760 states and 25563 transitions. [2018-12-09 19:09:58,834 INFO L78 Accepts]: Start accepts. Automaton has 7760 states and 25563 transitions. Word has length 102 [2018-12-09 19:09:58,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:58,835 INFO L480 AbstractCegarLoop]: Abstraction has 7760 states and 25563 transitions. [2018-12-09 19:09:58,835 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 19:09:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7760 states and 25563 transitions. [2018-12-09 19:09:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:58,841 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:58,841 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] [2018-12-09 19:09:58,842 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:58,842 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:58,842 INFO L82 PathProgramCache]: Analyzing trace with hash 445470452, now seen corresponding path program 2 times [2018-12-09 19:09:58,842 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:58,843 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:58,843 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:58,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:58,903 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 19:09:58,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:58,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 19:09:58,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:58,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 19:09:58,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 19:09:58,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 19:09:58,904 INFO L87 Difference]: Start difference. First operand 7760 states and 25563 transitions. Second operand 7 states. [2018-12-09 19:09:59,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:59,092 INFO L93 Difference]: Finished difference Result 14370 states and 48066 transitions. [2018-12-09 19:09:59,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 19:09:59,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 19:09:59,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:59,100 INFO L225 Difference]: With dead ends: 14370 [2018-12-09 19:09:59,100 INFO L226 Difference]: Without dead ends: 6821 [2018-12-09 19:09:59,100 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 19:09:59,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6821 states. [2018-12-09 19:09:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6821 to 6821. [2018-12-09 19:09:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6821 states. [2018-12-09 19:09:59,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6821 states to 6821 states and 23055 transitions. [2018-12-09 19:09:59,165 INFO L78 Accepts]: Start accepts. Automaton has 6821 states and 23055 transitions. Word has length 102 [2018-12-09 19:09:59,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:59,165 INFO L480 AbstractCegarLoop]: Abstraction has 6821 states and 23055 transitions. [2018-12-09 19:09:59,165 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 19:09:59,165 INFO L276 IsEmpty]: Start isEmpty. Operand 6821 states and 23055 transitions. [2018-12-09 19:09:59,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:59,171 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:59,171 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] [2018-12-09 19:09:59,171 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:59,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:59,172 INFO L82 PathProgramCache]: Analyzing trace with hash 791009209, now seen corresponding path program 1 times [2018-12-09 19:09:59,172 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:59,172 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:59,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:59,173 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:59,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:59,257 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 19:09:59,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:59,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 19:09:59,258 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:59,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 19:09:59,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 19:09:59,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 19:09:59,258 INFO L87 Difference]: Start difference. First operand 6821 states and 23055 transitions. Second operand 6 states. [2018-12-09 19:09:59,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:59,342 INFO L93 Difference]: Finished difference Result 7165 states and 23925 transitions. [2018-12-09 19:09:59,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 19:09:59,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 19:09:59,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:59,350 INFO L225 Difference]: With dead ends: 7165 [2018-12-09 19:09:59,351 INFO L226 Difference]: Without dead ends: 7085 [2018-12-09 19:09:59,351 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 19:09:59,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7085 states. [2018-12-09 19:09:59,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7085 to 6789. [2018-12-09 19:09:59,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6789 states. [2018-12-09 19:09:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6789 states to 6789 states and 22927 transitions. [2018-12-09 19:09:59,423 INFO L78 Accepts]: Start accepts. Automaton has 6789 states and 22927 transitions. Word has length 102 [2018-12-09 19:09:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:59,423 INFO L480 AbstractCegarLoop]: Abstraction has 6789 states and 22927 transitions. [2018-12-09 19:09:59,423 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 19:09:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 6789 states and 22927 transitions. [2018-12-09 19:09:59,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:59,429 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:59,430 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] [2018-12-09 19:09:59,430 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:59,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:59,430 INFO L82 PathProgramCache]: Analyzing trace with hash 342312570, now seen corresponding path program 3 times [2018-12-09 19:09:59,430 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:59,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:59,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 19:09:59,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:59,431 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 19:09:59,519 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 19:09:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 19:09:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 19:09:59,520 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 19:09:59,520 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 19:09:59,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 19:09:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 19:09:59,520 INFO L87 Difference]: Start difference. First operand 6789 states and 22927 transitions. Second operand 12 states. [2018-12-09 19:09:59,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 19:09:59,865 INFO L93 Difference]: Finished difference Result 13177 states and 44650 transitions. [2018-12-09 19:09:59,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 19:09:59,865 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 19:09:59,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 19:09:59,876 INFO L225 Difference]: With dead ends: 13177 [2018-12-09 19:09:59,876 INFO L226 Difference]: Without dead ends: 9273 [2018-12-09 19:09:59,877 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 19:09:59,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9273 states. [2018-12-09 19:09:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9273 to 8665. [2018-12-09 19:09:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8665 states. [2018-12-09 19:09:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8665 states to 8665 states and 28570 transitions. [2018-12-09 19:09:59,963 INFO L78 Accepts]: Start accepts. Automaton has 8665 states and 28570 transitions. Word has length 102 [2018-12-09 19:09:59,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 19:09:59,964 INFO L480 AbstractCegarLoop]: Abstraction has 8665 states and 28570 transitions. [2018-12-09 19:09:59,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 19:09:59,964 INFO L276 IsEmpty]: Start isEmpty. Operand 8665 states and 28570 transitions. [2018-12-09 19:09:59,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 19:09:59,971 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 19:09:59,971 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] [2018-12-09 19:09:59,972 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 19:09:59,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 19:09:59,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1540221632, now seen corresponding path program 4 times [2018-12-09 19:09:59,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 19:09:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:59,973 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 19:09:59,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 19:09:59,973 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 19:09:59,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:09:59,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 19:10:00,016 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 19:10:00,110 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 19:10:00,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:10:00 BasicIcfg [2018-12-09 19:10:00,111 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 19:10:00,111 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 19:10:00,111 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 19:10:00,111 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 19:10:00,112 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:09:06" (3/4) ... [2018-12-09 19:10:00,113 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 19:10:00,206 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f5755fb9-6ef2-4e21-afed-77529abbb09c/bin-2019/utaipan/witness.graphml [2018-12-09 19:10:00,206 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 19:10:00,207 INFO L168 Benchmark]: Toolchain (without parser) took 54605.44 ms. Allocated memory was 1.0 GB in the beginning and 7.2 GB in the end (delta: 6.1 GB). Free memory was 947.0 MB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.9 GB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,207 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 19:10:00,208 INFO L168 Benchmark]: CACSL2BoogieTranslator took 328.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,208 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.41 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,208 INFO L168 Benchmark]: Boogie Preprocessor took 25.07 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,208 INFO L168 Benchmark]: RCFGBuilder took 334.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,208 INFO L168 Benchmark]: TraceAbstraction took 53788.93 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,208 INFO L168 Benchmark]: Witness Printer took 94.74 ms. Allocated memory is still 7.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 MB. Max. memory is 11.5 GB. [2018-12-09 19:10:00,209 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 328.20 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 108.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 34.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.41 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.07 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.30 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 48.8 MB). Peak memory consumption was 48.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 53788.93 ms. Allocated memory was 1.1 GB in the beginning and 7.2 GB in the end (delta: 6.0 GB). Free memory was 1.0 GB in the beginning and 4.2 GB in the end (delta: -3.2 GB). Peak memory consumption was 2.8 GB. Max. memory is 11.5 GB. * Witness Printer took 94.74 ms. Allocated memory is still 7.2 GB. Free memory was 4.2 GB in the beginning and 4.2 GB in the end (delta: 36.9 MB). Peak memory consumption was 36.9 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_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1509; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1509, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1510; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1510, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1511; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1511, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 53.7s OverallTime, 29 OverallIterations, 1 TraceHistogramMax, 11.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6225 SDtfs, 6312 SDslu, 13845 SDs, 0 SdLazy, 4210 SolverSat, 275 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 274 GetRequests, 83 SyntacticMatches, 17 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=186422occurred in iteration=3, 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: 24.7s AutomataMinimizationTime, 28 MinimizatonAttempts, 279645 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2592 NumberOfCodeBlocks, 2592 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2462 ConstructedInterpolants, 0 QuantifiedInterpolants, 535169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...