./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/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 24849c867d7852f51047e765a239b7226a0f0861 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-03 06:34:19,201 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 06:34:19,202 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 06:34:19,208 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 06:34:19,208 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 06:34:19,209 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 06:34:19,210 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 06:34:19,210 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 06:34:19,211 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 06:34:19,212 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 06:34:19,212 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 06:34:19,212 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 06:34:19,213 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 06:34:19,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 06:34:19,214 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 06:34:19,214 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 06:34:19,215 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 06:34:19,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 06:34:19,216 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 06:34:19,217 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 06:34:19,218 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 06:34:19,218 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 06:34:19,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 06:34:19,220 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 06:34:19,220 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 06:34:19,220 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 06:34:19,221 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 06:34:19,221 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 06:34:19,222 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 06:34:19,222 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 06:34:19,222 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 06:34:19,223 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 06:34:19,223 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 06:34:19,223 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 06:34:19,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 06:34:19,224 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 06:34:19,224 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-03 06:34:19,231 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 06:34:19,231 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 06:34:19,232 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 06:34:19,232 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 06:34:19,232 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 06:34:19,232 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 06:34:19,232 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 06:34:19,232 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 06:34:19,233 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 06:34:19,233 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 06:34:19,233 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 06:34:19,233 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 06:34:19,233 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 06:34:19,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 06:34:19,234 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-03 06:34:19,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 06:34:19,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 06:34:19,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 06:34:19,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 06:34:19,235 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 06:34:19,235 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 06:34:19,235 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 06:34:19,235 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 06:34:19,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 06:34:19,236 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 06:34:19,236 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 06:34:19,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 06:34:19,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 06:34:19,236 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 06:34:19,236 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_f17289e7-0309-4d4e-9fa6-b837f27d59fc/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 -> 24849c867d7852f51047e765a239b7226a0f0861 [2018-12-03 06:34:19,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 06:34:19,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 06:34:19,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 06:34:19,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 06:34:19,263 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 06:34:19,264 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/safe031_power.opt_false-unreach-call.i [2018-12-03 06:34:19,300 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/data/cf948c459/66934bff59d34c4f855d7933ae08a7e7/FLAG17e220006 [2018-12-03 06:34:19,717 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 06:34:19,718 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/sv-benchmarks/c/pthread-wmm/safe031_power.opt_false-unreach-call.i [2018-12-03 06:34:19,724 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/data/cf948c459/66934bff59d34c4f855d7933ae08a7e7/FLAG17e220006 [2018-12-03 06:34:19,733 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/data/cf948c459/66934bff59d34c4f855d7933ae08a7e7 [2018-12-03 06:34:19,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 06:34:19,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 06:34:19,736 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 06:34:19,736 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 06:34:19,738 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 06:34:19,739 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:34:19" (1/1) ... [2018-12-03 06:34:19,740 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@159e01e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:19, skipping insertion in model container [2018-12-03 06:34:19,740 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 06:34:19" (1/1) ... [2018-12-03 06:34:19,744 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 06:34:19,765 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 06:34:19,948 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:34:19,956 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 06:34:20,027 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 06:34:20,056 INFO L195 MainTranslator]: Completed translation [2018-12-03 06:34:20,056 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20 WrapperNode [2018-12-03 06:34:20,056 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 06:34:20,057 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 06:34:20,057 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 06:34:20,057 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 06:34:20,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,072 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 06:34:20,089 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 06:34:20,089 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 06:34:20,089 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 06:34:20,095 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,095 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,097 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,098 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,105 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,106 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... [2018-12-03 06:34:20,109 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 06:34:20,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 06:34:20,110 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 06:34:20,110 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 06:34:20,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/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-03 06:34:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-03 06:34:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-03 06:34:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-03 06:34:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-03 06:34:20,141 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-03 06:34:20,141 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-03 06:34:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-03 06:34:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-03 06:34:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-03 06:34:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-03 06:34:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-03 06:34:20,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 06:34:20,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 06:34:20,143 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-03 06:34:20,448 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 06:34:20,448 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-03 06:34:20,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:20 BoogieIcfgContainer [2018-12-03 06:34:20,449 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 06:34:20,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 06:34:20,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 06:34:20,452 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 06:34:20,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 06:34:19" (1/3) ... [2018-12-03 06:34:20,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd3964d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:34:20, skipping insertion in model container [2018-12-03 06:34:20,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 06:34:20" (2/3) ... [2018-12-03 06:34:20,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bd3964d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 06:34:20, skipping insertion in model container [2018-12-03 06:34:20,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:20" (3/3) ... [2018-12-03 06:34:20,454 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.opt_false-unreach-call.i [2018-12-03 06:34:20,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,485 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,485 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,486 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,486 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,487 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,487 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,487 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,487 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,487 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,487 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,488 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,489 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,490 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,491 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,492 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,492 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,493 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,494 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,495 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,496 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,497 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,498 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-03 06:34:20,503 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-03 06:34:20,503 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 06:34:20,510 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-03 06:34:20,523 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-03 06:34:20,539 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 06:34:20,539 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 06:34:20,540 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 06:34:20,540 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 06:34:20,540 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 06:34:20,540 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 06:34:20,540 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 06:34:20,540 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 06:34:20,547 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-03 06:34:35,106 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-03 06:34:35,107 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-03 06:34:35,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-03 06:34:35,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:34:35,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 06:34:35,116 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:34:35,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:34:35,119 INFO L82 PathProgramCache]: Analyzing trace with hash 961127934, now seen corresponding path program 1 times [2018-12-03 06:34:35,121 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:34:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:34:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:35,155 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:34:35,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:34:35,274 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-03 06:34:35,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:34:35,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:34:35,276 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:34:35,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:34:35,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:34:35,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:34:35,289 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-03 06:34:36,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:34:36,759 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-03 06:34:36,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:34:36,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-03 06:34:36,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:34:37,585 INFO L225 Difference]: With dead ends: 233472 [2018-12-03 06:34:37,586 INFO L226 Difference]: Without dead ends: 203722 [2018-12-03 06:34:37,587 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-03 06:34:40,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-03 06:34:42,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-03 06:34:42,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-03 06:34:42,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-03 06:34:42,737 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-03 06:34:42,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:34:42,738 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-03 06:34:42,738 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:34:42,738 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-03 06:34:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 06:34:42,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:34:42,745 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-03 06:34:42,745 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:34:42,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:34:42,746 INFO L82 PathProgramCache]: Analyzing trace with hash -94457539, now seen corresponding path program 1 times [2018-12-03 06:34:42,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:34:42,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:42,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:34:42,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:42,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:34:42,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:34:42,782 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-03 06:34:42,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:34:42,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:34:42,782 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:34:42,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:34:42,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:34:42,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:34:42,784 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-03 06:34:43,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:34:43,350 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-03 06:34:43,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:34:43,351 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-03 06:34:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:34:44,148 INFO L225 Difference]: With dead ends: 118892 [2018-12-03 06:34:44,148 INFO L226 Difference]: Without dead ends: 118892 [2018-12-03 06:34:44,149 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-03 06:34:44,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-03 06:34:48,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-03 06:34:48,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-03 06:34:48,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-03 06:34:48,566 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-03 06:34:48,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:34:48,566 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-03 06:34:48,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:34:48,567 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-03 06:34:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-03 06:34:48,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:34:48,570 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-03 06:34:48,570 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:34:48,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:34:48,571 INFO L82 PathProgramCache]: Analyzing trace with hash -1901912002, now seen corresponding path program 1 times [2018-12-03 06:34:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:34:48,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:48,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:34:48,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:48,573 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:34:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:34:48,619 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-03 06:34:48,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:34:48,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:34:48,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:34:48,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:34:48,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:34:48,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:34:48,620 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-03 06:34:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:34:50,562 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-03 06:34:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:34:50,563 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-03 06:34:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:34:51,387 INFO L225 Difference]: With dead ends: 325272 [2018-12-03 06:34:51,387 INFO L226 Difference]: Without dead ends: 324272 [2018-12-03 06:34:51,387 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-03 06:34:52,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-03 06:34:55,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-03 06:34:55,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-03 06:34:56,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-03 06:34:56,313 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-03 06:34:56,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:34:56,314 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-03 06:34:56,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:34:56,314 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-03 06:34:56,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-03 06:34:56,319 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:34:56,319 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-03 06:34:56,320 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:34:56,320 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:34:56,320 INFO L82 PathProgramCache]: Analyzing trace with hash 945118259, now seen corresponding path program 1 times [2018-12-03 06:34:56,320 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:34:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:56,322 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:34:56,322 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:34:56,322 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:34:56,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:34:56,360 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-03 06:34:56,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:34:56,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:34:56,360 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:34:56,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:34:56,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:34:56,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:34:56,361 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 4 states. [2018-12-03 06:34:58,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:34:58,721 INFO L93 Difference]: Finished difference Result 163598 states and 725472 transitions. [2018-12-03 06:34:58,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:34:58,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2018-12-03 06:34:58,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:34:59,127 INFO L225 Difference]: With dead ends: 163598 [2018-12-03 06:34:59,127 INFO L226 Difference]: Without dead ends: 160993 [2018-12-03 06:34:59,128 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-03 06:34:59,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160993 states. [2018-12-03 06:35:01,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160993 to 160993. [2018-12-03 06:35:01,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160993 states. [2018-12-03 06:35:02,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160993 states to 160993 states and 716800 transitions. [2018-12-03 06:35:02,292 INFO L78 Accepts]: Start accepts. Automaton has 160993 states and 716800 transitions. Word has length 51 [2018-12-03 06:35:02,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:02,292 INFO L480 AbstractCegarLoop]: Abstraction has 160993 states and 716800 transitions. [2018-12-03 06:35:02,292 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:35:02,292 INFO L276 IsEmpty]: Start isEmpty. Operand 160993 states and 716800 transitions. [2018-12-03 06:35:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-12-03 06:35:02,297 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:02,297 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-03 06:35:02,297 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:02,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:02,298 INFO L82 PathProgramCache]: Analyzing trace with hash -1724507505, now seen corresponding path program 1 times [2018-12-03 06:35:02,298 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:02,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:02,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:02,299 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:02,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:02,345 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-03 06:35:02,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:02,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:35:02,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:02,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:35:02,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:35:02,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:35:02,346 INFO L87 Difference]: Start difference. First operand 160993 states and 716800 transitions. Second operand 5 states. [2018-12-03 06:35:02,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:02,553 INFO L93 Difference]: Finished difference Result 51405 states and 209121 transitions. [2018-12-03 06:35:02,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:35:02,553 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 52 [2018-12-03 06:35:02,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:02,648 INFO L225 Difference]: With dead ends: 51405 [2018-12-03 06:35:02,648 INFO L226 Difference]: Without dead ends: 49093 [2018-12-03 06:35:02,648 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-03 06:35:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49093 states. [2018-12-03 06:35:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49093 to 49093. [2018-12-03 06:35:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49093 states. [2018-12-03 06:35:03,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49093 states to 49093 states and 200467 transitions. [2018-12-03 06:35:03,772 INFO L78 Accepts]: Start accepts. Automaton has 49093 states and 200467 transitions. Word has length 52 [2018-12-03 06:35:03,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:03,772 INFO L480 AbstractCegarLoop]: Abstraction has 49093 states and 200467 transitions. [2018-12-03 06:35:03,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:35:03,772 INFO L276 IsEmpty]: Start isEmpty. Operand 49093 states and 200467 transitions. [2018-12-03 06:35:03,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:35:03,779 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:03,780 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-03 06:35:03,780 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:03,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:03,780 INFO L82 PathProgramCache]: Analyzing trace with hash 206449116, now seen corresponding path program 1 times [2018-12-03 06:35:03,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:03,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:03,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:03,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:03,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:03,831 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-03 06:35:03,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:03,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:35:03,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:03,832 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:35:03,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:35:03,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:35:03,832 INFO L87 Difference]: Start difference. First operand 49093 states and 200467 transitions. Second operand 4 states. [2018-12-03 06:35:04,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:04,179 INFO L93 Difference]: Finished difference Result 70361 states and 282256 transitions. [2018-12-03 06:35:04,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:35:04,180 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2018-12-03 06:35:04,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:04,317 INFO L225 Difference]: With dead ends: 70361 [2018-12-03 06:35:04,318 INFO L226 Difference]: Without dead ends: 70361 [2018-12-03 06:35:04,318 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-03 06:35:04,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70361 states. [2018-12-03 06:35:05,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70361 to 53657. [2018-12-03 06:35:05,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53657 states. [2018-12-03 06:35:05,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53657 states to 53657 states and 217408 transitions. [2018-12-03 06:35:05,201 INFO L78 Accepts]: Start accepts. Automaton has 53657 states and 217408 transitions. Word has length 65 [2018-12-03 06:35:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:05,202 INFO L480 AbstractCegarLoop]: Abstraction has 53657 states and 217408 transitions. [2018-12-03 06:35:05,202 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:35:05,202 INFO L276 IsEmpty]: Start isEmpty. Operand 53657 states and 217408 transitions. [2018-12-03 06:35:05,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:35:05,214 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:05,214 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-03 06:35:05,214 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:05,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:05,215 INFO L82 PathProgramCache]: Analyzing trace with hash 1949259451, now seen corresponding path program 1 times [2018-12-03 06:35:05,215 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:05,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:05,216 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:05,216 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:05,216 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:05,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:05,295 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-03 06:35:05,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:05,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:35:05,295 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:05,295 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:35:05,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:35:05,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:35:05,296 INFO L87 Difference]: Start difference. First operand 53657 states and 217408 transitions. Second operand 6 states. [2018-12-03 06:35:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:05,601 INFO L93 Difference]: Finished difference Result 69863 states and 278244 transitions. [2018-12-03 06:35:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:35:05,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 06:35:05,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:05,739 INFO L225 Difference]: With dead ends: 69863 [2018-12-03 06:35:05,739 INFO L226 Difference]: Without dead ends: 69863 [2018-12-03 06:35:05,739 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:35:05,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69863 states. [2018-12-03 06:35:06,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69863 to 50543. [2018-12-03 06:35:06,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50543 states. [2018-12-03 06:35:06,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50543 states to 50543 states and 197926 transitions. [2018-12-03 06:35:06,672 INFO L78 Accepts]: Start accepts. Automaton has 50543 states and 197926 transitions. Word has length 65 [2018-12-03 06:35:06,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:06,672 INFO L480 AbstractCegarLoop]: Abstraction has 50543 states and 197926 transitions. [2018-12-03 06:35:06,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:35:06,673 INFO L276 IsEmpty]: Start isEmpty. Operand 50543 states and 197926 transitions. [2018-12-03 06:35:06,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-03 06:35:06,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:06,681 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-03 06:35:06,681 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:06,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:06,682 INFO L82 PathProgramCache]: Analyzing trace with hash 446628473, now seen corresponding path program 1 times [2018-12-03 06:35:06,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:06,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:06,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:06,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:06,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:06,732 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-03 06:35:06,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:06,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:35:06,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:06,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:35:06,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:35:06,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:35:06,733 INFO L87 Difference]: Start difference. First operand 50543 states and 197926 transitions. Second operand 6 states. [2018-12-03 06:35:07,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:07,248 INFO L93 Difference]: Finished difference Result 73903 states and 287302 transitions. [2018-12-03 06:35:07,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:35:07,249 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-03 06:35:07,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:07,391 INFO L225 Difference]: With dead ends: 73903 [2018-12-03 06:35:07,392 INFO L226 Difference]: Without dead ends: 73743 [2018-12-03 06:35:07,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2018-12-03 06:35:07,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73743 states. [2018-12-03 06:35:08,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73743 to 56927. [2018-12-03 06:35:08,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56927 states. [2018-12-03 06:35:08,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56927 states to 56927 states and 222382 transitions. [2018-12-03 06:35:08,341 INFO L78 Accepts]: Start accepts. Automaton has 56927 states and 222382 transitions. Word has length 65 [2018-12-03 06:35:08,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:08,342 INFO L480 AbstractCegarLoop]: Abstraction has 56927 states and 222382 transitions. [2018-12-03 06:35:08,342 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:35:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 56927 states and 222382 transitions. [2018-12-03 06:35:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-12-03 06:35:08,381 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:08,381 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] [2018-12-03 06:35:08,381 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:08,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash -556747794, now seen corresponding path program 1 times [2018-12-03 06:35:08,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:08,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:08,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:08,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:08,444 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-03 06:35:08,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:08,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-03 06:35:08,444 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:08,444 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-03 06:35:08,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-03 06:35:08,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:35:08,445 INFO L87 Difference]: Start difference. First operand 56927 states and 222382 transitions. Second operand 8 states. [2018-12-03 06:35:09,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:09,324 INFO L93 Difference]: Finished difference Result 82751 states and 317486 transitions. [2018-12-03 06:35:09,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:35:09,325 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2018-12-03 06:35:09,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:09,482 INFO L225 Difference]: With dead ends: 82751 [2018-12-03 06:35:09,482 INFO L226 Difference]: Without dead ends: 82431 [2018-12-03 06:35:09,483 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2018-12-03 06:35:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82431 states. [2018-12-03 06:35:10,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82431 to 63231. [2018-12-03 06:35:10,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63231 states. [2018-12-03 06:35:10,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63231 states to 63231 states and 246510 transitions. [2018-12-03 06:35:10,512 INFO L78 Accepts]: Start accepts. Automaton has 63231 states and 246510 transitions. Word has length 79 [2018-12-03 06:35:10,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:10,512 INFO L480 AbstractCegarLoop]: Abstraction has 63231 states and 246510 transitions. [2018-12-03 06:35:10,512 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-03 06:35:10,512 INFO L276 IsEmpty]: Start isEmpty. Operand 63231 states and 246510 transitions. [2018-12-03 06:35:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-03 06:35:10,555 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:10,555 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] [2018-12-03 06:35:10,555 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:10,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:10,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1400165598, now seen corresponding path program 1 times [2018-12-03 06:35:10,556 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:10,557 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:10,586 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-03 06:35:10,586 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:10,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:35:10,587 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:10,587 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:35:10,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:35:10,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:35:10,587 INFO L87 Difference]: Start difference. First operand 63231 states and 246510 transitions. Second operand 3 states. [2018-12-03 06:35:10,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:10,866 INFO L93 Difference]: Finished difference Result 75471 states and 289334 transitions. [2018-12-03 06:35:10,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:35:10,866 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2018-12-03 06:35:10,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:11,012 INFO L225 Difference]: With dead ends: 75471 [2018-12-03 06:35:11,012 INFO L226 Difference]: Without dead ends: 75471 [2018-12-03 06:35:11,012 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-03 06:35:11,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75471 states. [2018-12-03 06:35:11,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75471 to 65887. [2018-12-03 06:35:11,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65887 states. [2018-12-03 06:35:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65887 states to 65887 states and 255230 transitions. [2018-12-03 06:35:12,086 INFO L78 Accepts]: Start accepts. Automaton has 65887 states and 255230 transitions. Word has length 81 [2018-12-03 06:35:12,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:12,087 INFO L480 AbstractCegarLoop]: Abstraction has 65887 states and 255230 transitions. [2018-12-03 06:35:12,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:35:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 65887 states and 255230 transitions. [2018-12-03 06:35:12,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 06:35:12,135 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:12,135 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] [2018-12-03 06:35:12,135 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:12,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:12,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1789928405, now seen corresponding path program 1 times [2018-12-03 06:35:12,135 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:12,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:12,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:12,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:12,137 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:12,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:12,165 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-03 06:35:12,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:12,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:35:12,166 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:12,166 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:35:12,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:35:12,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:35:12,166 INFO L87 Difference]: Start difference. First operand 65887 states and 255230 transitions. Second operand 4 states. [2018-12-03 06:35:12,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:12,722 INFO L93 Difference]: Finished difference Result 104783 states and 399910 transitions. [2018-12-03 06:35:12,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:35:12,723 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-03 06:35:12,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:12,936 INFO L225 Difference]: With dead ends: 104783 [2018-12-03 06:35:12,936 INFO L226 Difference]: Without dead ends: 104047 [2018-12-03 06:35:12,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 06:35:13,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104047 states. [2018-12-03 06:35:14,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104047 to 86671. [2018-12-03 06:35:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86671 states. [2018-12-03 06:35:14,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86671 states to 86671 states and 334294 transitions. [2018-12-03 06:35:14,515 INFO L78 Accepts]: Start accepts. Automaton has 86671 states and 334294 transitions. Word has length 85 [2018-12-03 06:35:14,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:14,515 INFO L480 AbstractCegarLoop]: Abstraction has 86671 states and 334294 transitions. [2018-12-03 06:35:14,515 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:35:14,516 INFO L276 IsEmpty]: Start isEmpty. Operand 86671 states and 334294 transitions. [2018-12-03 06:35:14,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 06:35:14,588 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:14,588 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] [2018-12-03 06:35:14,588 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:14,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:14,588 INFO L82 PathProgramCache]: Analyzing trace with hash -545163924, now seen corresponding path program 1 times [2018-12-03 06:35:14,588 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:14,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:14,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:14,589 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:14,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:35:14,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:14,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:35:14,649 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:14,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:35:14,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:35:14,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:35:14,649 INFO L87 Difference]: Start difference. First operand 86671 states and 334294 transitions. Second operand 4 states. [2018-12-03 06:35:15,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:15,169 INFO L93 Difference]: Finished difference Result 102911 states and 393006 transitions. [2018-12-03 06:35:15,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:35:15,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-03 06:35:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:15,382 INFO L225 Difference]: With dead ends: 102911 [2018-12-03 06:35:15,382 INFO L226 Difference]: Without dead ends: 102911 [2018-12-03 06:35:15,383 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-03 06:35:15,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102911 states. [2018-12-03 06:35:16,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102911 to 86927. [2018-12-03 06:35:16,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86927 states. [2018-12-03 06:35:16,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86927 states to 86927 states and 335030 transitions. [2018-12-03 06:35:16,796 INFO L78 Accepts]: Start accepts. Automaton has 86927 states and 335030 transitions. Word has length 85 [2018-12-03 06:35:16,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:16,796 INFO L480 AbstractCegarLoop]: Abstraction has 86927 states and 335030 transitions. [2018-12-03 06:35:16,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:35:16,796 INFO L276 IsEmpty]: Start isEmpty. Operand 86927 states and 335030 transitions. [2018-12-03 06:35:16,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-03 06:35:16,869 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:16,870 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] [2018-12-03 06:35:16,870 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:16,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:16,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1389635795, now seen corresponding path program 1 times [2018-12-03 06:35:16,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:16,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:16,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:16,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:16,871 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:17,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 06:35:17,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:17,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:35:17,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:17,123 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:35:17,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:35:17,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:35:17,123 INFO L87 Difference]: Start difference. First operand 86927 states and 335030 transitions. Second operand 6 states. [2018-12-03 06:35:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:17,211 INFO L93 Difference]: Finished difference Result 13839 states and 46630 transitions. [2018-12-03 06:35:17,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:35:17,211 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-03 06:35:17,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:17,227 INFO L225 Difference]: With dead ends: 13839 [2018-12-03 06:35:17,227 INFO L226 Difference]: Without dead ends: 12511 [2018-12-03 06:35:17,228 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-03 06:35:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12511 states. [2018-12-03 06:35:17,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12511 to 12221. [2018-12-03 06:35:17,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12221 states. [2018-12-03 06:35:17,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12221 states to 12221 states and 41141 transitions. [2018-12-03 06:35:17,357 INFO L78 Accepts]: Start accepts. Automaton has 12221 states and 41141 transitions. Word has length 85 [2018-12-03 06:35:17,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:17,357 INFO L480 AbstractCegarLoop]: Abstraction has 12221 states and 41141 transitions. [2018-12-03 06:35:17,357 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:35:17,357 INFO L276 IsEmpty]: Start isEmpty. Operand 12221 states and 41141 transitions. [2018-12-03 06:35:17,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:17,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:17,368 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-03 06:35:17,368 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:17,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:17,369 INFO L82 PathProgramCache]: Analyzing trace with hash -754447379, now seen corresponding path program 1 times [2018-12-03 06:35:17,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:17,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:17,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:17,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:17,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:17,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:17,400 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-03 06:35:17,400 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:17,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 06:35:17,400 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:17,400 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 06:35:17,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 06:35:17,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 06:35:17,401 INFO L87 Difference]: Start difference. First operand 12221 states and 41141 transitions. Second operand 3 states. [2018-12-03 06:35:17,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:17,495 INFO L93 Difference]: Finished difference Result 12641 states and 42292 transitions. [2018-12-03 06:35:17,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 06:35:17,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2018-12-03 06:35:17,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:17,511 INFO L225 Difference]: With dead ends: 12641 [2018-12-03 06:35:17,511 INFO L226 Difference]: Without dead ends: 12641 [2018-12-03 06:35:17,511 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-03 06:35:17,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12641 states. [2018-12-03 06:35:17,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12641 to 12411. [2018-12-03 06:35:17,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12411 states. [2018-12-03 06:35:17,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12411 states to 12411 states and 41663 transitions. [2018-12-03 06:35:17,640 INFO L78 Accepts]: Start accepts. Automaton has 12411 states and 41663 transitions. Word has length 100 [2018-12-03 06:35:17,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:17,640 INFO L480 AbstractCegarLoop]: Abstraction has 12411 states and 41663 transitions. [2018-12-03 06:35:17,640 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 06:35:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 12411 states and 41663 transitions. [2018-12-03 06:35:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:17,650 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:17,650 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-03 06:35:17,651 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:17,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:17,651 INFO L82 PathProgramCache]: Analyzing trace with hash 1181212908, now seen corresponding path program 1 times [2018-12-03 06:35:17,651 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:17,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:17,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:17,652 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:17,725 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-03 06:35:17,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:17,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:35:17,726 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:17,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:35:17,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:35:17,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:35:17,726 INFO L87 Difference]: Start difference. First operand 12411 states and 41663 transitions. Second operand 7 states. [2018-12-03 06:35:17,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:17,922 INFO L93 Difference]: Finished difference Result 16653 states and 55152 transitions. [2018-12-03 06:35:17,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:35:17,922 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-03 06:35:17,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:17,941 INFO L225 Difference]: With dead ends: 16653 [2018-12-03 06:35:17,941 INFO L226 Difference]: Without dead ends: 16653 [2018-12-03 06:35:17,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:35:17,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16653 states. [2018-12-03 06:35:18,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16653 to 13131. [2018-12-03 06:35:18,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13131 states. [2018-12-03 06:35:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13131 states to 13131 states and 43804 transitions. [2018-12-03 06:35:18,086 INFO L78 Accepts]: Start accepts. Automaton has 13131 states and 43804 transitions. Word has length 100 [2018-12-03 06:35:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:18,087 INFO L480 AbstractCegarLoop]: Abstraction has 13131 states and 43804 transitions. [2018-12-03 06:35:18,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:35:18,087 INFO L276 IsEmpty]: Start isEmpty. Operand 13131 states and 43804 transitions. [2018-12-03 06:35:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:18,097 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:18,097 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-03 06:35:18,098 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:18,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:18,098 INFO L82 PathProgramCache]: Analyzing trace with hash 258529325, now seen corresponding path program 1 times [2018-12-03 06:35:18,098 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:18,099 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:18,099 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:18,099 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:18,130 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-03 06:35:18,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:18,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:35:18,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:18,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:35:18,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:35:18,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:35:18,131 INFO L87 Difference]: Start difference. First operand 13131 states and 43804 transitions. Second operand 4 states. [2018-12-03 06:35:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:18,301 INFO L93 Difference]: Finished difference Result 16826 states and 54990 transitions. [2018-12-03 06:35:18,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 06:35:18,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 06:35:18,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:18,328 INFO L225 Difference]: With dead ends: 16826 [2018-12-03 06:35:18,328 INFO L226 Difference]: Without dead ends: 16826 [2018-12-03 06:35:18,328 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-03 06:35:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16826 states. [2018-12-03 06:35:18,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16826 to 14534. [2018-12-03 06:35:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14534 states. [2018-12-03 06:35:18,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14534 states to 14534 states and 48040 transitions. [2018-12-03 06:35:18,495 INFO L78 Accepts]: Start accepts. Automaton has 14534 states and 48040 transitions. Word has length 100 [2018-12-03 06:35:18,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:18,495 INFO L480 AbstractCegarLoop]: Abstraction has 14534 states and 48040 transitions. [2018-12-03 06:35:18,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:35:18,495 INFO L276 IsEmpty]: Start isEmpty. Operand 14534 states and 48040 transitions. [2018-12-03 06:35:18,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:18,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:18,507 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-03 06:35:18,507 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:18,507 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash -33161956, now seen corresponding path program 2 times [2018-12-03 06:35:18,507 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:18,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:18,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:18,508 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:18,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:18,538 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-03 06:35:18,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:18,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-03 06:35:18,538 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:18,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 06:35:18,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 06:35:18,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:35:18,539 INFO L87 Difference]: Start difference. First operand 14534 states and 48040 transitions. Second operand 4 states. [2018-12-03 06:35:18,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:18,643 INFO L93 Difference]: Finished difference Result 16805 states and 54939 transitions. [2018-12-03 06:35:18,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 06:35:18,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-03 06:35:18,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:18,662 INFO L225 Difference]: With dead ends: 16805 [2018-12-03 06:35:18,662 INFO L226 Difference]: Without dead ends: 16805 [2018-12-03 06:35:18,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 06:35:18,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16805 states. [2018-12-03 06:35:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16805 to 14634. [2018-12-03 06:35:18,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14634 states. [2018-12-03 06:35:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14634 states to 14634 states and 48360 transitions. [2018-12-03 06:35:18,813 INFO L78 Accepts]: Start accepts. Automaton has 14634 states and 48360 transitions. Word has length 100 [2018-12-03 06:35:18,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:18,814 INFO L480 AbstractCegarLoop]: Abstraction has 14634 states and 48360 transitions. [2018-12-03 06:35:18,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 06:35:18,814 INFO L276 IsEmpty]: Start isEmpty. Operand 14634 states and 48360 transitions. [2018-12-03 06:35:18,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:18,825 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:18,825 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-03 06:35:18,825 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:18,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:18,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1767525111, now seen corresponding path program 2 times [2018-12-03 06:35:18,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:18,826 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:35:18,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:18,826 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:18,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:18,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-03 06:35:18,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:18,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:35:18,870 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:18,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:35:18,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:35:18,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:35:18,870 INFO L87 Difference]: Start difference. First operand 14634 states and 48360 transitions. Second operand 5 states. [2018-12-03 06:35:19,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:19,005 INFO L93 Difference]: Finished difference Result 18309 states and 59620 transitions. [2018-12-03 06:35:19,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:35:19,006 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-03 06:35:19,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:19,025 INFO L225 Difference]: With dead ends: 18309 [2018-12-03 06:35:19,026 INFO L226 Difference]: Without dead ends: 18309 [2018-12-03 06:35:19,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-03 06:35:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18309 states. [2018-12-03 06:35:19,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18309 to 15154. [2018-12-03 06:35:19,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15154 states. [2018-12-03 06:35:19,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15154 states to 15154 states and 49846 transitions. [2018-12-03 06:35:19,196 INFO L78 Accepts]: Start accepts. Automaton has 15154 states and 49846 transitions. Word has length 100 [2018-12-03 06:35:19,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:19,196 INFO L480 AbstractCegarLoop]: Abstraction has 15154 states and 49846 transitions. [2018-12-03 06:35:19,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:35:19,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15154 states and 49846 transitions. [2018-12-03 06:35:19,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:19,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:19,210 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-03 06:35:19,210 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:19,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:19,210 INFO L82 PathProgramCache]: Analyzing trace with hash 1462038623, now seen corresponding path program 3 times [2018-12-03 06:35:19,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:19,211 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:35:19,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:19,211 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:19,264 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-03 06:35:19,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:19,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:35:19,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:19,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:35:19,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:35:19,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:35:19,265 INFO L87 Difference]: Start difference. First operand 15154 states and 49846 transitions. Second operand 6 states. [2018-12-03 06:35:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:19,421 INFO L93 Difference]: Finished difference Result 13883 states and 45643 transitions. [2018-12-03 06:35:19,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:35:19,421 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 06:35:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:19,437 INFO L225 Difference]: With dead ends: 13883 [2018-12-03 06:35:19,437 INFO L226 Difference]: Without dead ends: 13883 [2018-12-03 06:35:19,437 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-03 06:35:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13883 states. [2018-12-03 06:35:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13883 to 13347. [2018-12-03 06:35:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13347 states. [2018-12-03 06:35:19,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13347 states to 13347 states and 44057 transitions. [2018-12-03 06:35:19,579 INFO L78 Accepts]: Start accepts. Automaton has 13347 states and 44057 transitions. Word has length 100 [2018-12-03 06:35:19,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:19,579 INFO L480 AbstractCegarLoop]: Abstraction has 13347 states and 44057 transitions. [2018-12-03 06:35:19,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:35:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 13347 states and 44057 transitions. [2018-12-03 06:35:19,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-03 06:35:19,591 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:19,591 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-03 06:35:19,591 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:19,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:19,592 INFO L82 PathProgramCache]: Analyzing trace with hash -1912311358, now seen corresponding path program 1 times [2018-12-03 06:35:19,592 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:19,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:35:19,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:19,593 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:19,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:19,667 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-03 06:35:19,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:19,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:35:19,667 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:19,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:35:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:35:19,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:35:19,668 INFO L87 Difference]: Start difference. First operand 13347 states and 44057 transitions. Second operand 6 states. [2018-12-03 06:35:19,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:19,754 INFO L93 Difference]: Finished difference Result 12387 states and 40297 transitions. [2018-12-03 06:35:19,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 06:35:19,754 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-03 06:35:19,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:19,768 INFO L225 Difference]: With dead ends: 12387 [2018-12-03 06:35:19,768 INFO L226 Difference]: Without dead ends: 12387 [2018-12-03 06:35:19,768 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-03 06:35:19,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12387 states. [2018-12-03 06:35:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12387 to 10898. [2018-12-03 06:35:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10898 states. [2018-12-03 06:35:19,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10898 states to 10898 states and 35758 transitions. [2018-12-03 06:35:19,889 INFO L78 Accepts]: Start accepts. Automaton has 10898 states and 35758 transitions. Word has length 100 [2018-12-03 06:35:19,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:19,889 INFO L480 AbstractCegarLoop]: Abstraction has 10898 states and 35758 transitions. [2018-12-03 06:35:19,889 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:35:19,889 INFO L276 IsEmpty]: Start isEmpty. Operand 10898 states and 35758 transitions. [2018-12-03 06:35:19,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:19,897 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:19,898 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-03 06:35:19,898 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:19,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash 146502742, now seen corresponding path program 1 times [2018-12-03 06:35:19,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:19,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:19,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:19,899 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:19,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:19,951 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-03 06:35:19,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:19,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:35:19,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:19,952 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:35:19,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:35:19,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:35:19,952 INFO L87 Difference]: Start difference. First operand 10898 states and 35758 transitions. Second operand 7 states. [2018-12-03 06:35:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:20,249 INFO L93 Difference]: Finished difference Result 17450 states and 56082 transitions. [2018-12-03 06:35:20,249 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-03 06:35:20,249 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 06:35:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:20,266 INFO L225 Difference]: With dead ends: 17450 [2018-12-03 06:35:20,266 INFO L226 Difference]: Without dead ends: 17322 [2018-12-03 06:35:20,266 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-03 06:35:20,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17322 states. [2018-12-03 06:35:20,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17322 to 13226. [2018-12-03 06:35:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13226 states. [2018-12-03 06:35:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13226 states to 13226 states and 43196 transitions. [2018-12-03 06:35:20,414 INFO L78 Accepts]: Start accepts. Automaton has 13226 states and 43196 transitions. Word has length 102 [2018-12-03 06:35:20,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:20,414 INFO L480 AbstractCegarLoop]: Abstraction has 13226 states and 43196 transitions. [2018-12-03 06:35:20,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:35:20,414 INFO L276 IsEmpty]: Start isEmpty. Operand 13226 states and 43196 transitions. [2018-12-03 06:35:20,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:20,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:20,425 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-03 06:35:20,425 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:20,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:20,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1391267223, now seen corresponding path program 1 times [2018-12-03 06:35:20,425 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:20,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:20,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:20,426 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:20,514 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-03 06:35:20,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:20,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-03 06:35:20,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:20,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 06:35:20,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 06:35:20,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 06:35:20,515 INFO L87 Difference]: Start difference. First operand 13226 states and 43196 transitions. Second operand 6 states. [2018-12-03 06:35:20,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:20,643 INFO L93 Difference]: Finished difference Result 11648 states and 37693 transitions. [2018-12-03 06:35:20,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:35:20,643 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-03 06:35:20,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:20,655 INFO L225 Difference]: With dead ends: 11648 [2018-12-03 06:35:20,655 INFO L226 Difference]: Without dead ends: 11648 [2018-12-03 06:35:20,656 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-03 06:35:20,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11648 states. [2018-12-03 06:35:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11648 to 11098. [2018-12-03 06:35:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11098 states. [2018-12-03 06:35:20,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11098 states to 11098 states and 36208 transitions. [2018-12-03 06:35:20,764 INFO L78 Accepts]: Start accepts. Automaton has 11098 states and 36208 transitions. Word has length 102 [2018-12-03 06:35:20,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:20,765 INFO L480 AbstractCegarLoop]: Abstraction has 11098 states and 36208 transitions. [2018-12-03 06:35:20,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 06:35:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 11098 states and 36208 transitions. [2018-12-03 06:35:20,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:20,773 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:20,773 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-03 06:35:20,773 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:20,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:20,773 INFO L82 PathProgramCache]: Analyzing trace with hash 476268503, now seen corresponding path program 1 times [2018-12-03 06:35:20,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:20,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:20,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:20,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:20,828 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-03 06:35:20,828 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:20,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-03 06:35:20,829 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:20,829 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-03 06:35:20,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-03 06:35:20,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-03 06:35:20,829 INFO L87 Difference]: Start difference. First operand 11098 states and 36208 transitions. Second operand 5 states. [2018-12-03 06:35:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:20,961 INFO L93 Difference]: Finished difference Result 12890 states and 41968 transitions. [2018-12-03 06:35:20,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 06:35:20,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-03 06:35:20,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:20,975 INFO L225 Difference]: With dead ends: 12890 [2018-12-03 06:35:20,976 INFO L226 Difference]: Without dead ends: 12762 [2018-12-03 06:35:20,976 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-03 06:35:20,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12762 states. [2018-12-03 06:35:21,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12762 to 11290. [2018-12-03 06:35:21,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11290 states. [2018-12-03 06:35:21,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11290 states to 11290 states and 36768 transitions. [2018-12-03 06:35:21,096 INFO L78 Accepts]: Start accepts. Automaton has 11290 states and 36768 transitions. Word has length 102 [2018-12-03 06:35:21,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:21,096 INFO L480 AbstractCegarLoop]: Abstraction has 11290 states and 36768 transitions. [2018-12-03 06:35:21,096 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-03 06:35:21,096 INFO L276 IsEmpty]: Start isEmpty. Operand 11290 states and 36768 transitions. [2018-12-03 06:35:21,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:21,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:21,106 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-03 06:35:21,106 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:21,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:21,107 INFO L82 PathProgramCache]: Analyzing trace with hash 1721032984, now seen corresponding path program 1 times [2018-12-03 06:35:21,107 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:21,108 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:21,108 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:21,108 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:21,167 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-03 06:35:21,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:21,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:35:21,167 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:21,167 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:35:21,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:35:21,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:35:21,167 INFO L87 Difference]: Start difference. First operand 11290 states and 36768 transitions. Second operand 7 states. [2018-12-03 06:35:21,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:21,372 INFO L93 Difference]: Finished difference Result 21124 states and 69457 transitions. [2018-12-03 06:35:21,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-03 06:35:21,373 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 06:35:21,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:21,389 INFO L225 Difference]: With dead ends: 21124 [2018-12-03 06:35:21,389 INFO L226 Difference]: Without dead ends: 10660 [2018-12-03 06:35:21,389 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-03 06:35:21,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10660 states. [2018-12-03 06:35:21,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10660 to 10630. [2018-12-03 06:35:21,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10630 states. [2018-12-03 06:35:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10630 states to 10630 states and 34848 transitions. [2018-12-03 06:35:21,513 INFO L78 Accepts]: Start accepts. Automaton has 10630 states and 34848 transitions. Word has length 102 [2018-12-03 06:35:21,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:21,514 INFO L480 AbstractCegarLoop]: Abstraction has 10630 states and 34848 transitions. [2018-12-03 06:35:21,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:35:21,514 INFO L276 IsEmpty]: Start isEmpty. Operand 10630 states and 34848 transitions. [2018-12-03 06:35:21,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:21,522 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:21,522 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-03 06:35:21,522 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:21,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:21,522 INFO L82 PathProgramCache]: Analyzing trace with hash -538618986, now seen corresponding path program 2 times [2018-12-03 06:35:21,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:21,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:21,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:21,523 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:21,614 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-03 06:35:21,614 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:21,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-03 06:35:21,614 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:21,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 06:35:21,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 06:35:21,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-03 06:35:21,615 INFO L87 Difference]: Start difference. First operand 10630 states and 34848 transitions. Second operand 10 states. [2018-12-03 06:35:21,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:21,870 INFO L93 Difference]: Finished difference Result 18012 states and 59791 transitions. [2018-12-03 06:35:21,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-03 06:35:21,870 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-03 06:35:21,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:21,880 INFO L225 Difference]: With dead ends: 18012 [2018-12-03 06:35:21,880 INFO L226 Difference]: Without dead ends: 7461 [2018-12-03 06:35:21,880 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-12-03 06:35:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-03 06:35:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-03 06:35:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-03 06:35:21,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25135 transitions. [2018-12-03 06:35:21,961 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25135 transitions. Word has length 102 [2018-12-03 06:35:21,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:21,961 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25135 transitions. [2018-12-03 06:35:21,961 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 06:35:21,961 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25135 transitions. [2018-12-03 06:35:21,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:21,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:21,968 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-03 06:35:21,968 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:21,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:21,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1413135963, now seen corresponding path program 1 times [2018-12-03 06:35:21,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:21,969 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:35:21,969 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:21,970 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:21,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:22,028 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-03 06:35:22,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:22,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-03 06:35:22,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:22,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 06:35:22,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 06:35:22,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-03 06:35:22,029 INFO L87 Difference]: Start difference. First operand 7461 states and 25135 transitions. Second operand 7 states. [2018-12-03 06:35:22,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:22,218 INFO L93 Difference]: Finished difference Result 9517 states and 31281 transitions. [2018-12-03 06:35:22,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-03 06:35:22,218 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-03 06:35:22,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:22,228 INFO L225 Difference]: With dead ends: 9517 [2018-12-03 06:35:22,228 INFO L226 Difference]: Without dead ends: 9401 [2018-12-03 06:35:22,228 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:35:22,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9401 states. [2018-12-03 06:35:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9401 to 7429. [2018-12-03 06:35:22,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2018-12-03 06:35:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 25007 transitions. [2018-12-03 06:35:22,307 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 25007 transitions. Word has length 102 [2018-12-03 06:35:22,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:22,307 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 25007 transitions. [2018-12-03 06:35:22,307 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 06:35:22,307 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 25007 transitions. [2018-12-03 06:35:22,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:22,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:22,313 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-03 06:35:22,314 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:22,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:22,314 INFO L82 PathProgramCache]: Analyzing trace with hash -522524324, now seen corresponding path program 3 times [2018-12-03 06:35:22,314 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:22,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 06:35:22,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:22,315 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:22,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 06:35:22,421 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-03 06:35:22,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 06:35:22,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-03 06:35:22,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 06:35:22,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-03 06:35:22,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-03 06:35:22,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-03 06:35:22,422 INFO L87 Difference]: Start difference. First operand 7429 states and 25007 transitions. Second operand 12 states. [2018-12-03 06:35:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 06:35:22,748 INFO L93 Difference]: Finished difference Result 14457 states and 48810 transitions. [2018-12-03 06:35:22,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-03 06:35:22,749 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-03 06:35:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 06:35:22,760 INFO L225 Difference]: With dead ends: 14457 [2018-12-03 06:35:22,760 INFO L226 Difference]: Without dead ends: 9913 [2018-12-03 06:35:22,760 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-03 06:35:22,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2018-12-03 06:35:22,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9305. [2018-12-03 06:35:22,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9305 states. [2018-12-03 06:35:22,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 30650 transitions. [2018-12-03 06:35:22,853 INFO L78 Accepts]: Start accepts. Automaton has 9305 states and 30650 transitions. Word has length 102 [2018-12-03 06:35:22,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 06:35:22,853 INFO L480 AbstractCegarLoop]: Abstraction has 9305 states and 30650 transitions. [2018-12-03 06:35:22,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-03 06:35:22,853 INFO L276 IsEmpty]: Start isEmpty. Operand 9305 states and 30650 transitions. [2018-12-03 06:35:22,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-03 06:35:22,860 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 06:35:22,860 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-03 06:35:22,861 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-03 06:35:22,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 06:35:22,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1889908770, now seen corresponding path program 4 times [2018-12-03 06:35:22,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 06:35:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:22,862 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 06:35:22,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 06:35:22,862 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 06:35:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:35:22,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-03 06:35:22,910 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-03 06:35:23,009 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-03 06:35:23,010 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 06:35:23 BasicIcfg [2018-12-03 06:35:23,010 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 06:35:23,010 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 06:35:23,010 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 06:35:23,011 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 06:35:23,011 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 06:34:20" (3/4) ... [2018-12-03 06:35:23,013 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-03 06:35:23,118 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f17289e7-0309-4d4e-9fa6-b837f27d59fc/bin-2019/utaipan/witness.graphml [2018-12-03 06:35:23,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 06:35:23,119 INFO L168 Benchmark]: Toolchain (without parser) took 63383.89 ms. Allocated memory was 1.0 GB in the beginning and 6.5 GB in the end (delta: 5.5 GB). Free memory was 947.0 MB in the beginning and 3.1 GB in the end (delta: -2.2 GB). Peak memory consumption was 3.3 GB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,120 INFO L168 Benchmark]: CDTParser took 0.12 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-03 06:35:23,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,121 INFO L168 Benchmark]: Boogie Preprocessor took 20.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,121 INFO L168 Benchmark]: RCFGBuilder took 339.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,121 INFO L168 Benchmark]: TraceAbstraction took 62560.61 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,121 INFO L168 Benchmark]: Witness Printer took 107.95 ms. Allocated memory is still 6.5 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. [2018-12-03 06:35:23,123 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.0 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -158.0 MB). Peak memory consumption was 34.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 339.32 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62560.61 ms. Allocated memory was 1.2 GB in the beginning and 6.5 GB in the end (delta: 5.3 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.2 GB. Max. memory is 11.5 GB. * Witness Printer took 107.95 ms. Allocated memory is still 6.5 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 42.5 MB). Peak memory consumption was 42.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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] [L778] -1 pthread_t t2518; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L779] FCALL, FORK -1 pthread_create(&t2518, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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 t2519; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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(&t2519, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L782] -1 pthread_t t2520; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L783] FCALL, FORK -1 pthread_create(&t2520, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L741] 0 y$w_buff1 = y$w_buff0 [L742] 0 y$w_buff0 = 2 [L743] 0 y$w_buff1_used = y$w_buff0_used [L744] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L746] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L747] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L748] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L749] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L750] 0 y$r_buff0_thd3 = (_Bool)1 [L753] 0 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=1] [L756] 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_p0_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=1] [L704] 1 z = 2 [L709] 1 __unbuffered_p0_EAX = x [L714] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=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=2] [L721] 2 x = 1 [L724] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=1, 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=2] [L727] 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_p0_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=1, 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=2] [L727] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p0_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=1, 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=2] [L727] 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_p0_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=1, 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=2] [L727] 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) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_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=1, 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=2] [L728] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L729] 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_p0_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=1, 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=2] [L729] 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 [L730] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=1, 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=2] [L756] 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) [L730] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L731] 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=1, __unbuffered_p0_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=1, 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_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=2] [L731] 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 [L734] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=1, 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=2] [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_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=1, 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=2] [L757] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L758] 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=2, __unbuffered_p0_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=1, 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=2] [L758] 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 [L759] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=1, 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=2] [L759] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L760] 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=2, __unbuffered_p0_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=1, 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=2] [L760] 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 [L763] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L785] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L789] 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_p0_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=1, 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=2] [L789] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L789] 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_p0_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=1, 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=2] [L789] -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) [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L790] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L791] 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_p0_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=1, 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=2] [L791] -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 [L792] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L792] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L793] 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_p0_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=1, 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=2] [L793] -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 [L796] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L797] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L798] -1 y$flush_delayed = weak$$choice2 [L799] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L800] 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_p0_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=1, 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=2] [L800] -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) [L801] 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_p0_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=1, 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=2] [L801] -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)) [L802] 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_p0_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=1, 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=2] [L802] -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)) [L803] 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_p0_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=1, 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=2] [L803] -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)) [L804] 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_p0_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=1, 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=2] [L804] -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)) [L805] 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_p0_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=1, 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=2] [L805] -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)) [L806] 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_p0_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=1, 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=2] [L806] -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)) [L807] -1 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L808] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L808] -1 y = y$flush_delayed ? y$mem_tmp : y [L809] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 62.4s OverallTime, 28 OverallIterations, 1 TraceHistogramMax, 16.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 6685 SDtfs, 6374 SDslu, 15779 SDs, 0 SdLazy, 4717 SolverSat, 302 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 281 GetRequests, 85 SyntacticMatches, 14 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 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: 28.5s AutomataMinimizationTime, 27 MinimizatonAttempts, 360077 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 2372 NumberOfCodeBlocks, 2372 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2243 ConstructedInterpolants, 0 QuantifiedInterpolants, 455312 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...