./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/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 3d287fce75dc873494b995778754ff1185af89eb .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-02 17:35:08,486 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 17:35:08,487 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 17:35:08,493 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 17:35:08,493 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 17:35:08,494 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 17:35:08,494 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 17:35:08,495 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 17:35:08,496 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 17:35:08,496 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 17:35:08,497 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 17:35:08,497 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 17:35:08,497 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 17:35:08,498 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 17:35:08,498 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 17:35:08,499 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 17:35:08,499 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 17:35:08,500 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 17:35:08,501 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 17:35:08,501 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 17:35:08,502 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 17:35:08,503 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 17:35:08,504 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 17:35:08,504 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 17:35:08,504 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 17:35:08,504 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 17:35:08,505 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 17:35:08,505 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 17:35:08,506 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 17:35:08,506 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 17:35:08,506 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 17:35:08,507 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 17:35:08,507 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 17:35:08,507 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 17:35:08,507 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 17:35:08,508 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 17:35:08,508 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 17:35:08,515 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 17:35:08,515 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 17:35:08,516 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 17:35:08,516 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 17:35:08,516 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 17:35:08,517 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 17:35:08,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 17:35:08,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 17:35:08,518 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 17:35:08,518 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 17:35:08,519 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 17:35:08,519 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 17:35:08,519 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 17:35:08,519 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 17:35:08,519 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 17:35:08,519 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 17:35:08,519 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_1cf589a2-c789-4ac2-acf3-b768822223c6/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 -> 3d287fce75dc873494b995778754ff1185af89eb [2018-12-02 17:35:08,536 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 17:35:08,544 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 17:35:08,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 17:35:08,547 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 17:35:08,547 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 17:35:08,548 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/../../sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2018-12-02 17:35:08,581 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/data/f0320fb81/f030be676c8d46afadadd69307a6cd62/FLAG63ffa2461 [2018-12-02 17:35:08,969 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 17:35:08,969 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/sv-benchmarks/c/pthread-wmm/mix009_power.oepc_false-unreach-call.i [2018-12-02 17:35:08,976 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/data/f0320fb81/f030be676c8d46afadadd69307a6cd62/FLAG63ffa2461 [2018-12-02 17:35:09,335 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/data/f0320fb81/f030be676c8d46afadadd69307a6cd62 [2018-12-02 17:35:09,342 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 17:35:09,344 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 17:35:09,346 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 17:35:09,347 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 17:35:09,353 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 17:35:09,355 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,360 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ee6021e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09, skipping insertion in model container [2018-12-02 17:35:09,360 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,369 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 17:35:09,390 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 17:35:09,568 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:35:09,576 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 17:35:09,703 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 17:35:09,741 INFO L195 MainTranslator]: Completed translation [2018-12-02 17:35:09,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09 WrapperNode [2018-12-02 17:35:09,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 17:35:09,742 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 17:35:09,742 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 17:35:09,742 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 17:35:09,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,758 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 17:35:09,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 17:35:09,775 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 17:35:09,775 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 17:35:09,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,781 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,783 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,789 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,793 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... [2018-12-02 17:35:09,795 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 17:35:09,795 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 17:35:09,795 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 17:35:09,795 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 17:35:09,796 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/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-02 17:35:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-02 17:35:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-02 17:35:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2018-12-02 17:35:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-02 17:35:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2018-12-02 17:35:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2018-12-02 17:35:09,827 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2018-12-02 17:35:09,827 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2018-12-02 17:35:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2018-12-02 17:35:09,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 17:35:09,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 17:35:09,828 WARN L198 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2018-12-02 17:35:10,127 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 17:35:10,127 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-02 17:35:10,128 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:35:10 BoogieIcfgContainer [2018-12-02 17:35:10,128 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 17:35:10,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 17:35:10,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 17:35:10,130 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 17:35:10,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 05:35:09" (1/3) ... [2018-12-02 17:35:10,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7517eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:35:10, skipping insertion in model container [2018-12-02 17:35:10,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 05:35:09" (2/3) ... [2018-12-02 17:35:10,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7517eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 05:35:10, skipping insertion in model container [2018-12-02 17:35:10,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:35:10" (3/3) ... [2018-12-02 17:35:10,132 INFO L112 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc_false-unreach-call.i [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,156 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,157 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,158 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,159 WARN L317 ript$VariableManager]: TermVariabe |Thread0_P0_#t~nondet9.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,160 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet11.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,161 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,162 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,163 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,164 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,165 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,166 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,167 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,168 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,169 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,170 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,171 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,172 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,173 WARN L317 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet39.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-02 17:35:10,179 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2018-12-02 17:35:10,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 17:35:10,185 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-12-02 17:35:10,194 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-12-02 17:35:10,209 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 17:35:10,209 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 17:35:10,209 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 17:35:10,209 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 17:35:10,209 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 17:35:10,209 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 17:35:10,209 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 17:35:10,209 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 17:35:10,215 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145places, 183 transitions [2018-12-02 17:35:11,722 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 34809 states. [2018-12-02 17:35:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 34809 states. [2018-12-02 17:35:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 17:35:11,729 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:11,729 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] [2018-12-02 17:35:11,731 INFO L423 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:11,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:11,735 INFO L82 PathProgramCache]: Analyzing trace with hash 787354290, now seen corresponding path program 1 times [2018-12-02 17:35:11,736 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:11,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:11,772 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:11,772 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:11,772 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:11,871 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-02 17:35:11,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:11,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:11,873 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:11,876 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:11,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:11,887 INFO L87 Difference]: Start difference. First operand 34809 states. Second operand 4 states. [2018-12-02 17:35:12,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:12,329 INFO L93 Difference]: Finished difference Result 60793 states and 234496 transitions. [2018-12-02 17:35:12,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:35:12,331 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-12-02 17:35:12,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:12,491 INFO L225 Difference]: With dead ends: 60793 [2018-12-02 17:35:12,491 INFO L226 Difference]: Without dead ends: 44273 [2018-12-02 17:35:12,492 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-02 17:35:12,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44273 states. [2018-12-02 17:35:13,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44273 to 27341. [2018-12-02 17:35:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27341 states. [2018-12-02 17:35:13,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27341 states to 27341 states and 105502 transitions. [2018-12-02 17:35:13,228 INFO L78 Accepts]: Start accepts. Automaton has 27341 states and 105502 transitions. Word has length 36 [2018-12-02 17:35:13,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:13,228 INFO L480 AbstractCegarLoop]: Abstraction has 27341 states and 105502 transitions. [2018-12-02 17:35:13,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:13,228 INFO L276 IsEmpty]: Start isEmpty. Operand 27341 states and 105502 transitions. [2018-12-02 17:35:13,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-12-02 17:35:13,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:13,233 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] [2018-12-02 17:35:13,233 INFO L423 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:13,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:13,233 INFO L82 PathProgramCache]: Analyzing trace with hash 901056929, now seen corresponding path program 1 times [2018-12-02 17:35:13,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:13,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:13,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:13,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:13,236 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:13,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:13,289 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-02 17:35:13,289 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:13,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:13,289 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:13,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:13,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:13,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:13,290 INFO L87 Difference]: Start difference. First operand 27341 states and 105502 transitions. Second operand 4 states. [2018-12-02 17:35:13,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:13,379 INFO L93 Difference]: Finished difference Result 8531 states and 28347 transitions. [2018-12-02 17:35:13,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:35:13,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2018-12-02 17:35:13,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:13,405 INFO L225 Difference]: With dead ends: 8531 [2018-12-02 17:35:13,405 INFO L226 Difference]: Without dead ends: 7469 [2018-12-02 17:35:13,406 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-02 17:35:13,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7469 states. [2018-12-02 17:35:13,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7469 to 7469. [2018-12-02 17:35:13,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7469 states. [2018-12-02 17:35:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7469 states to 7469 states and 24639 transitions. [2018-12-02 17:35:13,494 INFO L78 Accepts]: Start accepts. Automaton has 7469 states and 24639 transitions. Word has length 48 [2018-12-02 17:35:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:13,494 INFO L480 AbstractCegarLoop]: Abstraction has 7469 states and 24639 transitions. [2018-12-02 17:35:13,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 7469 states and 24639 transitions. [2018-12-02 17:35:13,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 17:35:13,495 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:13,496 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:35:13,496 INFO L423 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:13,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:13,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2027995578, now seen corresponding path program 1 times [2018-12-02 17:35:13,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:13,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:13,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:13,499 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:13,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:13,541 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-02 17:35:13,541 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:13,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:35:13,542 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:13,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:35:13,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:35:13,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:13,542 INFO L87 Difference]: Start difference. First operand 7469 states and 24639 transitions. Second operand 5 states. [2018-12-02 17:35:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:13,757 INFO L93 Difference]: Finished difference Result 14001 states and 45808 transitions. [2018-12-02 17:35:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:35:13,757 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2018-12-02 17:35:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:13,800 INFO L225 Difference]: With dead ends: 14001 [2018-12-02 17:35:13,800 INFO L226 Difference]: Without dead ends: 13933 [2018-12-02 17:35:13,800 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-02 17:35:13,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13933 states. [2018-12-02 17:35:13,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13933 to 9444. [2018-12-02 17:35:13,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9444 states. [2018-12-02 17:35:13,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9444 states to 9444 states and 30545 transitions. [2018-12-02 17:35:13,999 INFO L78 Accepts]: Start accepts. Automaton has 9444 states and 30545 transitions. Word has length 49 [2018-12-02 17:35:14,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:14,000 INFO L480 AbstractCegarLoop]: Abstraction has 9444 states and 30545 transitions. [2018-12-02 17:35:14,000 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:35:14,000 INFO L276 IsEmpty]: Start isEmpty. Operand 9444 states and 30545 transitions. [2018-12-02 17:35:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-02 17:35:14,001 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:14,001 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-02 17:35:14,001 INFO L423 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:14,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:14,001 INFO L82 PathProgramCache]: Analyzing trace with hash -39217920, now seen corresponding path program 1 times [2018-12-02 17:35:14,001 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:14,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,003 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:14,029 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-02 17:35:14,029 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:14,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:35:14,029 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:14,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:35:14,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:35:14,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:35:14,030 INFO L87 Difference]: Start difference. First operand 9444 states and 30545 transitions. Second operand 3 states. [2018-12-02 17:35:14,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:14,086 INFO L93 Difference]: Finished difference Result 13282 states and 42644 transitions. [2018-12-02 17:35:14,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:35:14,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-02 17:35:14,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:14,103 INFO L225 Difference]: With dead ends: 13282 [2018-12-02 17:35:14,104 INFO L226 Difference]: Without dead ends: 13282 [2018-12-02 17:35:14,104 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-02 17:35:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13282 states. [2018-12-02 17:35:14,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13282 to 9848. [2018-12-02 17:35:14,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9848 states. [2018-12-02 17:35:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9848 states to 9848 states and 31511 transitions. [2018-12-02 17:35:14,223 INFO L78 Accepts]: Start accepts. Automaton has 9848 states and 31511 transitions. Word has length 51 [2018-12-02 17:35:14,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:14,223 INFO L480 AbstractCegarLoop]: Abstraction has 9848 states and 31511 transitions. [2018-12-02 17:35:14,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:35:14,223 INFO L276 IsEmpty]: Start isEmpty. Operand 9848 states and 31511 transitions. [2018-12-02 17:35:14,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 17:35:14,224 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:14,225 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] [2018-12-02 17:35:14,225 INFO L423 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:14,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:14,225 INFO L82 PathProgramCache]: Analyzing trace with hash -557670517, now seen corresponding path program 1 times [2018-12-02 17:35:14,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:14,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:14,302 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-02 17:35:14,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:14,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:35:14,302 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:14,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:35:14,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:35:14,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:35:14,303 INFO L87 Difference]: Start difference. First operand 9848 states and 31511 transitions. Second operand 6 states. [2018-12-02 17:35:14,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:14,534 INFO L93 Difference]: Finished difference Result 14206 states and 45067 transitions. [2018-12-02 17:35:14,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:35:14,534 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2018-12-02 17:35:14,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:14,551 INFO L225 Difference]: With dead ends: 14206 [2018-12-02 17:35:14,551 INFO L226 Difference]: Without dead ends: 14134 [2018-12-02 17:35:14,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-12-02 17:35:14,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14134 states. [2018-12-02 17:35:14,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14134 to 10852. [2018-12-02 17:35:14,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10852 states. [2018-12-02 17:35:14,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10852 states to 10852 states and 34566 transitions. [2018-12-02 17:35:14,674 INFO L78 Accepts]: Start accepts. Automaton has 10852 states and 34566 transitions. Word has length 55 [2018-12-02 17:35:14,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:14,674 INFO L480 AbstractCegarLoop]: Abstraction has 10852 states and 34566 transitions. [2018-12-02 17:35:14,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:35:14,674 INFO L276 IsEmpty]: Start isEmpty. Operand 10852 states and 34566 transitions. [2018-12-02 17:35:14,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 17:35:14,677 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:14,677 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] [2018-12-02 17:35:14,677 INFO L423 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:14,678 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:14,678 INFO L82 PathProgramCache]: Analyzing trace with hash -3940633, now seen corresponding path program 1 times [2018-12-02 17:35:14,678 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,679 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:14,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,679 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:14,720 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-02 17:35:14,720 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:14,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:14,720 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:14,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:14,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:14,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:14,720 INFO L87 Difference]: Start difference. First operand 10852 states and 34566 transitions. Second operand 4 states. [2018-12-02 17:35:14,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:14,822 INFO L93 Difference]: Finished difference Result 12399 states and 39575 transitions. [2018-12-02 17:35:14,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:35:14,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2018-12-02 17:35:14,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:14,836 INFO L225 Difference]: With dead ends: 12399 [2018-12-02 17:35:14,836 INFO L226 Difference]: Without dead ends: 12399 [2018-12-02 17:35:14,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12399 states. [2018-12-02 17:35:14,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12399 to 11372. [2018-12-02 17:35:14,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11372 states. [2018-12-02 17:35:14,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11372 states to 11372 states and 36239 transitions. [2018-12-02 17:35:14,965 INFO L78 Accepts]: Start accepts. Automaton has 11372 states and 36239 transitions. Word has length 63 [2018-12-02 17:35:14,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:14,965 INFO L480 AbstractCegarLoop]: Abstraction has 11372 states and 36239 transitions. [2018-12-02 17:35:14,965 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:14,965 INFO L276 IsEmpty]: Start isEmpty. Operand 11372 states and 36239 transitions. [2018-12-02 17:35:14,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-02 17:35:14,969 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:14,969 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:35:14,969 INFO L423 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:14,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:14,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1738869702, now seen corresponding path program 1 times [2018-12-02 17:35:14,970 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,971 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:14,971 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:14,971 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:14,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:15,027 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-02 17:35:15,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:15,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:35:15,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:15,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:35:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:35:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:35:15,028 INFO L87 Difference]: Start difference. First operand 11372 states and 36239 transitions. Second operand 6 states. [2018-12-02 17:35:15,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:15,370 INFO L93 Difference]: Finished difference Result 20972 states and 66489 transitions. [2018-12-02 17:35:15,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:35:15,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-02 17:35:15,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:15,393 INFO L225 Difference]: With dead ends: 20972 [2018-12-02 17:35:15,393 INFO L226 Difference]: Without dead ends: 20901 [2018-12-02 17:35:15,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:35:15,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20901 states. [2018-12-02 17:35:15,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20901 to 13758. [2018-12-02 17:35:15,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13758 states. [2018-12-02 17:35:15,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13758 states to 13758 states and 43283 transitions. [2018-12-02 17:35:15,565 INFO L78 Accepts]: Start accepts. Automaton has 13758 states and 43283 transitions. Word has length 63 [2018-12-02 17:35:15,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:15,566 INFO L480 AbstractCegarLoop]: Abstraction has 13758 states and 43283 transitions. [2018-12-02 17:35:15,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:35:15,566 INFO L276 IsEmpty]: Start isEmpty. Operand 13758 states and 43283 transitions. [2018-12-02 17:35:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 17:35:15,571 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:15,571 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-02 17:35:15,571 INFO L423 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:15,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash 81708496, now seen corresponding path program 1 times [2018-12-02 17:35:15,572 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:15,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:15,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:15,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:15,574 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:15,617 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-02 17:35:15,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:15,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:15,617 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:15,617 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:15,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:15,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:15,618 INFO L87 Difference]: Start difference. First operand 13758 states and 43283 transitions. Second operand 4 states. [2018-12-02 17:35:15,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:15,858 INFO L93 Difference]: Finished difference Result 19950 states and 63167 transitions. [2018-12-02 17:35:15,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:35:15,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 17:35:15,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:15,883 INFO L225 Difference]: With dead ends: 19950 [2018-12-02 17:35:15,883 INFO L226 Difference]: Without dead ends: 19950 [2018-12-02 17:35:15,883 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-02 17:35:15,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19950 states. [2018-12-02 17:35:16,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19950 to 17922. [2018-12-02 17:35:16,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17922 states. [2018-12-02 17:35:16,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17922 states to 17922 states and 57082 transitions. [2018-12-02 17:35:16,081 INFO L78 Accepts]: Start accepts. Automaton has 17922 states and 57082 transitions. Word has length 67 [2018-12-02 17:35:16,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:16,081 INFO L480 AbstractCegarLoop]: Abstraction has 17922 states and 57082 transitions. [2018-12-02 17:35:16,081 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:16,081 INFO L276 IsEmpty]: Start isEmpty. Operand 17922 states and 57082 transitions. [2018-12-02 17:35:16,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 17:35:16,085 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:16,086 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-02 17:35:16,086 INFO L423 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:16,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:16,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1725745967, now seen corresponding path program 1 times [2018-12-02 17:35:16,086 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:16,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:16,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:16,087 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:16,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:35:16,122 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:16,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:16,122 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:16,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:16,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:16,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:16,122 INFO L87 Difference]: Start difference. First operand 17922 states and 57082 transitions. Second operand 4 states. [2018-12-02 17:35:16,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:16,306 INFO L93 Difference]: Finished difference Result 22122 states and 69359 transitions. [2018-12-02 17:35:16,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:35:16,306 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2018-12-02 17:35:16,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:16,330 INFO L225 Difference]: With dead ends: 22122 [2018-12-02 17:35:16,330 INFO L226 Difference]: Without dead ends: 22122 [2018-12-02 17:35:16,330 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:16,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22122 states. [2018-12-02 17:35:16,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22122 to 20008. [2018-12-02 17:35:16,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20008 states. [2018-12-02 17:35:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20008 states to 20008 states and 63081 transitions. [2018-12-02 17:35:16,604 INFO L78 Accepts]: Start accepts. Automaton has 20008 states and 63081 transitions. Word has length 67 [2018-12-02 17:35:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:16,604 INFO L480 AbstractCegarLoop]: Abstraction has 20008 states and 63081 transitions. [2018-12-02 17:35:16,605 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:16,605 INFO L276 IsEmpty]: Start isEmpty. Operand 20008 states and 63081 transitions. [2018-12-02 17:35:16,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 17:35:16,610 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:16,610 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-02 17:35:16,610 INFO L423 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:16,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:16,610 INFO L82 PathProgramCache]: Analyzing trace with hash 492011986, now seen corresponding path program 1 times [2018-12-02 17:35:16,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:16,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:16,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:16,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:16,611 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:16,632 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-02 17:35:16,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:16,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:35:16,633 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:16,633 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:35:16,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:35:16,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:35:16,633 INFO L87 Difference]: Start difference. First operand 20008 states and 63081 transitions. Second operand 3 states. [2018-12-02 17:35:16,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:16,787 INFO L93 Difference]: Finished difference Result 20728 states and 65064 transitions. [2018-12-02 17:35:16,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:35:16,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2018-12-02 17:35:16,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:16,810 INFO L225 Difference]: With dead ends: 20728 [2018-12-02 17:35:16,810 INFO L226 Difference]: Without dead ends: 20728 [2018-12-02 17:35:16,811 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-02 17:35:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20728 states. [2018-12-02 17:35:16,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20728 to 20404. [2018-12-02 17:35:16,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20404 states. [2018-12-02 17:35:17,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20404 states to 20404 states and 64159 transitions. [2018-12-02 17:35:17,012 INFO L78 Accepts]: Start accepts. Automaton has 20404 states and 64159 transitions. Word has length 67 [2018-12-02 17:35:17,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:17,012 INFO L480 AbstractCegarLoop]: Abstraction has 20404 states and 64159 transitions. [2018-12-02 17:35:17,012 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:35:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 20404 states and 64159 transitions. [2018-12-02 17:35:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:17,018 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:17,018 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] [2018-12-02 17:35:17,019 INFO L423 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:17,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:17,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2096525335, now seen corresponding path program 1 times [2018-12-02 17:35:17,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:17,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:17,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:17,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:17,020 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:17,040 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-02 17:35:17,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:17,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:35:17,040 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:17,040 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:35:17,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:35:17,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:35:17,040 INFO L87 Difference]: Start difference. First operand 20404 states and 64159 transitions. Second operand 3 states. [2018-12-02 17:35:17,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:17,174 INFO L93 Difference]: Finished difference Result 25692 states and 80601 transitions. [2018-12-02 17:35:17,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:35:17,174 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 17:35:17,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:17,205 INFO L225 Difference]: With dead ends: 25692 [2018-12-02 17:35:17,205 INFO L226 Difference]: Without dead ends: 25692 [2018-12-02 17:35:17,205 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-02 17:35:17,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25692 states. [2018-12-02 17:35:17,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25692 to 24788. [2018-12-02 17:35:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24788 states. [2018-12-02 17:35:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24788 states to 24788 states and 77827 transitions. [2018-12-02 17:35:17,469 INFO L78 Accepts]: Start accepts. Automaton has 24788 states and 77827 transitions. Word has length 69 [2018-12-02 17:35:17,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:17,469 INFO L480 AbstractCegarLoop]: Abstraction has 24788 states and 77827 transitions. [2018-12-02 17:35:17,470 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:35:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 24788 states and 77827 transitions. [2018-12-02 17:35:17,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:17,477 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:17,477 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] [2018-12-02 17:35:17,478 INFO L423 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:17,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:17,478 INFO L82 PathProgramCache]: Analyzing trace with hash -401490602, now seen corresponding path program 1 times [2018-12-02 17:35:17,478 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:17,479 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:17,479 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:17,479 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:17,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:17,523 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-02 17:35:17,523 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:17,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:35:17,523 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:17,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:35:17,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:35:17,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:35:17,524 INFO L87 Difference]: Start difference. First operand 24788 states and 77827 transitions. Second operand 6 states. [2018-12-02 17:35:18,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:18,234 INFO L93 Difference]: Finished difference Result 29944 states and 92734 transitions. [2018-12-02 17:35:18,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:35:18,235 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 17:35:18,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:18,277 INFO L225 Difference]: With dead ends: 29944 [2018-12-02 17:35:18,277 INFO L226 Difference]: Without dead ends: 29944 [2018-12-02 17:35:18,278 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-02 17:35:18,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29944 states. [2018-12-02 17:35:18,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29944 to 28268. [2018-12-02 17:35:18,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28268 states. [2018-12-02 17:35:18,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28268 states to 28268 states and 88152 transitions. [2018-12-02 17:35:18,630 INFO L78 Accepts]: Start accepts. Automaton has 28268 states and 88152 transitions. Word has length 69 [2018-12-02 17:35:18,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:18,630 INFO L480 AbstractCegarLoop]: Abstraction has 28268 states and 88152 transitions. [2018-12-02 17:35:18,630 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:35:18,630 INFO L276 IsEmpty]: Start isEmpty. Operand 28268 states and 88152 transitions. [2018-12-02 17:35:18,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:18,639 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:18,639 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 17:35:18,639 INFO L423 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:18,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:18,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1816267351, now seen corresponding path program 1 times [2018-12-02 17:35:18,639 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:18,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:18,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:18,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:18,641 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:18,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:18,713 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-02 17:35:18,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:18,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:35:18,714 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:18,714 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:35:18,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:35:18,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:35:18,714 INFO L87 Difference]: Start difference. First operand 28268 states and 88152 transitions. Second operand 6 states. [2018-12-02 17:35:19,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:19,030 INFO L93 Difference]: Finished difference Result 32012 states and 96857 transitions. [2018-12-02 17:35:19,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:35:19,031 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2018-12-02 17:35:19,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:19,065 INFO L225 Difference]: With dead ends: 32012 [2018-12-02 17:35:19,065 INFO L226 Difference]: Without dead ends: 32012 [2018-12-02 17:35:19,065 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-02 17:35:19,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32012 states. [2018-12-02 17:35:19,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32012 to 28944. [2018-12-02 17:35:19,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28944 states. [2018-12-02 17:35:19,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28944 states to 28944 states and 88943 transitions. [2018-12-02 17:35:19,384 INFO L78 Accepts]: Start accepts. Automaton has 28944 states and 88943 transitions. Word has length 69 [2018-12-02 17:35:19,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:19,384 INFO L480 AbstractCegarLoop]: Abstraction has 28944 states and 88943 transitions. [2018-12-02 17:35:19,384 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:35:19,384 INFO L276 IsEmpty]: Start isEmpty. Operand 28944 states and 88943 transitions. [2018-12-02 17:35:19,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:19,393 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:19,393 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] [2018-12-02 17:35:19,393 INFO L423 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:19,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:19,393 INFO L82 PathProgramCache]: Analyzing trace with hash 2027618264, now seen corresponding path program 1 times [2018-12-02 17:35:19,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:19,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:19,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:19,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:19,395 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:19,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:19,456 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-02 17:35:19,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:19,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:35:19,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:19,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:35:19,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:35:19,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:19,456 INFO L87 Difference]: Start difference. First operand 28944 states and 88943 transitions. Second operand 5 states. [2018-12-02 17:35:19,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:19,709 INFO L93 Difference]: Finished difference Result 35071 states and 107222 transitions. [2018-12-02 17:35:19,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:35:19,709 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 17:35:19,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:19,750 INFO L225 Difference]: With dead ends: 35071 [2018-12-02 17:35:19,750 INFO L226 Difference]: Without dead ends: 35071 [2018-12-02 17:35:19,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:19,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35071 states. [2018-12-02 17:35:20,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35071 to 31628. [2018-12-02 17:35:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31628 states. [2018-12-02 17:35:20,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31628 states to 31628 states and 96602 transitions. [2018-12-02 17:35:20,119 INFO L78 Accepts]: Start accepts. Automaton has 31628 states and 96602 transitions. Word has length 69 [2018-12-02 17:35:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:20,120 INFO L480 AbstractCegarLoop]: Abstraction has 31628 states and 96602 transitions. [2018-12-02 17:35:20,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:35:20,120 INFO L276 IsEmpty]: Start isEmpty. Operand 31628 states and 96602 transitions. [2018-12-02 17:35:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:20,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:20,128 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] [2018-12-02 17:35:20,128 INFO L423 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:20,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:20,129 INFO L82 PathProgramCache]: Analyzing trace with hash -279867272, now seen corresponding path program 1 times [2018-12-02 17:35:20,129 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:20,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:20,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:20,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:20,130 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:20,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:20,155 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-02 17:35:20,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:20,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:35:20,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:20,156 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:35:20,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:35:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:35:20,157 INFO L87 Difference]: Start difference. First operand 31628 states and 96602 transitions. Second operand 3 states. [2018-12-02 17:35:20,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:20,347 INFO L93 Difference]: Finished difference Result 42528 states and 128529 transitions. [2018-12-02 17:35:20,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:35:20,348 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 17:35:20,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:20,397 INFO L225 Difference]: With dead ends: 42528 [2018-12-02 17:35:20,397 INFO L226 Difference]: Without dead ends: 42528 [2018-12-02 17:35:20,397 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-02 17:35:20,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42528 states. [2018-12-02 17:35:20,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42528 to 32736. [2018-12-02 17:35:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32736 states. [2018-12-02 17:35:20,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32736 states to 32736 states and 99897 transitions. [2018-12-02 17:35:20,799 INFO L78 Accepts]: Start accepts. Automaton has 32736 states and 99897 transitions. Word has length 69 [2018-12-02 17:35:20,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:20,799 INFO L480 AbstractCegarLoop]: Abstraction has 32736 states and 99897 transitions. [2018-12-02 17:35:20,799 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:35:20,799 INFO L276 IsEmpty]: Start isEmpty. Operand 32736 states and 99897 transitions. [2018-12-02 17:35:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:20,807 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:20,807 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] [2018-12-02 17:35:20,808 INFO L423 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:20,808 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash -2087321735, now seen corresponding path program 1 times [2018-12-02 17:35:20,808 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:20,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:20,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:20,809 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:20,891 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-02 17:35:20,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:20,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:35:20,892 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:20,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:35:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:35:20,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:20,892 INFO L87 Difference]: Start difference. First operand 32736 states and 99897 transitions. Second operand 7 states. [2018-12-02 17:35:21,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:21,214 INFO L93 Difference]: Finished difference Result 29386 states and 84354 transitions. [2018-12-02 17:35:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:35:21,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2018-12-02 17:35:21,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:21,243 INFO L225 Difference]: With dead ends: 29386 [2018-12-02 17:35:21,244 INFO L226 Difference]: Without dead ends: 29386 [2018-12-02 17:35:21,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:35:21,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29386 states. [2018-12-02 17:35:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29386 to 24927. [2018-12-02 17:35:21,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24927 states. [2018-12-02 17:35:21,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24927 states to 24927 states and 71599 transitions. [2018-12-02 17:35:21,516 INFO L78 Accepts]: Start accepts. Automaton has 24927 states and 71599 transitions. Word has length 69 [2018-12-02 17:35:21,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:21,516 INFO L480 AbstractCegarLoop]: Abstraction has 24927 states and 71599 transitions. [2018-12-02 17:35:21,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:35:21,516 INFO L276 IsEmpty]: Start isEmpty. Operand 24927 states and 71599 transitions. [2018-12-02 17:35:21,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:21,523 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:21,523 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] [2018-12-02 17:35:21,523 INFO L423 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:21,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:21,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1199818054, now seen corresponding path program 1 times [2018-12-02 17:35:21,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,525 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:21,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,525 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:21,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:21,569 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-02 17:35:21,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:21,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:35:21,569 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:21,569 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:35:21,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:35:21,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:21,570 INFO L87 Difference]: Start difference. First operand 24927 states and 71599 transitions. Second operand 5 states. [2018-12-02 17:35:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:21,606 INFO L93 Difference]: Finished difference Result 7463 states and 17981 transitions. [2018-12-02 17:35:21,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 17:35:21,606 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2018-12-02 17:35:21,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:21,611 INFO L225 Difference]: With dead ends: 7463 [2018-12-02 17:35:21,611 INFO L226 Difference]: Without dead ends: 6138 [2018-12-02 17:35:21,611 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-02 17:35:21,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6138 states. [2018-12-02 17:35:21,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6138 to 5532. [2018-12-02 17:35:21,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2018-12-02 17:35:21,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 12870 transitions. [2018-12-02 17:35:21,663 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 12870 transitions. Word has length 69 [2018-12-02 17:35:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:21,663 INFO L480 AbstractCegarLoop]: Abstraction has 5532 states and 12870 transitions. [2018-12-02 17:35:21,663 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:35:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 12870 transitions. [2018-12-02 17:35:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 17:35:21,667 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:21,667 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] [2018-12-02 17:35:21,667 INFO L423 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:21,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:21,668 INFO L82 PathProgramCache]: Analyzing trace with hash 916580311, now seen corresponding path program 1 times [2018-12-02 17:35:21,668 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:21,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,669 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:21,684 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-02 17:35:21,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:21,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 17:35:21,685 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:21,685 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 17:35:21,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 17:35:21,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 17:35:21,685 INFO L87 Difference]: Start difference. First operand 5532 states and 12870 transitions. Second operand 3 states. [2018-12-02 17:35:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:21,709 INFO L93 Difference]: Finished difference Result 7168 states and 16476 transitions. [2018-12-02 17:35:21,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 17:35:21,710 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2018-12-02 17:35:21,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:21,714 INFO L225 Difference]: With dead ends: 7168 [2018-12-02 17:35:21,715 INFO L226 Difference]: Without dead ends: 7168 [2018-12-02 17:35:21,715 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-02 17:35:21,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7168 states. [2018-12-02 17:35:21,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7168 to 5471. [2018-12-02 17:35:21,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5471 states. [2018-12-02 17:35:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5471 states to 5471 states and 12410 transitions. [2018-12-02 17:35:21,758 INFO L78 Accepts]: Start accepts. Automaton has 5471 states and 12410 transitions. Word has length 69 [2018-12-02 17:35:21,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:21,759 INFO L480 AbstractCegarLoop]: Abstraction has 5471 states and 12410 transitions. [2018-12-02 17:35:21,759 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 17:35:21,759 INFO L276 IsEmpty]: Start isEmpty. Operand 5471 states and 12410 transitions. [2018-12-02 17:35:21,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 17:35:21,762 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:21,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-02 17:35:21,762 INFO L423 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:21,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:21,763 INFO L82 PathProgramCache]: Analyzing trace with hash -1596601910, now seen corresponding path program 1 times [2018-12-02 17:35:21,763 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:21,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:21,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,764 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:21,801 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-02 17:35:21,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:21,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:35:21,802 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:21,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:35:21,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:35:21,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:21,802 INFO L87 Difference]: Start difference. First operand 5471 states and 12410 transitions. Second operand 5 states. [2018-12-02 17:35:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:21,901 INFO L93 Difference]: Finished difference Result 6625 states and 15015 transitions. [2018-12-02 17:35:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 17:35:21,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2018-12-02 17:35:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:21,906 INFO L225 Difference]: With dead ends: 6625 [2018-12-02 17:35:21,906 INFO L226 Difference]: Without dead ends: 6625 [2018-12-02 17:35:21,906 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:35:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6625 states. [2018-12-02 17:35:21,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6625 to 5915. [2018-12-02 17:35:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2018-12-02 17:35:21,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13414 transitions. [2018-12-02 17:35:21,950 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13414 transitions. Word has length 75 [2018-12-02 17:35:21,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:21,950 INFO L480 AbstractCegarLoop]: Abstraction has 5915 states and 13414 transitions. [2018-12-02 17:35:21,950 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:35:21,950 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13414 transitions. [2018-12-02 17:35:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 17:35:21,953 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:21,953 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-02 17:35:21,953 INFO L423 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:21,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash 146208425, now seen corresponding path program 1 times [2018-12-02 17:35:21,954 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:21,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,954 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:21,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:21,955 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:21,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:21,992 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-02 17:35:21,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:21,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:35:21,992 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:21,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:35:21,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:35:21,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:21,993 INFO L87 Difference]: Start difference. First operand 5915 states and 13414 transitions. Second operand 7 states. [2018-12-02 17:35:22,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:22,199 INFO L93 Difference]: Finished difference Result 6842 states and 15342 transitions. [2018-12-02 17:35:22,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 17:35:22,199 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2018-12-02 17:35:22,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:22,203 INFO L225 Difference]: With dead ends: 6842 [2018-12-02 17:35:22,203 INFO L226 Difference]: Without dead ends: 6740 [2018-12-02 17:35:22,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2018-12-02 17:35:22,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6740 states. [2018-12-02 17:35:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6740 to 6012. [2018-12-02 17:35:22,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6012 states. [2018-12-02 17:35:22,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6012 states to 6012 states and 13507 transitions. [2018-12-02 17:35:22,244 INFO L78 Accepts]: Start accepts. Automaton has 6012 states and 13507 transitions. Word has length 75 [2018-12-02 17:35:22,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:22,244 INFO L480 AbstractCegarLoop]: Abstraction has 6012 states and 13507 transitions. [2018-12-02 17:35:22,244 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:35:22,244 INFO L276 IsEmpty]: Start isEmpty. Operand 6012 states and 13507 transitions. [2018-12-02 17:35:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 17:35:22,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:22,248 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] [2018-12-02 17:35:22,248 INFO L423 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:22,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:22,248 INFO L82 PathProgramCache]: Analyzing trace with hash 189178790, now seen corresponding path program 1 times [2018-12-02 17:35:22,248 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:22,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:22,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:22,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:22,302 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-02 17:35:22,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:22,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:35:22,303 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:22,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:35:22,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:35:22,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:22,303 INFO L87 Difference]: Start difference. First operand 6012 states and 13507 transitions. Second operand 7 states. [2018-12-02 17:35:22,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:22,626 INFO L93 Difference]: Finished difference Result 7492 states and 16836 transitions. [2018-12-02 17:35:22,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:35:22,626 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 96 [2018-12-02 17:35:22,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:22,633 INFO L225 Difference]: With dead ends: 7492 [2018-12-02 17:35:22,633 INFO L226 Difference]: Without dead ends: 7492 [2018-12-02 17:35:22,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:22,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2018-12-02 17:35:22,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 6152. [2018-12-02 17:35:22,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6152 states. [2018-12-02 17:35:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6152 states to 6152 states and 13895 transitions. [2018-12-02 17:35:22,687 INFO L78 Accepts]: Start accepts. Automaton has 6152 states and 13895 transitions. Word has length 96 [2018-12-02 17:35:22,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:22,687 INFO L480 AbstractCegarLoop]: Abstraction has 6152 states and 13895 transitions. [2018-12-02 17:35:22,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:35:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand 6152 states and 13895 transitions. [2018-12-02 17:35:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-12-02 17:35:22,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:22,691 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] [2018-12-02 17:35:22,691 INFO L423 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:22,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:22,691 INFO L82 PathProgramCache]: Analyzing trace with hash -717021655, now seen corresponding path program 1 times [2018-12-02 17:35:22,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:22,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:22,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:35:22,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:22,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:22,725 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:22,726 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:22,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:22,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:22,726 INFO L87 Difference]: Start difference. First operand 6152 states and 13895 transitions. Second operand 4 states. [2018-12-02 17:35:22,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:22,780 INFO L93 Difference]: Finished difference Result 7319 states and 16393 transitions. [2018-12-02 17:35:22,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 17:35:22,781 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2018-12-02 17:35:22,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:22,785 INFO L225 Difference]: With dead ends: 7319 [2018-12-02 17:35:22,785 INFO L226 Difference]: Without dead ends: 7319 [2018-12-02 17:35:22,785 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7319 states. [2018-12-02 17:35:22,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7319 to 6509. [2018-12-02 17:35:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6509 states. [2018-12-02 17:35:22,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6509 states to 6509 states and 14665 transitions. [2018-12-02 17:35:22,833 INFO L78 Accepts]: Start accepts. Automaton has 6509 states and 14665 transitions. Word has length 96 [2018-12-02 17:35:22,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:22,833 INFO L480 AbstractCegarLoop]: Abstraction has 6509 states and 14665 transitions. [2018-12-02 17:35:22,833 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:22,833 INFO L276 IsEmpty]: Start isEmpty. Operand 6509 states and 14665 transitions. [2018-12-02 17:35:22,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:22,837 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:22,837 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-02 17:35:22,837 INFO L423 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:22,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1567376623, now seen corresponding path program 1 times [2018-12-02 17:35:22,837 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:22,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,838 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:22,873 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-02 17:35:22,874 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:22,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 17:35:22,874 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:22,874 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 17:35:22,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 17:35:22,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:22,874 INFO L87 Difference]: Start difference. First operand 6509 states and 14665 transitions. Second operand 5 states. [2018-12-02 17:35:22,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:22,939 INFO L93 Difference]: Finished difference Result 7016 states and 15753 transitions. [2018-12-02 17:35:22,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:35:22,939 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2018-12-02 17:35:22,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:22,943 INFO L225 Difference]: With dead ends: 7016 [2018-12-02 17:35:22,943 INFO L226 Difference]: Without dead ends: 7016 [2018-12-02 17:35:22,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:22,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7016 states. [2018-12-02 17:35:22,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7016 to 5405. [2018-12-02 17:35:22,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5405 states. [2018-12-02 17:35:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5405 states to 5405 states and 12181 transitions. [2018-12-02 17:35:22,985 INFO L78 Accepts]: Start accepts. Automaton has 5405 states and 12181 transitions. Word has length 98 [2018-12-02 17:35:22,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:22,985 INFO L480 AbstractCegarLoop]: Abstraction has 5405 states and 12181 transitions. [2018-12-02 17:35:22,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 17:35:22,985 INFO L276 IsEmpty]: Start isEmpty. Operand 5405 states and 12181 transitions. [2018-12-02 17:35:22,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:22,989 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:22,990 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-02 17:35:22,990 INFO L423 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:22,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:22,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1578692750, now seen corresponding path program 1 times [2018-12-02 17:35:22,990 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:22,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:22,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:22,992 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:22,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:23,047 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-02 17:35:23,047 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:23,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-02 17:35:23,047 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:23,047 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 17:35:23,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 17:35:23,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-02 17:35:23,048 INFO L87 Difference]: Start difference. First operand 5405 states and 12181 transitions. Second operand 4 states. [2018-12-02 17:35:23,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:23,169 INFO L93 Difference]: Finished difference Result 6953 states and 15553 transitions. [2018-12-02 17:35:23,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 17:35:23,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-02 17:35:23,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:23,174 INFO L225 Difference]: With dead ends: 6953 [2018-12-02 17:35:23,174 INFO L226 Difference]: Without dead ends: 6886 [2018-12-02 17:35:23,174 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-02 17:35:23,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6886 states. [2018-12-02 17:35:23,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6886 to 6454. [2018-12-02 17:35:23,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6454 states. [2018-12-02 17:35:23,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6454 states to 6454 states and 14500 transitions. [2018-12-02 17:35:23,222 INFO L78 Accepts]: Start accepts. Automaton has 6454 states and 14500 transitions. Word has length 98 [2018-12-02 17:35:23,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:23,222 INFO L480 AbstractCegarLoop]: Abstraction has 6454 states and 14500 transitions. [2018-12-02 17:35:23,222 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 17:35:23,222 INFO L276 IsEmpty]: Start isEmpty. Operand 6454 states and 14500 transitions. [2018-12-02 17:35:23,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:23,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:23,226 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-02 17:35:23,226 INFO L423 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:23,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:23,227 INFO L82 PathProgramCache]: Analyzing trace with hash -498516593, now seen corresponding path program 1 times [2018-12-02 17:35:23,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:23,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:23,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:23,227 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:23,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:23,312 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-02 17:35:23,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:23,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 17:35:23,312 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:23,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 17:35:23,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 17:35:23,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:35:23,313 INFO L87 Difference]: Start difference. First operand 6454 states and 14500 transitions. Second operand 9 states. [2018-12-02 17:35:23,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:23,681 INFO L93 Difference]: Finished difference Result 8235 states and 18257 transitions. [2018-12-02 17:35:23,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-12-02 17:35:23,682 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-02 17:35:23,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:23,687 INFO L225 Difference]: With dead ends: 8235 [2018-12-02 17:35:23,687 INFO L226 Difference]: Without dead ends: 8235 [2018-12-02 17:35:23,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2018-12-02 17:35:23,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8235 states. [2018-12-02 17:35:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8235 to 7030. [2018-12-02 17:35:23,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7030 states. [2018-12-02 17:35:23,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7030 states to 7030 states and 15670 transitions. [2018-12-02 17:35:23,741 INFO L78 Accepts]: Start accepts. Automaton has 7030 states and 15670 transitions. Word has length 98 [2018-12-02 17:35:23,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:23,741 INFO L480 AbstractCegarLoop]: Abstraction has 7030 states and 15670 transitions. [2018-12-02 17:35:23,741 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 17:35:23,741 INFO L276 IsEmpty]: Start isEmpty. Operand 7030 states and 15670 transitions. [2018-12-02 17:35:23,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:23,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:23,745 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02 17:35:23,745 INFO L423 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:23,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:23,745 INFO L82 PathProgramCache]: Analyzing trace with hash -287165680, now seen corresponding path program 1 times [2018-12-02 17:35:23,746 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:23,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:23,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:23,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:23,747 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:23,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:23,852 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-02 17:35:23,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:23,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 17:35:23,852 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:23,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 17:35:23,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 17:35:23,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:35:23,853 INFO L87 Difference]: Start difference. First operand 7030 states and 15670 transitions. Second operand 9 states. [2018-12-02 17:35:24,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:24,157 INFO L93 Difference]: Finished difference Result 8246 states and 18329 transitions. [2018-12-02 17:35:24,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-02 17:35:24,158 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-02 17:35:24,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:24,165 INFO L225 Difference]: With dead ends: 8246 [2018-12-02 17:35:24,165 INFO L226 Difference]: Without dead ends: 8159 [2018-12-02 17:35:24,165 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2018-12-02 17:35:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8159 states. [2018-12-02 17:35:24,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8159 to 6991. [2018-12-02 17:35:24,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6991 states. [2018-12-02 17:35:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6991 states to 6991 states and 15582 transitions. [2018-12-02 17:35:24,231 INFO L78 Accepts]: Start accepts. Automaton has 6991 states and 15582 transitions. Word has length 98 [2018-12-02 17:35:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:24,231 INFO L480 AbstractCegarLoop]: Abstraction has 6991 states and 15582 transitions. [2018-12-02 17:35:24,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 17:35:24,231 INFO L276 IsEmpty]: Start isEmpty. Operand 6991 states and 15582 transitions. [2018-12-02 17:35:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:24,236 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:24,236 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-02 17:35:24,236 INFO L423 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:24,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:24,236 INFO L82 PathProgramCache]: Analyzing trace with hash 600338001, now seen corresponding path program 1 times [2018-12-02 17:35:24,236 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:24,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:24,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:24,237 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:24,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:24,334 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-02 17:35:24,334 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:24,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-02 17:35:24,334 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:24,334 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 17:35:24,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 17:35:24,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:35:24,335 INFO L87 Difference]: Start difference. First operand 6991 states and 15582 transitions. Second operand 9 states. [2018-12-02 17:35:24,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:24,831 INFO L93 Difference]: Finished difference Result 11197 states and 24928 transitions. [2018-12-02 17:35:24,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 17:35:24,832 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 98 [2018-12-02 17:35:24,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:24,837 INFO L225 Difference]: With dead ends: 11197 [2018-12-02 17:35:24,837 INFO L226 Difference]: Without dead ends: 8089 [2018-12-02 17:35:24,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:35:24,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8089 states. [2018-12-02 17:35:24,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8089 to 7048. [2018-12-02 17:35:24,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7048 states. [2018-12-02 17:35:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7048 states to 7048 states and 15699 transitions. [2018-12-02 17:35:24,887 INFO L78 Accepts]: Start accepts. Automaton has 7048 states and 15699 transitions. Word has length 98 [2018-12-02 17:35:24,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:24,887 INFO L480 AbstractCegarLoop]: Abstraction has 7048 states and 15699 transitions. [2018-12-02 17:35:24,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 17:35:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 7048 states and 15699 transitions. [2018-12-02 17:35:24,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:24,891 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:24,891 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-02 17:35:24,891 INFO L423 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:24,891 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:24,891 INFO L82 PathProgramCache]: Analyzing trace with hash -543309766, now seen corresponding path program 1 times [2018-12-02 17:35:24,891 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:24,892 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:24,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:24,892 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:24,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:24,981 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-02 17:35:24,981 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:24,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:35:24,981 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:24,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:35:24,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:35:24,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:35:24,982 INFO L87 Difference]: Start difference. First operand 7048 states and 15699 transitions. Second operand 6 states. [2018-12-02 17:35:25,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:25,112 INFO L93 Difference]: Finished difference Result 7978 states and 17540 transitions. [2018-12-02 17:35:25,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 17:35:25,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-02 17:35:25,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:25,117 INFO L225 Difference]: With dead ends: 7978 [2018-12-02 17:35:25,117 INFO L226 Difference]: Without dead ends: 7926 [2018-12-02 17:35:25,118 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-02 17:35:25,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7926 states. [2018-12-02 17:35:25,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7926 to 6952. [2018-12-02 17:35:25,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6952 states. [2018-12-02 17:35:25,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6952 states to 6952 states and 15372 transitions. [2018-12-02 17:35:25,172 INFO L78 Accepts]: Start accepts. Automaton has 6952 states and 15372 transitions. Word has length 98 [2018-12-02 17:35:25,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:25,172 INFO L480 AbstractCegarLoop]: Abstraction has 6952 states and 15372 transitions. [2018-12-02 17:35:25,172 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:35:25,172 INFO L276 IsEmpty]: Start isEmpty. Operand 6952 states and 15372 transitions. [2018-12-02 17:35:25,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:25,176 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:25,177 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-02 17:35:25,177 INFO L423 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:25,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:25,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1661772762, now seen corresponding path program 2 times [2018-12-02 17:35:25,177 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:25,178 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:25,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:25,178 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:25,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:25,239 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-02 17:35:25,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:25,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-02 17:35:25,239 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:25,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 17:35:25,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 17:35:25,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-02 17:35:25,239 INFO L87 Difference]: Start difference. First operand 6952 states and 15372 transitions. Second operand 6 states. [2018-12-02 17:35:25,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:25,350 INFO L93 Difference]: Finished difference Result 7313 states and 16120 transitions. [2018-12-02 17:35:25,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:35:25,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2018-12-02 17:35:25,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:25,355 INFO L225 Difference]: With dead ends: 7313 [2018-12-02 17:35:25,355 INFO L226 Difference]: Without dead ends: 7313 [2018-12-02 17:35:25,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:35:25,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7313 states. [2018-12-02 17:35:25,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7313 to 6856. [2018-12-02 17:35:25,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6856 states. [2018-12-02 17:35:25,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6856 states to 6856 states and 15165 transitions. [2018-12-02 17:35:25,401 INFO L78 Accepts]: Start accepts. Automaton has 6856 states and 15165 transitions. Word has length 98 [2018-12-02 17:35:25,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:25,402 INFO L480 AbstractCegarLoop]: Abstraction has 6856 states and 15165 transitions. [2018-12-02 17:35:25,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 17:35:25,402 INFO L276 IsEmpty]: Start isEmpty. Operand 6856 states and 15165 transitions. [2018-12-02 17:35:25,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:25,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:25,406 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-02 17:35:25,406 INFO L423 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:25,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:25,406 INFO L82 PathProgramCache]: Analyzing trace with hash -419236519, now seen corresponding path program 2 times [2018-12-02 17:35:25,406 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:25,407 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:35:25,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:25,407 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 17:35:25,514 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:25,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 17:35:25,514 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:25,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 17:35:25,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:35:25,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:35:25,514 INFO L87 Difference]: Start difference. First operand 6856 states and 15165 transitions. Second operand 10 states. [2018-12-02 17:35:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:25,865 INFO L93 Difference]: Finished difference Result 12036 states and 26654 transitions. [2018-12-02 17:35:25,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 17:35:25,865 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-12-02 17:35:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:25,873 INFO L225 Difference]: With dead ends: 12036 [2018-12-02 17:35:25,873 INFO L226 Difference]: Without dead ends: 8233 [2018-12-02 17:35:25,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:35:25,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8233 states. [2018-12-02 17:35:25,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8233 to 6837. [2018-12-02 17:35:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6837 states. [2018-12-02 17:35:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6837 states to 6837 states and 15107 transitions. [2018-12-02 17:35:25,932 INFO L78 Accepts]: Start accepts. Automaton has 6837 states and 15107 transitions. Word has length 98 [2018-12-02 17:35:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:25,932 INFO L480 AbstractCegarLoop]: Abstraction has 6837 states and 15107 transitions. [2018-12-02 17:35:25,932 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 17:35:25,932 INFO L276 IsEmpty]: Start isEmpty. Operand 6837 states and 15107 transitions. [2018-12-02 17:35:25,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:25,936 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:25,936 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-02 17:35:25,936 INFO L423 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:25,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:25,937 INFO L82 PathProgramCache]: Analyzing trace with hash -682671939, now seen corresponding path program 3 times [2018-12-02 17:35:25,937 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:25,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:25,938 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:35:25,938 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:25,938 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:25,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:26,027 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-02 17:35:26,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:26,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-02 17:35:26,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:26,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 17:35:26,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 17:35:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-12-02 17:35:26,028 INFO L87 Difference]: Start difference. First operand 6837 states and 15107 transitions. Second operand 10 states. [2018-12-02 17:35:26,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:26,431 INFO L93 Difference]: Finished difference Result 12084 states and 26746 transitions. [2018-12-02 17:35:26,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:35:26,431 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2018-12-02 17:35:26,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:26,434 INFO L225 Difference]: With dead ends: 12084 [2018-12-02 17:35:26,434 INFO L226 Difference]: Without dead ends: 4267 [2018-12-02 17:35:26,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2018-12-02 17:35:26,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4267 states. [2018-12-02 17:35:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4267 to 4267. [2018-12-02 17:35:26,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4267 states. [2018-12-02 17:35:26,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4267 states to 4267 states and 9470 transitions. [2018-12-02 17:35:26,459 INFO L78 Accepts]: Start accepts. Automaton has 4267 states and 9470 transitions. Word has length 98 [2018-12-02 17:35:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:26,459 INFO L480 AbstractCegarLoop]: Abstraction has 4267 states and 9470 transitions. [2018-12-02 17:35:26,459 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 17:35:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 4267 states and 9470 transitions. [2018-12-02 17:35:26,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:26,461 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:26,461 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-02 17:35:26,461 INFO L423 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:26,462 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:26,462 INFO L82 PathProgramCache]: Analyzing trace with hash -2050487941, now seen corresponding path program 4 times [2018-12-02 17:35:26,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:26,462 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 17:35:26,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:26,462 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:26,580 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-02 17:35:26,580 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:26,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-12-02 17:35:26,580 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:26,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 17:35:26,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 17:35:26,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-12-02 17:35:26,581 INFO L87 Difference]: Start difference. First operand 4267 states and 9470 transitions. Second operand 11 states. [2018-12-02 17:35:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:27,372 INFO L93 Difference]: Finished difference Result 8508 states and 19055 transitions. [2018-12-02 17:35:27,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-02 17:35:27,372 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 98 [2018-12-02 17:35:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:27,377 INFO L225 Difference]: With dead ends: 8508 [2018-12-02 17:35:27,378 INFO L226 Difference]: Without dead ends: 5551 [2018-12-02 17:35:27,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=93, Invalid=413, Unknown=0, NotChecked=0, Total=506 [2018-12-02 17:35:27,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5551 states. [2018-12-02 17:35:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5551 to 4300. [2018-12-02 17:35:27,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4300 states. [2018-12-02 17:35:27,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4300 states to 4300 states and 9496 transitions. [2018-12-02 17:35:27,413 INFO L78 Accepts]: Start accepts. Automaton has 4300 states and 9496 transitions. Word has length 98 [2018-12-02 17:35:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:27,413 INFO L480 AbstractCegarLoop]: Abstraction has 4300 states and 9496 transitions. [2018-12-02 17:35:27,413 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 17:35:27,413 INFO L276 IsEmpty]: Start isEmpty. Operand 4300 states and 9496 transitions. [2018-12-02 17:35:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:27,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:27,416 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-02 17:35:27,416 INFO L423 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:27,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:27,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1587659467, now seen corresponding path program 1 times [2018-12-02 17:35:27,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:27,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:27,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:27,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:27,417 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:27,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:27,503 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-02 17:35:27,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:27,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 17:35:27,503 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:27,503 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:35:27,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:35:27,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:35:27,504 INFO L87 Difference]: Start difference. First operand 4300 states and 9496 transitions. Second operand 8 states. [2018-12-02 17:35:27,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:27,708 INFO L93 Difference]: Finished difference Result 5023 states and 10984 transitions. [2018-12-02 17:35:27,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 17:35:27,708 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-02 17:35:27,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:27,711 INFO L225 Difference]: With dead ends: 5023 [2018-12-02 17:35:27,711 INFO L226 Difference]: Without dead ends: 5023 [2018-12-02 17:35:27,712 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-02 17:35:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2018-12-02 17:35:27,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4304. [2018-12-02 17:35:27,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4304 states. [2018-12-02 17:35:27,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4304 states to 4304 states and 9506 transitions. [2018-12-02 17:35:27,740 INFO L78 Accepts]: Start accepts. Automaton has 4304 states and 9506 transitions. Word has length 98 [2018-12-02 17:35:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:27,740 INFO L480 AbstractCegarLoop]: Abstraction has 4304 states and 9506 transitions. [2018-12-02 17:35:27,740 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:35:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 4304 states and 9506 transitions. [2018-12-02 17:35:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:27,742 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:27,742 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-02 17:35:27,743 INFO L423 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:27,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash -450396822, now seen corresponding path program 1 times [2018-12-02 17:35:27,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:27,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:27,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:27,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:27,744 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:27,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:27,812 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-02 17:35:27,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:27,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-02 17:35:27,813 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:27,813 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 17:35:27,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 17:35:27,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-12-02 17:35:27,813 INFO L87 Difference]: Start difference. First operand 4304 states and 9506 transitions. Second operand 7 states. [2018-12-02 17:35:27,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:27,959 INFO L93 Difference]: Finished difference Result 4557 states and 10002 transitions. [2018-12-02 17:35:27,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 17:35:27,960 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2018-12-02 17:35:27,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:27,962 INFO L225 Difference]: With dead ends: 4557 [2018-12-02 17:35:27,962 INFO L226 Difference]: Without dead ends: 4557 [2018-12-02 17:35:27,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2018-12-02 17:35:27,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4557 states. [2018-12-02 17:35:27,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4557 to 4344. [2018-12-02 17:35:27,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4344 states. [2018-12-02 17:35:27,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4344 states to 4344 states and 9578 transitions. [2018-12-02 17:35:27,989 INFO L78 Accepts]: Start accepts. Automaton has 4344 states and 9578 transitions. Word has length 98 [2018-12-02 17:35:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:27,989 INFO L480 AbstractCegarLoop]: Abstraction has 4344 states and 9578 transitions. [2018-12-02 17:35:27,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 17:35:27,989 INFO L276 IsEmpty]: Start isEmpty. Operand 4344 states and 9578 transitions. [2018-12-02 17:35:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:27,991 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:27,991 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-02 17:35:27,992 INFO L423 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:27,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:27,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1243195254, now seen corresponding path program 1 times [2018-12-02 17:35:27,992 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:27,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:27,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:27,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:27,993 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:27,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 17:35:28,062 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-02 17:35:28,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 17:35:28,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-02 17:35:28,062 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 17:35:28,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 17:35:28,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 17:35:28,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-12-02 17:35:28,062 INFO L87 Difference]: Start difference. First operand 4344 states and 9578 transitions. Second operand 8 states. [2018-12-02 17:35:28,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 17:35:28,256 INFO L93 Difference]: Finished difference Result 4863 states and 10617 transitions. [2018-12-02 17:35:28,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 17:35:28,257 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 98 [2018-12-02 17:35:28,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 17:35:28,259 INFO L225 Difference]: With dead ends: 4863 [2018-12-02 17:35:28,259 INFO L226 Difference]: Without dead ends: 4863 [2018-12-02 17:35:28,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2018-12-02 17:35:28,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4863 states. [2018-12-02 17:35:28,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4863 to 4355. [2018-12-02 17:35:28,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4355 states. [2018-12-02 17:35:28,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4355 states to 4355 states and 9610 transitions. [2018-12-02 17:35:28,290 INFO L78 Accepts]: Start accepts. Automaton has 4355 states and 9610 transitions. Word has length 98 [2018-12-02 17:35:28,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 17:35:28,290 INFO L480 AbstractCegarLoop]: Abstraction has 4355 states and 9610 transitions. [2018-12-02 17:35:28,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 17:35:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4355 states and 9610 transitions. [2018-12-02 17:35:28,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-02 17:35:28,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 17:35:28,293 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-02 17:35:28,293 INFO L423 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 17:35:28,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 17:35:28,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1013715753, now seen corresponding path program 5 times [2018-12-02 17:35:28,293 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 17:35:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:28,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 17:35:28,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 17:35:28,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 17:35:28,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:35:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 17:35:28,328 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-02 17:35:28,393 INFO L305 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2018-12-02 17:35:28,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 05:35:28 BasicIcfg [2018-12-02 17:35:28,394 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 17:35:28,394 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 17:35:28,394 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 17:35:28,394 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 17:35:28,395 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 05:35:10" (3/4) ... [2018-12-02 17:35:28,396 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2018-12-02 17:35:28,480 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1cf589a2-c789-4ac2-acf3-b768822223c6/bin-2019/utaipan/witness.graphml [2018-12-02 17:35:28,480 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 17:35:28,481 INFO L168 Benchmark]: Toolchain (without parser) took 19138.83 ms. Allocated memory was 1.0 GB in the beginning and 2.7 GB in the end (delta: 1.7 GB). Free memory was 950.6 MB in the beginning and 983.5 MB in the end (delta: -32.9 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 17:35:28,482 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:35:28,483 INFO L168 Benchmark]: CACSL2BoogieTranslator took 395.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. [2018-12-02 17:35:28,483 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-12-02 17:35:28,483 INFO L168 Benchmark]: Boogie Preprocessor took 20.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 17:35:28,483 INFO L168 Benchmark]: RCFGBuilder took 332.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:35:28,484 INFO L168 Benchmark]: TraceAbstraction took 18265.67 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2018-12-02 17:35:28,484 INFO L168 Benchmark]: Witness Printer took 86.31 ms. Allocated memory is still 2.7 GB. Free memory was 1.0 GB in the beginning and 983.5 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 11.5 GB. [2018-12-02 17:35:28,485 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 395.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -167.8 MB). Peak memory consumption was 33.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 332.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18265.67 ms. Allocated memory was 1.2 GB in the beginning and 2.7 GB in the end (delta: 1.5 GB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 50.3 MB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. * Witness Printer took 86.31 ms. Allocated memory is still 2.7 GB. Free memory was 1.0 GB in the beginning and 983.5 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.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: [L671] -1 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L673] -1 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L675] -1 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L677] -1 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L679] -1 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L680] -1 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L681] -1 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L683] -1 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L685] -1 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L687] -1 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L688] -1 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L689] -1 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L690] -1 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L691] -1 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L692] -1 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L693] -1 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L694] -1 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L695] -1 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L696] -1 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L697] -1 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L698] -1 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L699] -1 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L700] -1 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L701] -1 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L702] -1 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L703] -1 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] -1 pthread_t t243; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] FCALL, FORK -1 pthread_create(&t243, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L707] 0 z$w_buff1 = z$w_buff0 [L708] 0 z$w_buff0 = 1 [L709] 0 z$w_buff1_used = z$w_buff0_used [L710] 0 z$w_buff0_used = (_Bool)1 [L4] COND FALSE 0 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L787] -1 pthread_t t244; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] FCALL, FORK -1 pthread_create(&t244, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L712] 0 z$r_buff1_thd0 = z$r_buff0_thd0 [L713] 0 z$r_buff1_thd1 = z$r_buff0_thd1 [L714] 0 z$r_buff1_thd2 = z$r_buff0_thd2 [L715] 0 z$r_buff0_thd1 = (_Bool)1 [L718] 0 x = 1 [L721] 0 __unbuffered_p0_EAX = x [L724] 0 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L741] 1 y = 1 [L744] 1 __unbuffered_p1_EAX = y [L747] 1 weak$$choice0 = __VERIFIER_nondet_pointer() [L748] 1 weak$$choice2 = __VERIFIER_nondet_pointer() [L749] 1 z$flush_delayed = weak$$choice2 [L750] 1 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] EXPR 1 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L752] EXPR 1 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L727] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] EXPR 1 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L754] EXPR 1 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L755] EXPR 1 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L756] EXPR 1 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L757] EXPR 1 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L757] 1 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L727] 0 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L728] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L728] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L729] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L729] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L730] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 0 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L759] EXPR 1 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 z = z$flush_delayed ? z$mem_tmp : z [L760] 1 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L763] EXPR 1 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L763] 1 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L764] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L765] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] EXPR 0 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L765] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L766] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L766] 1 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L767] EXPR 1 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L767] 1 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L770] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 0 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L734] 0 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] -1 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L794] -1 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L795] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] -1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L796] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L796] -1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L797] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L797] -1 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L798] EXPR -1 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L798] -1 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L801] -1 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE -1 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] -1 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 225 locations, 3 error locations. UNSAFE Result, 18.1s OverallTime, 36 OverallIterations, 1 TraceHistogramMax, 9.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 9405 SDtfs, 10628 SDslu, 22564 SDs, 0 SdLazy, 9426 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 377 GetRequests, 83 SyntacticMatches, 39 SemanticMatches, 255 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34809occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 5.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 80981 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 2832 NumberOfCodeBlocks, 2832 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2699 ConstructedInterpolants, 0 QuantifiedInterpolants, 615044 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...