./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix056_rmo.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_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/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 4cf32da18d66f68ed7bc089ceb666dd9b7b22154 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 07:44:59,849 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 07:44:59,850 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 07:44:59,856 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 07:44:59,857 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 07:44:59,857 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 07:44:59,858 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 07:44:59,858 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 07:44:59,859 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 07:44:59,860 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 07:44:59,860 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 07:44:59,860 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 07:44:59,861 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 07:44:59,861 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 07:44:59,862 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 07:44:59,862 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 07:44:59,862 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 07:44:59,863 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 07:44:59,864 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 07:44:59,865 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 07:44:59,865 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 07:44:59,866 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 07:44:59,867 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 07:44:59,867 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 07:44:59,867 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 07:44:59,868 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 07:44:59,868 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 07:44:59,868 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 07:44:59,869 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 07:44:59,869 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 07:44:59,869 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 07:44:59,870 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 07:44:59,870 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 07:44:59,870 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 07:44:59,870 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 07:44:59,871 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 07:44:59,871 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 07:44:59,878 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 07:44:59,878 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 07:44:59,878 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 07:44:59,878 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 07:44:59,879 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 07:44:59,879 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 07:44:59,880 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 07:44:59,880 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 07:44:59,880 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:44:59,881 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 07:44:59,881 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 07:44:59,881 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_fa16f306-5aec-41b2-97b2-a61b06eebb34/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 -> 4cf32da18d66f68ed7bc089ceb666dd9b7b22154 [2018-12-09 07:44:59,898 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 07:44:59,905 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 07:44:59,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 07:44:59,908 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 07:44:59,908 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 07:44:59,908 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i [2018-12-09 07:44:59,944 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/data/f1cd184c3/d4f5aa45b64f4f58a058f79d66d7d5b8/FLAG61fb5ebc6 [2018-12-09 07:45:00,403 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 07:45:00,403 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/sv-benchmarks/c/pthread-wmm/mix056_rmo.opt_false-unreach-call.i [2018-12-09 07:45:00,411 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/data/f1cd184c3/d4f5aa45b64f4f58a058f79d66d7d5b8/FLAG61fb5ebc6 [2018-12-09 07:45:00,419 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/data/f1cd184c3/d4f5aa45b64f4f58a058f79d66d7d5b8 [2018-12-09 07:45:00,421 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 07:45:00,422 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 07:45:00,422 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 07:45:00,422 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 07:45:00,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 07:45:00,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,426 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@628262cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00, skipping insertion in model container [2018-12-09 07:45:00,426 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,431 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 07:45:00,451 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 07:45:00,656 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:45:00,667 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 07:45:00,744 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 07:45:00,774 INFO L195 MainTranslator]: Completed translation [2018-12-09 07:45:00,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00 WrapperNode [2018-12-09 07:45:00,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 07:45:00,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 07:45:00,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 07:45:00,775 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 07:45:00,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,794 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,818 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 07:45:00,818 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 07:45:00,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 07:45:00,818 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 07:45:00,825 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,825 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,828 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,828 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,836 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,841 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... [2018-12-09 07:45:00,844 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 07:45:00,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 07:45:00,845 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 07:45:00,845 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 07:45:00,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 07:45:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 07:45:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 07:45:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-09 07:45:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 07:45:00,880 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-09 07:45:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-09 07:45:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-09 07:45:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-09 07:45:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2018-12-09 07:45:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2018-12-09 07:45:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-09 07:45:00,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 07:45:00,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 07:45:00,882 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-09 07:45:01,239 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 07:45:01,239 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-09 07:45:01,240 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:45:01 BoogieIcfgContainer [2018-12-09 07:45:01,240 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 07:45:01,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 07:45:01,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 07:45:01,243 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 07:45:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 07:45:00" (1/3) ... [2018-12-09 07:45:01,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdeaa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:45:01, skipping insertion in model container [2018-12-09 07:45:01,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 07:45:00" (2/3) ... [2018-12-09 07:45:01,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fdeaa28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 07:45:01, skipping insertion in model container [2018-12-09 07:45:01,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:45:01" (3/3) ... [2018-12-09 07:45:01,246 INFO L112 eAbstractionObserver]: Analyzing ICFG mix056_rmo.opt_false-unreach-call.i [2018-12-09 07:45:01,273 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,274 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe Thread2_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,275 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,276 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,277 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread2_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,278 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe Thread0_P2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,279 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,280 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,281 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,282 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P2_#t~nondet17.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-09 07:45:01,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-09 07:45:01,289 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 07:45:01,295 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-09 07:45:01,306 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-09 07:45:01,321 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 07:45:01,322 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 07:45:01,322 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 07:45:01,322 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 07:45:01,322 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 07:45:01,322 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 07:45:01,322 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 07:45:01,322 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 07:45:01,329 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 155places, 192 transitions [2018-12-09 07:45:15,731 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 128912 states. [2018-12-09 07:45:15,733 INFO L276 IsEmpty]: Start isEmpty. Operand 128912 states. [2018-12-09 07:45:15,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-12-09 07:45:15,740 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:45:15,740 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:45:15,741 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:45:15,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:45:15,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1928541482, now seen corresponding path program 1 times [2018-12-09 07:45:15,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:45:15,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:15,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:45:15,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:15,781 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:45:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:45:15,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:45:15,888 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:45:15,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:45:15,889 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:45:15,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:45:15,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:45:15,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:45:15,901 INFO L87 Difference]: Start difference. First operand 128912 states. Second operand 4 states. [2018-12-09 07:45:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:45:17,275 INFO L93 Difference]: Finished difference Result 233472 states and 1098324 transitions. [2018-12-09 07:45:17,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:45:17,277 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 43 [2018-12-09 07:45:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:45:18,050 INFO L225 Difference]: With dead ends: 233472 [2018-12-09 07:45:18,050 INFO L226 Difference]: Without dead ends: 203722 [2018-12-09 07:45:18,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:45:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203722 states. [2018-12-09 07:45:22,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203722 to 118892. [2018-12-09 07:45:22,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 07:45:23,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 559775 transitions. [2018-12-09 07:45:23,098 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 559775 transitions. Word has length 43 [2018-12-09 07:45:23,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:45:23,099 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 559775 transitions. [2018-12-09 07:45:23,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:45:23,099 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 559775 transitions. [2018-12-09 07:45:23,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 07:45:23,106 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:45:23,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] [2018-12-09 07:45:23,106 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:45:23,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:45:23,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1195634893, now seen corresponding path program 1 times [2018-12-09 07:45:23,106 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:45:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:23,109 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:45:23,109 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:23,109 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:45:23,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:45:23,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:45:23,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:45:23,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:45:23,149 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:45:23,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:45:23,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:45:23,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:45:23,151 INFO L87 Difference]: Start difference. First operand 118892 states and 559775 transitions. Second operand 3 states. [2018-12-09 07:45:24,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:45:24,126 INFO L93 Difference]: Finished difference Result 118892 states and 557815 transitions. [2018-12-09 07:45:24,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:45:24,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-09 07:45:24,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:45:24,452 INFO L225 Difference]: With dead ends: 118892 [2018-12-09 07:45:24,452 INFO L226 Difference]: Without dead ends: 118892 [2018-12-09 07:45:24,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:45:25,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118892 states. [2018-12-09 07:45:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118892 to 118892. [2018-12-09 07:45:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118892 states. [2018-12-09 07:45:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118892 states to 118892 states and 557815 transitions. [2018-12-09 07:45:28,465 INFO L78 Accepts]: Start accepts. Automaton has 118892 states and 557815 transitions. Word has length 50 [2018-12-09 07:45:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:45:28,465 INFO L480 AbstractCegarLoop]: Abstraction has 118892 states and 557815 transitions. [2018-12-09 07:45:28,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:45:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 118892 states and 557815 transitions. [2018-12-09 07:45:28,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-09 07:45:28,468 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:45:28,468 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:45:28,468 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:45:28,469 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:45:28,469 INFO L82 PathProgramCache]: Analyzing trace with hash 1302381044, now seen corresponding path program 1 times [2018-12-09 07:45:28,469 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:45:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:28,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:45:28,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:28,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:45:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:45:28,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:45:28,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:45:28,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:45:28,531 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:45:28,531 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:45:28,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:45:28,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:45:28,531 INFO L87 Difference]: Start difference. First operand 118892 states and 557815 transitions. Second operand 5 states. [2018-12-09 07:45:30,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:45:30,387 INFO L93 Difference]: Finished difference Result 325272 states and 1468249 transitions. [2018-12-09 07:45:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:45:30,388 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2018-12-09 07:45:30,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:45:31,248 INFO L225 Difference]: With dead ends: 325272 [2018-12-09 07:45:31,248 INFO L226 Difference]: Without dead ends: 324272 [2018-12-09 07:45:31,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:45:32,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324272 states. [2018-12-09 07:45:38,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324272 to 186422. [2018-12-09 07:45:38,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186422 states. [2018-12-09 07:45:38,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186422 states to 186422 states and 840914 transitions. [2018-12-09 07:45:38,683 INFO L78 Accepts]: Start accepts. Automaton has 186422 states and 840914 transitions. Word has length 50 [2018-12-09 07:45:38,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:45:38,684 INFO L480 AbstractCegarLoop]: Abstraction has 186422 states and 840914 transitions. [2018-12-09 07:45:38,684 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:45:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand 186422 states and 840914 transitions. [2018-12-09 07:45:38,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-09 07:45:38,689 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:45:38,689 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:45:38,689 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:45:38,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:45:38,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1678185933, now seen corresponding path program 1 times [2018-12-09 07:45:38,690 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:45:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:38,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:45:38,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:38,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:45:38,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:45:38,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:45:38,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:45:38,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:45:38,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:45:38,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:45:38,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:45:38,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:45:38,731 INFO L87 Difference]: Start difference. First operand 186422 states and 840914 transitions. Second operand 5 states. [2018-12-09 07:45:40,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:45:40,813 INFO L93 Difference]: Finished difference Result 334052 states and 1500993 transitions. [2018-12-09 07:45:40,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:45:40,814 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2018-12-09 07:45:40,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:45:41,708 INFO L225 Difference]: With dead ends: 334052 [2018-12-09 07:45:41,708 INFO L226 Difference]: Without dead ends: 333002 [2018-12-09 07:45:41,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:45:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333002 states. [2018-12-09 07:45:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333002 to 194882. [2018-12-09 07:45:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194882 states. [2018-12-09 07:45:47,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194882 states to 194882 states and 876472 transitions. [2018-12-09 07:45:47,043 INFO L78 Accepts]: Start accepts. Automaton has 194882 states and 876472 transitions. Word has length 51 [2018-12-09 07:45:47,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:45:47,044 INFO L480 AbstractCegarLoop]: Abstraction has 194882 states and 876472 transitions. [2018-12-09 07:45:47,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:45:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 194882 states and 876472 transitions. [2018-12-09 07:45:47,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-09 07:45:47,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:45:47,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:45:47,068 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:45:47,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:45:47,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1402455913, now seen corresponding path program 1 times [2018-12-09 07:45:47,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:45:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:47,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:45:47,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:47,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:45:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:45:47,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:45:47,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:45:47,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:45:47,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:45:47,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:45:47,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:45:47,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:45:47,132 INFO L87 Difference]: Start difference. First operand 194882 states and 876472 transitions. Second operand 6 states. [2018-12-09 07:45:49,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:45:49,039 INFO L93 Difference]: Finished difference Result 342292 states and 1509975 transitions. [2018-12-09 07:45:49,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-09 07:45:49,040 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2018-12-09 07:45:49,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:45:52,807 INFO L225 Difference]: With dead ends: 342292 [2018-12-09 07:45:52,807 INFO L226 Difference]: Without dead ends: 341292 [2018-12-09 07:45:52,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2018-12-09 07:45:54,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341292 states. [2018-12-09 07:45:57,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341292 to 189132. [2018-12-09 07:45:57,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189132 states. [2018-12-09 07:45:57,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189132 states to 189132 states and 850672 transitions. [2018-12-09 07:45:57,544 INFO L78 Accepts]: Start accepts. Automaton has 189132 states and 850672 transitions. Word has length 58 [2018-12-09 07:45:57,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:45:57,545 INFO L480 AbstractCegarLoop]: Abstraction has 189132 states and 850672 transitions. [2018-12-09 07:45:57,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:45:57,545 INFO L276 IsEmpty]: Start isEmpty. Operand 189132 states and 850672 transitions. [2018-12-09 07:45:57,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 07:45:57,613 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:45:57,613 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:45:57,613 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:45:57,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:45:57,613 INFO L82 PathProgramCache]: Analyzing trace with hash -1292775433, now seen corresponding path program 1 times [2018-12-09 07:45:57,614 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:45:57,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:57,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:45:57,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:45:57,615 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:45:57,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:45:57,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:45:57,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:45:57,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:45:57,674 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:45:57,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:45:57,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:45:57,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:45:57,675 INFO L87 Difference]: Start difference. First operand 189132 states and 850672 transitions. Second operand 5 states. [2018-12-09 07:45:59,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:45:59,574 INFO L93 Difference]: Finished difference Result 312432 states and 1393397 transitions. [2018-12-09 07:45:59,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:45:59,574 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2018-12-09 07:45:59,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:46:00,863 INFO L225 Difference]: With dead ends: 312432 [2018-12-09 07:46:00,863 INFO L226 Difference]: Without dead ends: 311792 [2018-12-09 07:46:00,864 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:46:02,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311792 states. [2018-12-09 07:46:08,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311792 to 298522. [2018-12-09 07:46:08,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298522 states. [2018-12-09 07:46:09,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298522 states to 298522 states and 1334099 transitions. [2018-12-09 07:46:09,403 INFO L78 Accepts]: Start accepts. Automaton has 298522 states and 1334099 transitions. Word has length 65 [2018-12-09 07:46:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:46:09,403 INFO L480 AbstractCegarLoop]: Abstraction has 298522 states and 1334099 transitions. [2018-12-09 07:46:09,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:46:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 298522 states and 1334099 transitions. [2018-12-09 07:46:09,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-09 07:46:09,515 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:46:09,515 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:46:09,515 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:46:09,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:46:09,515 INFO L82 PathProgramCache]: Analyzing trace with hash 2024042264, now seen corresponding path program 1 times [2018-12-09 07:46:09,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:46:09,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:46:09,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:46:09,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:46:09,517 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:46:09,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:46:09,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:46:09,574 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:46:09,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:46:09,574 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:46:09,575 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:46:09,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:46:09,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:46:09,575 INFO L87 Difference]: Start difference. First operand 298522 states and 1334099 transitions. Second operand 6 states. [2018-12-09 07:46:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:46:13,587 INFO L93 Difference]: Finished difference Result 617312 states and 2720261 transitions. [2018-12-09 07:46:13,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 07:46:13,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2018-12-09 07:46:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:46:15,334 INFO L225 Difference]: With dead ends: 617312 [2018-12-09 07:46:15,334 INFO L226 Difference]: Without dead ends: 615712 [2018-12-09 07:46:15,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-09 07:46:21,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615712 states. [2018-12-09 07:46:27,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615712 to 353817. [2018-12-09 07:46:27,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353817 states. [2018-12-09 07:46:29,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353817 states to 353817 states and 1566315 transitions. [2018-12-09 07:46:29,092 INFO L78 Accepts]: Start accepts. Automaton has 353817 states and 1566315 transitions. Word has length 65 [2018-12-09 07:46:29,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:46:29,092 INFO L480 AbstractCegarLoop]: Abstraction has 353817 states and 1566315 transitions. [2018-12-09 07:46:29,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:46:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 353817 states and 1566315 transitions. [2018-12-09 07:46:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-09 07:46:29,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:46:29,277 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] [2018-12-09 07:46:29,277 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:46:29,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:46:29,277 INFO L82 PathProgramCache]: Analyzing trace with hash 1275093964, now seen corresponding path program 1 times [2018-12-09 07:46:29,277 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:46:29,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:46:29,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:46:29,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:46:29,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:46:29,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:46:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:46:29,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:46:29,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:46:29,298 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:46:29,298 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:46:29,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:46:29,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:46:29,299 INFO L87 Difference]: Start difference. First operand 353817 states and 1566315 transitions. Second operand 3 states. [2018-12-09 07:46:32,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:46:32,082 INFO L93 Difference]: Finished difference Result 438907 states and 1917857 transitions. [2018-12-09 07:46:32,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:46:32,082 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-09 07:46:32,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:46:33,318 INFO L225 Difference]: With dead ends: 438907 [2018-12-09 07:46:33,319 INFO L226 Difference]: Without dead ends: 438907 [2018-12-09 07:46:33,319 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:46:35,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438907 states. [2018-12-09 07:46:44,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438907 to 375852. [2018-12-09 07:46:44,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375852 states. [2018-12-09 07:46:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375852 states to 375852 states and 1658793 transitions. [2018-12-09 07:46:45,217 INFO L78 Accepts]: Start accepts. Automaton has 375852 states and 1658793 transitions. Word has length 67 [2018-12-09 07:46:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:46:45,217 INFO L480 AbstractCegarLoop]: Abstraction has 375852 states and 1658793 transitions. [2018-12-09 07:46:45,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:46:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 375852 states and 1658793 transitions. [2018-12-09 07:46:45,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-12-09 07:46:45,959 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:46:45,959 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] [2018-12-09 07:46:45,959 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:46:45,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:46:45,959 INFO L82 PathProgramCache]: Analyzing trace with hash -567092309, now seen corresponding path program 1 times [2018-12-09 07:46:45,959 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:46:45,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:46:45,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:46:45,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:46:45,961 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:46:45,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:46:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:46:46,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:46:46,025 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:46:46,025 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:46:46,025 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:46:46,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:46:46,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:46:46,025 INFO L87 Difference]: Start difference. First operand 375852 states and 1658793 transitions. Second operand 7 states. [2018-12-09 07:46:50,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:46:50,197 INFO L93 Difference]: Finished difference Result 675132 states and 2945642 transitions. [2018-12-09 07:46:50,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 07:46:50,198 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2018-12-09 07:46:50,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:46:52,582 INFO L225 Difference]: With dead ends: 675132 [2018-12-09 07:46:52,582 INFO L226 Difference]: Without dead ends: 673532 [2018-12-09 07:46:52,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2018-12-09 07:46:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673532 states. [2018-12-09 07:47:05,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673532 to 385502. [2018-12-09 07:47:05,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385502 states. [2018-12-09 07:47:07,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385502 states to 385502 states and 1698383 transitions. [2018-12-09 07:47:07,384 INFO L78 Accepts]: Start accepts. Automaton has 385502 states and 1698383 transitions. Word has length 71 [2018-12-09 07:47:07,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:47:07,384 INFO L480 AbstractCegarLoop]: Abstraction has 385502 states and 1698383 transitions. [2018-12-09 07:47:07,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:47:07,384 INFO L276 IsEmpty]: Start isEmpty. Operand 385502 states and 1698383 transitions. [2018-12-09 07:47:07,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-12-09 07:47:07,681 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:47:07,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, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:47:07,682 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:47:07,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:47:07,682 INFO L82 PathProgramCache]: Analyzing trace with hash 243525730, now seen corresponding path program 1 times [2018-12-09 07:47:07,682 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:47:07,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:47:07,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:47:07,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:47:07,684 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:47:07,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:47:07,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:47:07,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:47:07,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:47:07,745 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:47:07,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:47:07,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:47:07,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:47:07,745 INFO L87 Difference]: Start difference. First operand 385502 states and 1698383 transitions. Second operand 7 states. [2018-12-09 07:47:11,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:47:11,702 INFO L93 Difference]: Finished difference Result 515737 states and 2256101 transitions. [2018-12-09 07:47:11,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 07:47:11,703 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2018-12-09 07:47:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:47:13,136 INFO L225 Difference]: With dead ends: 515737 [2018-12-09 07:47:13,136 INFO L226 Difference]: Without dead ends: 514387 [2018-12-09 07:47:13,137 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2018-12-09 07:47:15,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514387 states. [2018-12-09 07:47:21,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514387 to 389347. [2018-12-09 07:47:21,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389347 states. [2018-12-09 07:47:29,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389347 states to 389347 states and 1713924 transitions. [2018-12-09 07:47:29,083 INFO L78 Accepts]: Start accepts. Automaton has 389347 states and 1713924 transitions. Word has length 72 [2018-12-09 07:47:29,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:47:29,084 INFO L480 AbstractCegarLoop]: Abstraction has 389347 states and 1713924 transitions. [2018-12-09 07:47:29,084 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:47:29,084 INFO L276 IsEmpty]: Start isEmpty. Operand 389347 states and 1713924 transitions. [2018-12-09 07:47:29,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 07:47:29,437 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:47:29,437 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] [2018-12-09 07:47:29,437 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:47:29,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:47:29,438 INFO L82 PathProgramCache]: Analyzing trace with hash 146003645, now seen corresponding path program 1 times [2018-12-09 07:47:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:47:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:47:29,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:47:29,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:47:29,440 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:47:29,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:47:29,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:47:29,505 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:47:29,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:47:29,505 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:47:29,506 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:47:29,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:47:29,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:47:29,506 INFO L87 Difference]: Start difference. First operand 389347 states and 1713924 transitions. Second operand 6 states. [2018-12-09 07:47:32,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:47:32,429 INFO L93 Difference]: Finished difference Result 508422 states and 2226794 transitions. [2018-12-09 07:47:32,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:47:32,430 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-09 07:47:32,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:47:34,276 INFO L225 Difference]: With dead ends: 508422 [2018-12-09 07:47:34,277 INFO L226 Difference]: Without dead ends: 502462 [2018-12-09 07:47:34,277 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:47:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502462 states. [2018-12-09 07:47:41,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502462 to 439622. [2018-12-09 07:47:41,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439622 states. [2018-12-09 07:47:43,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439622 states to 439622 states and 1937949 transitions. [2018-12-09 07:47:43,623 INFO L78 Accepts]: Start accepts. Automaton has 439622 states and 1937949 transitions. Word has length 74 [2018-12-09 07:47:43,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:47:43,623 INFO L480 AbstractCegarLoop]: Abstraction has 439622 states and 1937949 transitions. [2018-12-09 07:47:43,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:47:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 439622 states and 1937949 transitions. [2018-12-09 07:47:44,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 07:47:44,648 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:47:44,648 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] [2018-12-09 07:47:44,648 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:47:44,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:47:44,648 INFO L82 PathProgramCache]: Analyzing trace with hash -137146819, now seen corresponding path program 1 times [2018-12-09 07:47:44,649 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:47:44,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:47:44,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:47:44,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:47:44,651 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:47:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:47:44,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:47:44,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:47:44,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:47:44,724 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:47:44,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:47:44,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:47:44,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:47:44,725 INFO L87 Difference]: Start difference. First operand 439622 states and 1937949 transitions. Second operand 7 states. [2018-12-09 07:47:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:47:51,718 INFO L93 Difference]: Finished difference Result 590157 states and 2550697 transitions. [2018-12-09 07:47:51,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 07:47:51,718 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 74 [2018-12-09 07:47:51,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:47:53,722 INFO L225 Difference]: With dead ends: 590157 [2018-12-09 07:47:53,722 INFO L226 Difference]: Without dead ends: 590157 [2018-12-09 07:47:53,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2018-12-09 07:47:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590157 states. [2018-12-09 07:48:02,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590157 to 542807. [2018-12-09 07:48:02,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542807 states. [2018-12-09 07:48:05,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542807 states to 542807 states and 2362207 transitions. [2018-12-09 07:48:05,540 INFO L78 Accepts]: Start accepts. Automaton has 542807 states and 2362207 transitions. Word has length 74 [2018-12-09 07:48:05,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:05,540 INFO L480 AbstractCegarLoop]: Abstraction has 542807 states and 2362207 transitions. [2018-12-09 07:48:05,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:48:05,540 INFO L276 IsEmpty]: Start isEmpty. Operand 542807 states and 2362207 transitions. [2018-12-09 07:48:06,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-09 07:48:06,090 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:06,091 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] [2018-12-09 07:48:06,091 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:06,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:06,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1107617662, now seen corresponding path program 1 times [2018-12-09 07:48:06,091 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:06,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:06,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:06,093 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:06,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:06,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:06,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:48:06,117 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:06,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:48:06,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:48:06,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:48:06,118 INFO L87 Difference]: Start difference. First operand 542807 states and 2362207 transitions. Second operand 4 states. [2018-12-09 07:48:08,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:08,785 INFO L93 Difference]: Finished difference Result 469758 states and 2015930 transitions. [2018-12-09 07:48:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:48:08,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2018-12-09 07:48:08,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:10,115 INFO L225 Difference]: With dead ends: 469758 [2018-12-09 07:48:10,115 INFO L226 Difference]: Without dead ends: 467053 [2018-12-09 07:48:10,115 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:48:11,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467053 states. [2018-12-09 07:48:22,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467053 to 467053. [2018-12-09 07:48:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467053 states. [2018-12-09 07:48:24,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467053 states to 467053 states and 2006968 transitions. [2018-12-09 07:48:24,293 INFO L78 Accepts]: Start accepts. Automaton has 467053 states and 2006968 transitions. Word has length 74 [2018-12-09 07:48:24,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:24,294 INFO L480 AbstractCegarLoop]: Abstraction has 467053 states and 2006968 transitions. [2018-12-09 07:48:24,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:48:24,294 INFO L276 IsEmpty]: Start isEmpty. Operand 467053 states and 2006968 transitions. [2018-12-09 07:48:24,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-09 07:48:24,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:24,762 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:24,763 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:24,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1793024226, now seen corresponding path program 1 times [2018-12-09 07:48:24,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:24,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:24,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:24,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:24,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:24,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:24,797 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:24,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:48:24,797 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:24,797 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:48:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:48:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:48:24,797 INFO L87 Difference]: Start difference. First operand 467053 states and 2006968 transitions. Second operand 5 states. [2018-12-09 07:48:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:25,359 INFO L93 Difference]: Finished difference Result 137697 states and 546963 transitions. [2018-12-09 07:48:25,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:48:25,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-09 07:48:25,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:26,150 INFO L225 Difference]: With dead ends: 137697 [2018-12-09 07:48:26,150 INFO L226 Difference]: Without dead ends: 135305 [2018-12-09 07:48:26,151 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:26,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135305 states. [2018-12-09 07:48:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135305 to 135245. [2018-12-09 07:48:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135245 states. [2018-12-09 07:48:28,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135245 states to 135245 states and 537799 transitions. [2018-12-09 07:48:28,410 INFO L78 Accepts]: Start accepts. Automaton has 135245 states and 537799 transitions. Word has length 75 [2018-12-09 07:48:28,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:28,411 INFO L480 AbstractCegarLoop]: Abstraction has 135245 states and 537799 transitions. [2018-12-09 07:48:28,411 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:48:28,411 INFO L276 IsEmpty]: Start isEmpty. Operand 135245 states and 537799 transitions. [2018-12-09 07:48:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:48:28,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:28,537 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-09 07:48:28,537 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:28,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:28,537 INFO L82 PathProgramCache]: Analyzing trace with hash -405984454, now seen corresponding path program 1 times [2018-12-09 07:48:28,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:28,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:28,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:28,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:28,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:28,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:28,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:28,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:28,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:48:28,579 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:28,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:48:28,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:48:28,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:48:28,580 INFO L87 Difference]: Start difference. First operand 135245 states and 537799 transitions. Second operand 4 states. [2018-12-09 07:48:29,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:29,319 INFO L93 Difference]: Finished difference Result 169525 states and 668412 transitions. [2018-12-09 07:48:29,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-09 07:48:29,319 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 85 [2018-12-09 07:48:29,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:29,696 INFO L225 Difference]: With dead ends: 169525 [2018-12-09 07:48:29,696 INFO L226 Difference]: Without dead ends: 169525 [2018-12-09 07:48:29,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:48:29,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169525 states. [2018-12-09 07:48:31,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169525 to 140469. [2018-12-09 07:48:31,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140469 states. [2018-12-09 07:48:32,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140469 states to 140469 states and 557228 transitions. [2018-12-09 07:48:32,390 INFO L78 Accepts]: Start accepts. Automaton has 140469 states and 557228 transitions. Word has length 85 [2018-12-09 07:48:32,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:32,391 INFO L480 AbstractCegarLoop]: Abstraction has 140469 states and 557228 transitions. [2018-12-09 07:48:32,391 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:48:32,391 INFO L276 IsEmpty]: Start isEmpty. Operand 140469 states and 557228 transitions. [2018-12-09 07:48:32,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-09 07:48:32,521 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:32,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] [2018-12-09 07:48:32,522 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:32,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:32,522 INFO L82 PathProgramCache]: Analyzing trace with hash -660720999, now seen corresponding path program 1 times [2018-12-09 07:48:32,522 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:32,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:32,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:32,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:32,524 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:32,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:32,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:32,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:32,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:32,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:32,563 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:32,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:32,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:32,564 INFO L87 Difference]: Start difference. First operand 140469 states and 557228 transitions. Second operand 6 states. [2018-12-09 07:48:32,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:32,657 INFO L93 Difference]: Finished difference Result 20597 states and 70892 transitions. [2018-12-09 07:48:32,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:48:32,657 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 85 [2018-12-09 07:48:32,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:32,680 INFO L225 Difference]: With dead ends: 20597 [2018-12-09 07:48:32,680 INFO L226 Difference]: Without dead ends: 18885 [2018-12-09 07:48:32,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:48:32,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18885 states. [2018-12-09 07:48:32,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18885 to 18370. [2018-12-09 07:48:32,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18370 states. [2018-12-09 07:48:32,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18370 states to 18370 states and 63196 transitions. [2018-12-09 07:48:32,872 INFO L78 Accepts]: Start accepts. Automaton has 18370 states and 63196 transitions. Word has length 85 [2018-12-09 07:48:32,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:32,872 INFO L480 AbstractCegarLoop]: Abstraction has 18370 states and 63196 transitions. [2018-12-09 07:48:32,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand 18370 states and 63196 transitions. [2018-12-09 07:48:32,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 07:48:32,887 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:32,887 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:32,887 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:32,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:32,888 INFO L82 PathProgramCache]: Analyzing trace with hash 45027742, now seen corresponding path program 1 times [2018-12-09 07:48:32,888 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:32,888 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:32,888 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:32,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:32,889 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:32,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:32,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:32,910 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:32,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 07:48:32,910 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:32,910 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 07:48:32,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 07:48:32,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:48:32,910 INFO L87 Difference]: Start difference. First operand 18370 states and 63196 transitions. Second operand 3 states. [2018-12-09 07:48:33,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:33,013 INFO L93 Difference]: Finished difference Result 18790 states and 64462 transitions. [2018-12-09 07:48:33,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 07:48:33,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2018-12-09 07:48:33,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:33,036 INFO L225 Difference]: With dead ends: 18790 [2018-12-09 07:48:33,036 INFO L226 Difference]: Without dead ends: 18790 [2018-12-09 07:48:33,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 07:48:33,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18790 states. [2018-12-09 07:48:33,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18790 to 18560. [2018-12-09 07:48:33,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18560 states. [2018-12-09 07:48:33,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18560 states to 18560 states and 63768 transitions. [2018-12-09 07:48:33,227 INFO L78 Accepts]: Start accepts. Automaton has 18560 states and 63768 transitions. Word has length 98 [2018-12-09 07:48:33,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:33,227 INFO L480 AbstractCegarLoop]: Abstraction has 18560 states and 63768 transitions. [2018-12-09 07:48:33,227 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 07:48:33,227 INFO L276 IsEmpty]: Start isEmpty. Operand 18560 states and 63768 transitions. [2018-12-09 07:48:33,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 07:48:33,242 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:33,242 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:33,242 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:33,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:33,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2037064255, now seen corresponding path program 1 times [2018-12-09 07:48:33,243 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:33,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:33,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:33,244 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:33,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:33,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:33,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:33,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:48:33,291 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:33,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:48:33,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:48:33,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:48:33,292 INFO L87 Difference]: Start difference. First operand 18560 states and 63768 transitions. Second operand 5 states. [2018-12-09 07:48:33,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:33,449 INFO L93 Difference]: Finished difference Result 20705 states and 70469 transitions. [2018-12-09 07:48:33,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:48:33,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-09 07:48:33,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:33,474 INFO L225 Difference]: With dead ends: 20705 [2018-12-09 07:48:33,474 INFO L226 Difference]: Without dead ends: 20705 [2018-12-09 07:48:33,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:48:33,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20705 states. [2018-12-09 07:48:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20705 to 20501. [2018-12-09 07:48:33,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20501 states. [2018-12-09 07:48:33,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20501 states to 20501 states and 69869 transitions. [2018-12-09 07:48:33,680 INFO L78 Accepts]: Start accepts. Automaton has 20501 states and 69869 transitions. Word has length 98 [2018-12-09 07:48:33,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:33,681 INFO L480 AbstractCegarLoop]: Abstraction has 20501 states and 69869 transitions. [2018-12-09 07:48:33,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:48:33,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20501 states and 69869 transitions. [2018-12-09 07:48:33,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-09 07:48:33,697 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:33,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:33,697 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:33,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:33,697 INFO L82 PathProgramCache]: Analyzing trace with hash 2029304896, now seen corresponding path program 2 times [2018-12-09 07:48:33,698 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:33,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:33,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:33,699 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:33,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:33,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:33,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:33,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:48:33,731 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:33,731 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:48:33,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:48:33,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:48:33,731 INFO L87 Difference]: Start difference. First operand 20501 states and 69869 transitions. Second operand 4 states. [2018-12-09 07:48:33,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:33,984 INFO L93 Difference]: Finished difference Result 27185 states and 92953 transitions. [2018-12-09 07:48:33,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:48:33,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-09 07:48:33,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:34,019 INFO L225 Difference]: With dead ends: 27185 [2018-12-09 07:48:34,019 INFO L226 Difference]: Without dead ends: 27185 [2018-12-09 07:48:34,019 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:48:34,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27185 states. [2018-12-09 07:48:34,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27185 to 20711. [2018-12-09 07:48:34,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20711 states. [2018-12-09 07:48:34,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20711 states to 20711 states and 70497 transitions. [2018-12-09 07:48:34,261 INFO L78 Accepts]: Start accepts. Automaton has 20711 states and 70497 transitions. Word has length 98 [2018-12-09 07:48:34,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:34,261 INFO L480 AbstractCegarLoop]: Abstraction has 20711 states and 70497 transitions. [2018-12-09 07:48:34,262 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:48:34,262 INFO L276 IsEmpty]: Start isEmpty. Operand 20711 states and 70497 transitions. [2018-12-09 07:48:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:34,278 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:34,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:34,278 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:34,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:34,279 INFO L82 PathProgramCache]: Analyzing trace with hash -834009160, now seen corresponding path program 1 times [2018-12-09 07:48:34,279 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:34,279 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:48:34,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:34,280 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:34,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:34,306 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:34,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-09 07:48:34,306 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:34,306 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 07:48:34,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 07:48:34,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:48:34,306 INFO L87 Difference]: Start difference. First operand 20711 states and 70497 transitions. Second operand 4 states. [2018-12-09 07:48:34,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:34,463 INFO L93 Difference]: Finished difference Result 36869 states and 125561 transitions. [2018-12-09 07:48:34,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:48:34,464 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2018-12-09 07:48:34,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:34,516 INFO L225 Difference]: With dead ends: 36869 [2018-12-09 07:48:34,516 INFO L226 Difference]: Without dead ends: 36869 [2018-12-09 07:48:34,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-09 07:48:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36869 states. [2018-12-09 07:48:34,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36869 to 20461. [2018-12-09 07:48:34,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20461 states. [2018-12-09 07:48:34,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20461 states to 20461 states and 69372 transitions. [2018-12-09 07:48:34,820 INFO L78 Accepts]: Start accepts. Automaton has 20461 states and 69372 transitions. Word has length 100 [2018-12-09 07:48:34,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:34,820 INFO L480 AbstractCegarLoop]: Abstraction has 20461 states and 69372 transitions. [2018-12-09 07:48:34,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 07:48:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 20461 states and 69372 transitions. [2018-12-09 07:48:34,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:34,838 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:34,838 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:34,838 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:34,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:34,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1758578087, now seen corresponding path program 1 times [2018-12-09 07:48:34,839 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:34,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:34,839 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:34,839 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:34,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:34,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:34,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:34,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:34,903 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:34,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:34,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:34,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:34,904 INFO L87 Difference]: Start difference. First operand 20461 states and 69372 transitions. Second operand 6 states. [2018-12-09 07:48:35,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:35,118 INFO L93 Difference]: Finished difference Result 22461 states and 75447 transitions. [2018-12-09 07:48:35,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:48:35,119 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 07:48:35,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:35,144 INFO L225 Difference]: With dead ends: 22461 [2018-12-09 07:48:35,144 INFO L226 Difference]: Without dead ends: 22461 [2018-12-09 07:48:35,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:35,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22461 states. [2018-12-09 07:48:35,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22461 to 20806. [2018-12-09 07:48:35,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20806 states. [2018-12-09 07:48:35,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20806 states to 20806 states and 70433 transitions. [2018-12-09 07:48:35,359 INFO L78 Accepts]: Start accepts. Automaton has 20806 states and 70433 transitions. Word has length 100 [2018-12-09 07:48:35,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:35,359 INFO L480 AbstractCegarLoop]: Abstraction has 20806 states and 70433 transitions. [2018-12-09 07:48:35,359 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:35,359 INFO L276 IsEmpty]: Start isEmpty. Operand 20806 states and 70433 transitions. [2018-12-09 07:48:35,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:35,376 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:35,376 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:35,376 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:35,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:35,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1566808186, now seen corresponding path program 1 times [2018-12-09 07:48:35,376 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:35,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:35,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:35,377 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:35,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:35,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:35,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:35,434 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:35,434 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:35,435 INFO L87 Difference]: Start difference. First operand 20806 states and 70433 transitions. Second operand 6 states. [2018-12-09 07:48:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:35,604 INFO L93 Difference]: Finished difference Result 20070 states and 67756 transitions. [2018-12-09 07:48:35,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:48:35,605 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 07:48:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:35,633 INFO L225 Difference]: With dead ends: 20070 [2018-12-09 07:48:35,633 INFO L226 Difference]: Without dead ends: 20070 [2018-12-09 07:48:35,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:48:35,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2018-12-09 07:48:35,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 19676. [2018-12-09 07:48:35,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19676 states. [2018-12-09 07:48:35,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19676 states to 19676 states and 66594 transitions. [2018-12-09 07:48:35,857 INFO L78 Accepts]: Start accepts. Automaton has 19676 states and 66594 transitions. Word has length 100 [2018-12-09 07:48:35,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:35,857 INFO L480 AbstractCegarLoop]: Abstraction has 19676 states and 66594 transitions. [2018-12-09 07:48:35,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:35,857 INFO L276 IsEmpty]: Start isEmpty. Operand 19676 states and 66594 transitions. [2018-12-09 07:48:35,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:35,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:35,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:35,873 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:35,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:35,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1452574727, now seen corresponding path program 1 times [2018-12-09 07:48:35,873 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:35,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:35,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:35,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:35,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:35,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:35,920 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:35,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:35,920 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:35,921 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:35,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:35,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:35,921 INFO L87 Difference]: Start difference. First operand 19676 states and 66594 transitions. Second operand 6 states. [2018-12-09 07:48:36,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:36,240 INFO L93 Difference]: Finished difference Result 21251 states and 70879 transitions. [2018-12-09 07:48:36,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:48:36,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 07:48:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:36,265 INFO L225 Difference]: With dead ends: 21251 [2018-12-09 07:48:36,265 INFO L226 Difference]: Without dead ends: 20701 [2018-12-09 07:48:36,265 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:36,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20701 states. [2018-12-09 07:48:36,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20701 to 20126. [2018-12-09 07:48:36,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20126 states. [2018-12-09 07:48:36,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20126 states to 20126 states and 67784 transitions. [2018-12-09 07:48:36,464 INFO L78 Accepts]: Start accepts. Automaton has 20126 states and 67784 transitions. Word has length 100 [2018-12-09 07:48:36,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:36,464 INFO L480 AbstractCegarLoop]: Abstraction has 20126 states and 67784 transitions. [2018-12-09 07:48:36,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:36,465 INFO L276 IsEmpty]: Start isEmpty. Operand 20126 states and 67784 transitions. [2018-12-09 07:48:36,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:36,480 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:36,481 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:36,481 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:36,481 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:36,481 INFO L82 PathProgramCache]: Analyzing trace with hash 248165752, now seen corresponding path program 1 times [2018-12-09 07:48:36,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:36,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:36,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:36,482 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:36,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:36,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:36,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:48:36,539 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:36,539 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:48:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:48:36,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:36,540 INFO L87 Difference]: Start difference. First operand 20126 states and 67784 transitions. Second operand 7 states. [2018-12-09 07:48:36,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:36,736 INFO L93 Difference]: Finished difference Result 21079 states and 70852 transitions. [2018-12-09 07:48:36,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:48:36,736 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 100 [2018-12-09 07:48:36,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:36,762 INFO L225 Difference]: With dead ends: 21079 [2018-12-09 07:48:36,762 INFO L226 Difference]: Without dead ends: 21079 [2018-12-09 07:48:36,763 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:36,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21079 states. [2018-12-09 07:48:36,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21079 to 20031. [2018-12-09 07:48:36,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20031 states. [2018-12-09 07:48:36,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20031 states to 20031 states and 67508 transitions. [2018-12-09 07:48:36,968 INFO L78 Accepts]: Start accepts. Automaton has 20031 states and 67508 transitions. Word has length 100 [2018-12-09 07:48:36,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:36,968 INFO L480 AbstractCegarLoop]: Abstraction has 20031 states and 67508 transitions. [2018-12-09 07:48:36,968 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:48:36,968 INFO L276 IsEmpty]: Start isEmpty. Operand 20031 states and 67508 transitions. [2018-12-09 07:48:36,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:36,983 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:36,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:36,984 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:36,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:36,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1659045272, now seen corresponding path program 1 times [2018-12-09 07:48:36,984 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:36,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:36,985 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:36,985 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:36,985 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:37,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:37,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:37,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:48:37,038 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:37,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:48:37,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:48:37,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:48:37,039 INFO L87 Difference]: Start difference. First operand 20031 states and 67508 transitions. Second operand 5 states. [2018-12-09 07:48:37,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:37,145 INFO L93 Difference]: Finished difference Result 18687 states and 63075 transitions. [2018-12-09 07:48:37,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 07:48:37,146 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2018-12-09 07:48:37,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:37,167 INFO L225 Difference]: With dead ends: 18687 [2018-12-09 07:48:37,168 INFO L226 Difference]: Without dead ends: 18687 [2018-12-09 07:48:37,168 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:37,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18687 states. [2018-12-09 07:48:37,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18687 to 18502. [2018-12-09 07:48:37,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18502 states. [2018-12-09 07:48:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18502 states to 18502 states and 62557 transitions. [2018-12-09 07:48:37,353 INFO L78 Accepts]: Start accepts. Automaton has 18502 states and 62557 transitions. Word has length 100 [2018-12-09 07:48:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:37,353 INFO L480 AbstractCegarLoop]: Abstraction has 18502 states and 62557 transitions. [2018-12-09 07:48:37,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:48:37,354 INFO L276 IsEmpty]: Start isEmpty. Operand 18502 states and 62557 transitions. [2018-12-09 07:48:37,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-12-09 07:48:37,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:37,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-09 07:48:37,369 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:37,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:37,369 INFO L82 PathProgramCache]: Analyzing trace with hash -127158119, now seen corresponding path program 1 times [2018-12-09 07:48:37,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:37,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:37,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:37,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:37,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:37,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:37,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:37,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:37,447 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:37,447 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:37,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:37,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:37,448 INFO L87 Difference]: Start difference. First operand 18502 states and 62557 transitions. Second operand 6 states. [2018-12-09 07:48:37,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:37,551 INFO L93 Difference]: Finished difference Result 12422 states and 40685 transitions. [2018-12-09 07:48:37,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 07:48:37,551 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 100 [2018-12-09 07:48:37,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:37,565 INFO L225 Difference]: With dead ends: 12422 [2018-12-09 07:48:37,565 INFO L226 Difference]: Without dead ends: 12422 [2018-12-09 07:48:37,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:37,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12422 states. [2018-12-09 07:48:37,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12422 to 10933. [2018-12-09 07:48:37,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10933 states. [2018-12-09 07:48:37,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10933 states to 10933 states and 36071 transitions. [2018-12-09 07:48:37,675 INFO L78 Accepts]: Start accepts. Automaton has 10933 states and 36071 transitions. Word has length 100 [2018-12-09 07:48:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:37,675 INFO L480 AbstractCegarLoop]: Abstraction has 10933 states and 36071 transitions. [2018-12-09 07:48:37,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 10933 states and 36071 transitions. [2018-12-09 07:48:37,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:37,684 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:37,684 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:37,684 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:37,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:37,684 INFO L82 PathProgramCache]: Analyzing trace with hash -497599059, now seen corresponding path program 1 times [2018-12-09 07:48:37,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:37,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:37,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:37,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:37,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:37,740 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:37,740 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:48:37,740 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:37,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:48:37,782 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:48:37,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:37,782 INFO L87 Difference]: Start difference. First operand 10933 states and 36071 transitions. Second operand 7 states. [2018-12-09 07:48:38,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:38,191 INFO L93 Difference]: Finished difference Result 17605 states and 56946 transitions. [2018-12-09 07:48:38,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-09 07:48:38,191 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 07:48:38,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:38,212 INFO L225 Difference]: With dead ends: 17605 [2018-12-09 07:48:38,212 INFO L226 Difference]: Without dead ends: 17477 [2018-12-09 07:48:38,212 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2018-12-09 07:48:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17477 states. [2018-12-09 07:48:38,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17477 to 13761. [2018-12-09 07:48:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13761 states. [2018-12-09 07:48:38,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13761 states to 13761 states and 45019 transitions. [2018-12-09 07:48:38,368 INFO L78 Accepts]: Start accepts. Automaton has 13761 states and 45019 transitions. Word has length 102 [2018-12-09 07:48:38,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:38,368 INFO L480 AbstractCegarLoop]: Abstraction has 13761 states and 45019 transitions. [2018-12-09 07:48:38,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:48:38,368 INFO L276 IsEmpty]: Start isEmpty. Operand 13761 states and 45019 transitions. [2018-12-09 07:48:38,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:38,380 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:38,380 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:38,380 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:38,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:38,381 INFO L82 PathProgramCache]: Analyzing trace with hash 747165422, now seen corresponding path program 1 times [2018-12-09 07:48:38,381 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:38,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:38,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:38,382 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:38,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:38,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:38,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:38,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:38,429 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:38,430 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:38,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:38,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:38,430 INFO L87 Difference]: Start difference. First operand 13761 states and 45019 transitions. Second operand 6 states. [2018-12-09 07:48:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:38,550 INFO L93 Difference]: Finished difference Result 14001 states and 45411 transitions. [2018-12-09 07:48:38,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:48:38,550 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 07:48:38,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:38,572 INFO L225 Difference]: With dead ends: 14001 [2018-12-09 07:48:38,572 INFO L226 Difference]: Without dead ends: 14001 [2018-12-09 07:48:38,573 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2018-12-09 07:48:38,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14001 states. [2018-12-09 07:48:38,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14001 to 13611. [2018-12-09 07:48:38,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13611 states. [2018-12-09 07:48:38,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13611 states to 13611 states and 44349 transitions. [2018-12-09 07:48:38,716 INFO L78 Accepts]: Start accepts. Automaton has 13611 states and 44349 transitions. Word has length 102 [2018-12-09 07:48:38,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:38,717 INFO L480 AbstractCegarLoop]: Abstraction has 13611 states and 44349 transitions. [2018-12-09 07:48:38,717 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:38,717 INFO L276 IsEmpty]: Start isEmpty. Operand 13611 states and 44349 transitions. [2018-12-09 07:48:38,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:38,728 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:38,728 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:38,728 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:38,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:38,728 INFO L82 PathProgramCache]: Analyzing trace with hash -167833298, now seen corresponding path program 1 times [2018-12-09 07:48:38,728 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:38,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:38,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:38,729 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:38,777 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:38,777 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:38,777 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:38,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:38,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:38,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:38,777 INFO L87 Difference]: Start difference. First operand 13611 states and 44349 transitions. Second operand 6 states. [2018-12-09 07:48:38,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:38,922 INFO L93 Difference]: Finished difference Result 15970 states and 51436 transitions. [2018-12-09 07:48:38,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:48:38,922 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 07:48:38,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:38,939 INFO L225 Difference]: With dead ends: 15970 [2018-12-09 07:48:38,939 INFO L226 Difference]: Without dead ends: 15970 [2018-12-09 07:48:38,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-09 07:48:38,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15970 states. [2018-12-09 07:48:39,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15970 to 13806. [2018-12-09 07:48:39,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2018-12-09 07:48:39,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 44760 transitions. [2018-12-09 07:48:39,088 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 44760 transitions. Word has length 102 [2018-12-09 07:48:39,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:39,088 INFO L480 AbstractCegarLoop]: Abstraction has 13806 states and 44760 transitions. [2018-12-09 07:48:39,088 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:39,088 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 44760 transitions. [2018-12-09 07:48:39,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:39,100 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:39,100 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:39,100 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:39,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:39,100 INFO L82 PathProgramCache]: Analyzing trace with hash -597334546, now seen corresponding path program 2 times [2018-12-09 07:48:39,100 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:39,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:39,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:39,101 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:39,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:39,152 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:39,152 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:48:39,152 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:39,153 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:48:39,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:48:39,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:39,153 INFO L87 Difference]: Start difference. First operand 13806 states and 44760 transitions. Second operand 7 states. [2018-12-09 07:48:39,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:39,347 INFO L93 Difference]: Finished difference Result 13851 states and 44866 transitions. [2018-12-09 07:48:39,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-09 07:48:39,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 07:48:39,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:39,362 INFO L225 Difference]: With dead ends: 13851 [2018-12-09 07:48:39,362 INFO L226 Difference]: Without dead ends: 13851 [2018-12-09 07:48:39,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-09 07:48:39,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13851 states. [2018-12-09 07:48:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13851 to 13806. [2018-12-09 07:48:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13806 states. [2018-12-09 07:48:39,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13806 states to 13806 states and 44745 transitions. [2018-12-09 07:48:39,496 INFO L78 Accepts]: Start accepts. Automaton has 13806 states and 44745 transitions. Word has length 102 [2018-12-09 07:48:39,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:39,496 INFO L480 AbstractCegarLoop]: Abstraction has 13806 states and 44745 transitions. [2018-12-09 07:48:39,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:48:39,496 INFO L276 IsEmpty]: Start isEmpty. Operand 13806 states and 44745 transitions. [2018-12-09 07:48:39,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:39,507 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:39,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, 1, 1] [2018-12-09 07:48:39,507 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:39,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:39,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1904809647, now seen corresponding path program 1 times [2018-12-09 07:48:39,508 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:39,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:39,509 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:48:39,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:39,509 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:39,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:39,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:39,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:39,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:48:39,567 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:39,567 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:48:39,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:48:39,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:39,567 INFO L87 Difference]: Start difference. First operand 13806 states and 44745 transitions. Second operand 7 states. [2018-12-09 07:48:39,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:39,766 INFO L93 Difference]: Finished difference Result 18394 states and 60743 transitions. [2018-12-09 07:48:39,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-09 07:48:39,767 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 07:48:39,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:39,787 INFO L225 Difference]: With dead ends: 18394 [2018-12-09 07:48:39,787 INFO L226 Difference]: Without dead ends: 18394 [2018-12-09 07:48:39,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2018-12-09 07:48:39,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18394 states. [2018-12-09 07:48:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18394 to 11118. [2018-12-09 07:48:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11118 states. [2018-12-09 07:48:39,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11118 states to 11118 states and 36214 transitions. [2018-12-09 07:48:39,926 INFO L78 Accepts]: Start accepts. Automaton has 11118 states and 36214 transitions. Word has length 102 [2018-12-09 07:48:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:39,926 INFO L480 AbstractCegarLoop]: Abstraction has 11118 states and 36214 transitions. [2018-12-09 07:48:39,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:48:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 11118 states and 36214 transitions. [2018-12-09 07:48:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:39,935 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:39,935 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:39,935 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:39,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash 989810927, now seen corresponding path program 1 times [2018-12-09 07:48:39,936 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:39,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:39,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:39,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:39,937 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:39,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:39,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:39,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-09 07:48:39,979 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:39,979 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-09 07:48:39,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-09 07:48:39,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-09 07:48:39,980 INFO L87 Difference]: Start difference. First operand 11118 states and 36214 transitions. Second operand 5 states. [2018-12-09 07:48:40,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:40,127 INFO L93 Difference]: Finished difference Result 12910 states and 41974 transitions. [2018-12-09 07:48:40,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:48:40,127 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2018-12-09 07:48:40,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:40,140 INFO L225 Difference]: With dead ends: 12910 [2018-12-09 07:48:40,140 INFO L226 Difference]: Without dead ends: 12782 [2018-12-09 07:48:40,140 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:40,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12782 states. [2018-12-09 07:48:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12782 to 11310. [2018-12-09 07:48:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11310 states. [2018-12-09 07:48:40,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11310 states to 11310 states and 36774 transitions. [2018-12-09 07:48:40,251 INFO L78 Accepts]: Start accepts. Automaton has 11310 states and 36774 transitions. Word has length 102 [2018-12-09 07:48:40,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:40,251 INFO L480 AbstractCegarLoop]: Abstraction has 11310 states and 36774 transitions. [2018-12-09 07:48:40,251 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-09 07:48:40,251 INFO L276 IsEmpty]: Start isEmpty. Operand 11310 states and 36774 transitions. [2018-12-09 07:48:40,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:40,260 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:40,260 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:40,260 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:40,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:40,260 INFO L82 PathProgramCache]: Analyzing trace with hash -2060391888, now seen corresponding path program 1 times [2018-12-09 07:48:40,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:40,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:40,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:40,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:40,261 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:40,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:40,342 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:40,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-09 07:48:40,342 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:40,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-09 07:48:40,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-09 07:48:40,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-12-09 07:48:40,342 INFO L87 Difference]: Start difference. First operand 11310 states and 36774 transitions. Second operand 10 states. [2018-12-09 07:48:40,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:40,651 INFO L93 Difference]: Finished difference Result 21538 states and 70481 transitions. [2018-12-09 07:48:40,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 07:48:40,651 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 102 [2018-12-09 07:48:40,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:40,663 INFO L225 Difference]: With dead ends: 21538 [2018-12-09 07:48:40,663 INFO L226 Difference]: Without dead ends: 10650 [2018-12-09 07:48:40,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2018-12-09 07:48:40,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10650 states. [2018-12-09 07:48:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10650 to 10650. [2018-12-09 07:48:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10650 states. [2018-12-09 07:48:40,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10650 states to 10650 states and 34854 transitions. [2018-12-09 07:48:40,762 INFO L78 Accepts]: Start accepts. Automaton has 10650 states and 34854 transitions. Word has length 102 [2018-12-09 07:48:40,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:40,762 INFO L480 AbstractCegarLoop]: Abstraction has 10650 states and 34854 transitions. [2018-12-09 07:48:40,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-09 07:48:40,762 INFO L276 IsEmpty]: Start isEmpty. Operand 10650 states and 34854 transitions. [2018-12-09 07:48:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:40,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:40,769 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:40,770 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:40,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1870798028, now seen corresponding path program 2 times [2018-12-09 07:48:40,770 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:40,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:40,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:40,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:40,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:40,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:40,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:40,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-09 07:48:40,827 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:40,827 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 07:48:40,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 07:48:40,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:40,827 INFO L87 Difference]: Start difference. First operand 10650 states and 34854 transitions. Second operand 7 states. [2018-12-09 07:48:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:41,020 INFO L93 Difference]: Finished difference Result 17900 states and 59437 transitions. [2018-12-09 07:48:41,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 07:48:41,021 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2018-12-09 07:48:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:41,030 INFO L225 Difference]: With dead ends: 17900 [2018-12-09 07:48:41,030 INFO L226 Difference]: Without dead ends: 7461 [2018-12-09 07:48:41,030 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2018-12-09 07:48:41,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7461 states. [2018-12-09 07:48:41,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7461 to 7461. [2018-12-09 07:48:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7461 states. [2018-12-09 07:48:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 25135 transitions. [2018-12-09 07:48:41,099 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 25135 transitions. Word has length 102 [2018-12-09 07:48:41,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:41,099 INFO L480 AbstractCegarLoop]: Abstraction has 7461 states and 25135 transitions. [2018-12-09 07:48:41,099 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 07:48:41,099 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 25135 transitions. [2018-12-09 07:48:41,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:41,104 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:41,105 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:41,105 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:41,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:41,105 INFO L82 PathProgramCache]: Analyzing trace with hash -1240521863, now seen corresponding path program 1 times [2018-12-09 07:48:41,105 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:41,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:41,106 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:48:41,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:41,106 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:41,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:41,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:41,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:41,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 07:48:41,169 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:41,169 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 07:48:41,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 07:48:41,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-09 07:48:41,169 INFO L87 Difference]: Start difference. First operand 7461 states and 25135 transitions. Second operand 6 states. [2018-12-09 07:48:41,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:41,222 INFO L93 Difference]: Finished difference Result 7805 states and 26005 transitions. [2018-12-09 07:48:41,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 07:48:41,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2018-12-09 07:48:41,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:41,231 INFO L225 Difference]: With dead ends: 7805 [2018-12-09 07:48:41,231 INFO L226 Difference]: Without dead ends: 7725 [2018-12-09 07:48:41,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-12-09 07:48:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7725 states. [2018-12-09 07:48:41,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7725 to 7429. [2018-12-09 07:48:41,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7429 states. [2018-12-09 07:48:41,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7429 states to 7429 states and 25007 transitions. [2018-12-09 07:48:41,301 INFO L78 Accepts]: Start accepts. Automaton has 7429 states and 25007 transitions. Word has length 102 [2018-12-09 07:48:41,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:41,301 INFO L480 AbstractCegarLoop]: Abstraction has 7429 states and 25007 transitions. [2018-12-09 07:48:41,301 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 07:48:41,301 INFO L276 IsEmpty]: Start isEmpty. Operand 7429 states and 25007 transitions. [2018-12-09 07:48:41,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:41,307 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:41,308 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:41,308 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:41,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:41,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1689218502, now seen corresponding path program 3 times [2018-12-09 07:48:41,308 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:41,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 07:48:41,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:41,309 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:41,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 07:48:41,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 07:48:41,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 07:48:41,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-12-09 07:48:41,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 07:48:41,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-09 07:48:41,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-09 07:48:41,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-12-09 07:48:41,385 INFO L87 Difference]: Start difference. First operand 7429 states and 25007 transitions. Second operand 12 states. [2018-12-09 07:48:41,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 07:48:41,731 INFO L93 Difference]: Finished difference Result 14457 states and 48810 transitions. [2018-12-09 07:48:41,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-09 07:48:41,732 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 102 [2018-12-09 07:48:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 07:48:41,743 INFO L225 Difference]: With dead ends: 14457 [2018-12-09 07:48:41,743 INFO L226 Difference]: Without dead ends: 9913 [2018-12-09 07:48:41,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=550, Unknown=0, NotChecked=0, Total=650 [2018-12-09 07:48:41,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9913 states. [2018-12-09 07:48:41,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9913 to 9305. [2018-12-09 07:48:41,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9305 states. [2018-12-09 07:48:41,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9305 states to 9305 states and 30650 transitions. [2018-12-09 07:48:41,831 INFO L78 Accepts]: Start accepts. Automaton has 9305 states and 30650 transitions. Word has length 102 [2018-12-09 07:48:41,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 07:48:41,832 INFO L480 AbstractCegarLoop]: Abstraction has 9305 states and 30650 transitions. [2018-12-09 07:48:41,832 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-09 07:48:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 9305 states and 30650 transitions. [2018-12-09 07:48:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-12-09 07:48:41,839 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 07:48:41,839 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 07:48:41,840 INFO L423 AbstractCegarLoop]: === Iteration 37 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 07:48:41,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 07:48:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash 1881348832, now seen corresponding path program 4 times [2018-12-09 07:48:41,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 07:48:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:41,841 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 07:48:41,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 07:48:41,841 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 07:48:41,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:48:41,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 07:48:41,878 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-09 07:48:41,948 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-09 07:48:41,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 07:48:41 BasicIcfg [2018-12-09 07:48:41,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 07:48:41,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 07:48:41,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 07:48:41,950 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 07:48:41,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 07:45:01" (3/4) ... [2018-12-09 07:48:41,953 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-09 07:48:42,024 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fa16f306-5aec-41b2-97b2-a61b06eebb34/bin-2019/utaipan/witness.graphml [2018-12-09 07:48:42,024 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 07:48:42,025 INFO L168 Benchmark]: Toolchain (without parser) took 221603.83 ms. Allocated memory was 1.0 GB in the beginning and 11.5 GB in the end (delta: 10.4 GB). Free memory was 945.9 MB in the beginning and 3.6 GB in the end (delta: -2.7 GB). Peak memory consumption was 7.7 GB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,026 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-09 07:48:42,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 352.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 43.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,027 INFO L168 Benchmark]: Boogie Preprocessor took 25.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,027 INFO L168 Benchmark]: RCFGBuilder took 395.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,027 INFO L168 Benchmark]: TraceAbstraction took 220709.17 ms. Allocated memory was 1.1 GB in the beginning and 11.5 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.7 GB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,027 INFO L168 Benchmark]: Witness Printer took 74.46 ms. Allocated memory is still 11.5 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2018-12-09 07:48:42,029 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 352.15 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 111.7 MB). Free memory was 945.9 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 34.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 43.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.98 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 395.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.5 MB). Peak memory consumption was 52.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 220709.17 ms. Allocated memory was 1.1 GB in the beginning and 11.5 GB in the end (delta: 10.3 GB). Free memory was 1.0 GB in the beginning and 3.7 GB in the end (delta: -2.6 GB). Peak memory consumption was 7.7 GB. Max. memory is 11.5 GB. * Witness Printer took 74.46 ms. Allocated memory is still 11.5 GB. Free memory was 3.7 GB in the beginning and 3.6 GB in the end (delta: 28.6 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L672] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L674] -1 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L675] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L676] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L678] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L680] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L681] -1 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L682] -1 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L683] -1 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L684] -1 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L685] -1 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L686] -1 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L687] -1 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L688] -1 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L689] -1 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L690] -1 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L691] -1 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L692] -1 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L693] -1 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L694] -1 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L695] -1 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L696] -1 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L698] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L699] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L700] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] -1 pthread_t t1506; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L777] FCALL, FORK -1 pthread_create(&t1506, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L778] -1 pthread_t t1507; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L779] FCALL, FORK -1 pthread_create(&t1507, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] -1 pthread_t t1508; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] FCALL, FORK -1 pthread_create(&t1508, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L739] 0 y$w_buff1 = y$w_buff0 [L740] 0 y$w_buff0 = 2 [L741] 0 y$w_buff1_used = y$w_buff0_used [L742] 0 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L744] 0 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 0 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 0 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 0 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 0 y$r_buff0_thd3 = (_Bool)1 [L751] 0 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L704] 1 z = 1 [L707] 1 x = 1 [L712] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L754] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L719] 2 x = 2 [L722] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L725] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=1, z=1] [L725] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L726] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L726] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L727] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L727] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L754] 0 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L728] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=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 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L728] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L755] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L755] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L757] 0 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L758] EXPR 0 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L758] 0 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L761] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L732] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] -1 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L787] -1 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L788] -1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L789] -1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L790] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L790] -1 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] EXPR -1 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] -1 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L794] -1 weak$$choice0 = __VERIFIER_nondet_pointer() [L795] -1 weak$$choice2 = __VERIFIER_nondet_pointer() [L796] -1 y$flush_delayed = weak$$choice2 [L797] -1 y$mem_tmp = y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] EXPR -1 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L798] -1 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L799] EXPR -1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] -1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L800] EXPR -1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] -1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L801] EXPR -1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] -1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L802] EXPR -1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] -1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] EXPR -1 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] -1 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L804] EXPR -1 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L804] -1 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L805] -1 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] EXPR -1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] -1 y = y$flush_delayed ? y$mem_tmp : y [L807] -1 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 198 locations, 3 error locations. UNSAFE Result, 220.6s OverallTime, 37 OverallIterations, 1 TraceHistogramMax, 64.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9291 SDtfs, 10554 SDslu, 21956 SDs, 0 SdLazy, 7987 SolverSat, 547 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 109 SyntacticMatches, 17 SemanticMatches, 259 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=542807occurred in iteration=12, 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: 135.2s AutomataMinimizationTime, 36 MinimizatonAttempts, 1448700 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 3175 NumberOfCodeBlocks, 3175 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 3037 ConstructedInterpolants, 0 QuantifiedInterpolants, 625466 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...