./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c --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_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/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 c5a3d22d49117f02662b197492bc1b16616a2878 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 23:24:19,662 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 23:24:19,663 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 23:24:19,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 23:24:19,670 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 23:24:19,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 23:24:19,671 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 23:24:19,672 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 23:24:19,673 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 23:24:19,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 23:24:19,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 23:24:19,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 23:24:19,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 23:24:19,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 23:24:19,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 23:24:19,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 23:24:19,676 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 23:24:19,677 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 23:24:19,678 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 23:24:19,679 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 23:24:19,680 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 23:24:19,680 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 23:24:19,682 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 23:24:19,682 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 23:24:19,682 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 23:24:19,682 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 23:24:19,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 23:24:19,683 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 23:24:19,684 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 23:24:19,684 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 23:24:19,685 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 23:24:19,685 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 23:24:19,685 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 23:24:19,685 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 23:24:19,686 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 23:24:19,686 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 23:24:19,686 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-02 23:24:19,694 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 23:24:19,694 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 23:24:19,695 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 23:24:19,695 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 23:24:19,695 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 23:24:19,695 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 23:24:19,696 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 23:24:19,697 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 23:24:19,697 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 23:24:19,697 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 23:24:19,697 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 23:24:19,697 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 23:24:19,698 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 23:24:19,698 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 23:24:19,698 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 23:24:19,698 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 23:24:19,698 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 23:24:19,698 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 23:24:19,698 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 23:24:19,699 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 23:24:19,699 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 23:24:19,700 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 23:24:19,700 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 23:24:19,700 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 23:24:19,700 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_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/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 -> c5a3d22d49117f02662b197492bc1b16616a2878 [2018-12-02 23:24:19,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 23:24:19,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 23:24:19,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 23:24:19,727 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 23:24:19,727 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 23:24:19,727 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 23:24:19,762 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/data/9b3b773cb/eb2a4528b5ae47b99a1232125cc9ddd7/FLAG70fbe1c35 [2018-12-02 23:24:20,142 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 23:24:20,142 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/sv-benchmarks/c/locks/test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 23:24:20,146 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/data/9b3b773cb/eb2a4528b5ae47b99a1232125cc9ddd7/FLAG70fbe1c35 [2018-12-02 23:24:20,154 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/data/9b3b773cb/eb2a4528b5ae47b99a1232125cc9ddd7 [2018-12-02 23:24:20,156 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 23:24:20,157 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 23:24:20,157 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 23:24:20,157 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 23:24:20,159 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 23:24:20,160 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20, skipping insertion in model container [2018-12-02 23:24:20,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,165 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 23:24:20,178 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 23:24:20,268 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:24:20,270 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 23:24:20,286 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 23:24:20,294 INFO L195 MainTranslator]: Completed translation [2018-12-02 23:24:20,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20 WrapperNode [2018-12-02 23:24:20,294 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 23:24:20,295 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 23:24:20,295 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 23:24:20,295 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 23:24:20,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,307 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 23:24:20,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 23:24:20,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 23:24:20,307 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 23:24:20,340 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,340 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,341 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,342 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,354 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... [2018-12-02 23:24:20,355 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 23:24:20,356 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 23:24:20,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 23:24:20,356 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 23:24:20,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/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 23:24:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 23:24:20,391 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 23:24:20,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 23:24:20,392 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 23:24:20,392 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 23:24:20,392 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 23:24:20,559 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 23:24:20,559 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 23:24:20,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:24:20 BoogieIcfgContainer [2018-12-02 23:24:20,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 23:24:20,560 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 23:24:20,560 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 23:24:20,562 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 23:24:20,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 11:24:20" (1/3) ... [2018-12-02 23:24:20,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5b48ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:24:20, skipping insertion in model container [2018-12-02 23:24:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 11:24:20" (2/3) ... [2018-12-02 23:24:20,563 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5b48ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 11:24:20, skipping insertion in model container [2018-12-02 23:24:20,563 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:24:20" (3/3) ... [2018-12-02 23:24:20,564 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_14_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-02 23:24:20,571 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 23:24:20,575 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-02 23:24:20,586 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-02 23:24:20,605 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 23:24:20,605 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 23:24:20,605 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 23:24:20,605 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 23:24:20,605 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 23:24:20,605 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 23:24:20,605 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 23:24:20,605 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 23:24:20,616 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-12-02 23:24:20,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 23:24:20,620 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:20,620 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] [2018-12-02 23:24:20,622 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:20,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:20,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1694520263, now seen corresponding path program 1 times [2018-12-02 23:24:20,626 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:20,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:20,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,654 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:20,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:20,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:20,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:20,732 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:20,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:20,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:20,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:20,745 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 3 states. [2018-12-02 23:24:20,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:20,773 INFO L93 Difference]: Finished difference Result 111 states and 198 transitions. [2018-12-02 23:24:20,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:20,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 23:24:20,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:20,781 INFO L225 Difference]: With dead ends: 111 [2018-12-02 23:24:20,781 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 23:24:20,783 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 23:24:20,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 23:24:20,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 66. [2018-12-02 23:24:20,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-12-02 23:24:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 121 transitions. [2018-12-02 23:24:20,808 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 121 transitions. Word has length 24 [2018-12-02 23:24:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:20,808 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 121 transitions. [2018-12-02 23:24:20,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 121 transitions. [2018-12-02 23:24:20,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 23:24:20,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:20,809 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] [2018-12-02 23:24:20,809 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:20,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:20,810 INFO L82 PathProgramCache]: Analyzing trace with hash 106172361, now seen corresponding path program 1 times [2018-12-02 23:24:20,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:20,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:20,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,810 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:20,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:20,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:20,845 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:20,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:20,845 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:20,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:20,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:20,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:20,846 INFO L87 Difference]: Start difference. First operand 66 states and 121 transitions. Second operand 3 states. [2018-12-02 23:24:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:20,870 INFO L93 Difference]: Finished difference Result 157 states and 292 transitions. [2018-12-02 23:24:20,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:20,870 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 23:24:20,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:20,871 INFO L225 Difference]: With dead ends: 157 [2018-12-02 23:24:20,871 INFO L226 Difference]: Without dead ends: 96 [2018-12-02 23:24:20,872 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 23:24:20,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-12-02 23:24:20,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2018-12-02 23:24:20,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-12-02 23:24:20,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 173 transitions. [2018-12-02 23:24:20,878 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 173 transitions. Word has length 24 [2018-12-02 23:24:20,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:20,878 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 173 transitions. [2018-12-02 23:24:20,878 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:20,878 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 173 transitions. [2018-12-02 23:24:20,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 23:24:20,879 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:20,879 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] [2018-12-02 23:24:20,879 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:20,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:20,879 INFO L82 PathProgramCache]: Analyzing trace with hash 990732685, now seen corresponding path program 1 times [2018-12-02 23:24:20,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:20,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,880 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:20,904 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 23:24:20,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:20,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:20,905 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:20,905 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:20,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:20,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:20,905 INFO L87 Difference]: Start difference. First operand 94 states and 173 transitions. Second operand 3 states. [2018-12-02 23:24:20,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:20,916 INFO L93 Difference]: Finished difference Result 144 states and 261 transitions. [2018-12-02 23:24:20,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:20,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 23:24:20,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:20,917 INFO L225 Difference]: With dead ends: 144 [2018-12-02 23:24:20,917 INFO L226 Difference]: Without dead ends: 99 [2018-12-02 23:24:20,917 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 23:24:20,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-12-02 23:24:20,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2018-12-02 23:24:20,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-02 23:24:20,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 175 transitions. [2018-12-02 23:24:20,922 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 175 transitions. Word has length 25 [2018-12-02 23:24:20,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:20,922 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 175 transitions. [2018-12-02 23:24:20,922 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:20,922 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 175 transitions. [2018-12-02 23:24:20,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 23:24:20,922 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:20,922 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] [2018-12-02 23:24:20,923 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:20,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:20,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1003412021, now seen corresponding path program 1 times [2018-12-02 23:24:20,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:20,949 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 23:24:20,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:20,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:20,949 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:20,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:20,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:20,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:20,949 INFO L87 Difference]: Start difference. First operand 97 states and 175 transitions. Second operand 3 states. [2018-12-02 23:24:20,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:20,959 INFO L93 Difference]: Finished difference Result 184 states and 336 transitions. [2018-12-02 23:24:20,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:20,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 23:24:20,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:20,960 INFO L225 Difference]: With dead ends: 184 [2018-12-02 23:24:20,961 INFO L226 Difference]: Without dead ends: 182 [2018-12-02 23:24:20,961 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 23:24:20,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-02 23:24:20,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 128. [2018-12-02 23:24:20,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-12-02 23:24:20,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 232 transitions. [2018-12-02 23:24:20,966 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 232 transitions. Word has length 25 [2018-12-02 23:24:20,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:20,966 INFO L480 AbstractCegarLoop]: Abstraction has 128 states and 232 transitions. [2018-12-02 23:24:20,967 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:20,967 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 232 transitions. [2018-12-02 23:24:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 23:24:20,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:20,967 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] [2018-12-02 23:24:20,967 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:20,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:20,968 INFO L82 PathProgramCache]: Analyzing trace with hash 1703207373, now seen corresponding path program 1 times [2018-12-02 23:24:20,968 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:20,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:20,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:20,991 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 23:24:20,991 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:20,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:20,991 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:20,991 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:20,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:20,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:20,992 INFO L87 Difference]: Start difference. First operand 128 states and 232 transitions. Second operand 3 states. [2018-12-02 23:24:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,002 INFO L93 Difference]: Finished difference Result 304 states and 558 transitions. [2018-12-02 23:24:21,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,002 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-02 23:24:21,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,003 INFO L225 Difference]: With dead ends: 304 [2018-12-02 23:24:21,003 INFO L226 Difference]: Without dead ends: 184 [2018-12-02 23:24:21,004 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 23:24:21,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-12-02 23:24:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-12-02 23:24:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-02 23:24:21,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 330 transitions. [2018-12-02 23:24:21,010 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 330 transitions. Word has length 25 [2018-12-02 23:24:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,010 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 330 transitions. [2018-12-02 23:24:21,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 330 transitions. [2018-12-02 23:24:21,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 23:24:21,011 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,011 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:24:21,011 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1040789154, now seen corresponding path program 1 times [2018-12-02 23:24:21,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,012 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,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 23:24:21,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,027 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,028 INFO L87 Difference]: Start difference. First operand 182 states and 330 transitions. Second operand 3 states. [2018-12-02 23:24:21,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,038 INFO L93 Difference]: Finished difference Result 273 states and 493 transitions. [2018-12-02 23:24:21,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,038 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 23:24:21,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,038 INFO L225 Difference]: With dead ends: 273 [2018-12-02 23:24:21,039 INFO L226 Difference]: Without dead ends: 186 [2018-12-02 23:24:21,039 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 23:24:21,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-12-02 23:24:21,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 184. [2018-12-02 23:24:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-02 23:24:21,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 330 transitions. [2018-12-02 23:24:21,044 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 330 transitions. Word has length 26 [2018-12-02 23:24:21,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,044 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 330 transitions. [2018-12-02 23:24:21,044 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,044 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 330 transitions. [2018-12-02 23:24:21,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 23:24:21,045 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,045 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] [2018-12-02 23:24:21,045 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,045 INFO L82 PathProgramCache]: Analyzing trace with hash 1260033436, now seen corresponding path program 1 times [2018-12-02 23:24:21,045 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,046 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,046 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:21,059 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,059 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,060 INFO L87 Difference]: Start difference. First operand 184 states and 330 transitions. Second operand 3 states. [2018-12-02 23:24:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,073 INFO L93 Difference]: Finished difference Result 348 states and 632 transitions. [2018-12-02 23:24:21,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 23:24:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,074 INFO L225 Difference]: With dead ends: 348 [2018-12-02 23:24:21,074 INFO L226 Difference]: Without dead ends: 346 [2018-12-02 23:24:21,074 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 23:24:21,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-12-02 23:24:21,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 248. [2018-12-02 23:24:21,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-12-02 23:24:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 442 transitions. [2018-12-02 23:24:21,080 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 442 transitions. Word has length 26 [2018-12-02 23:24:21,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,080 INFO L480 AbstractCegarLoop]: Abstraction has 248 states and 442 transitions. [2018-12-02 23:24:21,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,080 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 442 transitions. [2018-12-02 23:24:21,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-02 23:24:21,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,081 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] [2018-12-02 23:24:21,081 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,081 INFO L82 PathProgramCache]: Analyzing trace with hash -328314466, now seen corresponding path program 1 times [2018-12-02 23:24:21,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,093 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 23:24:21,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,093 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,094 INFO L87 Difference]: Start difference. First operand 248 states and 442 transitions. Second operand 3 states. [2018-12-02 23:24:21,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,105 INFO L93 Difference]: Finished difference Result 592 states and 1064 transitions. [2018-12-02 23:24:21,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,105 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-02 23:24:21,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,106 INFO L225 Difference]: With dead ends: 592 [2018-12-02 23:24:21,106 INFO L226 Difference]: Without dead ends: 354 [2018-12-02 23:24:21,107 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 23:24:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2018-12-02 23:24:21,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 352. [2018-12-02 23:24:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 352 states. [2018-12-02 23:24:21,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 352 states to 352 states and 626 transitions. [2018-12-02 23:24:21,113 INFO L78 Accepts]: Start accepts. Automaton has 352 states and 626 transitions. Word has length 26 [2018-12-02 23:24:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,113 INFO L480 AbstractCegarLoop]: Abstraction has 352 states and 626 transitions. [2018-12-02 23:24:21,113 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 626 transitions. [2018-12-02 23:24:21,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 23:24:21,114 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,114 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:24:21,114 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,114 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,115 INFO L82 PathProgramCache]: Analyzing trace with hash 406543618, now seen corresponding path program 1 times [2018-12-02 23:24:21,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,115 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,126 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 23:24:21,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,127 INFO L87 Difference]: Start difference. First operand 352 states and 626 transitions. Second operand 3 states. [2018-12-02 23:24:21,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,139 INFO L93 Difference]: Finished difference Result 528 states and 936 transitions. [2018-12-02 23:24:21,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 23:24:21,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,140 INFO L225 Difference]: With dead ends: 528 [2018-12-02 23:24:21,140 INFO L226 Difference]: Without dead ends: 358 [2018-12-02 23:24:21,141 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 23:24:21,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-12-02 23:24:21,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-12-02 23:24:21,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-12-02 23:24:21,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 626 transitions. [2018-12-02 23:24:21,148 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 626 transitions. Word has length 27 [2018-12-02 23:24:21,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,148 INFO L480 AbstractCegarLoop]: Abstraction has 356 states and 626 transitions. [2018-12-02 23:24:21,148 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,149 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 626 transitions. [2018-12-02 23:24:21,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 23:24:21,149 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,149 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] [2018-12-02 23:24:21,149 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,150 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1587601088, now seen corresponding path program 1 times [2018-12-02 23:24:21,150 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,150 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,150 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,151 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,162 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 23:24:21,163 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,163 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,163 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,163 INFO L87 Difference]: Start difference. First operand 356 states and 626 transitions. Second operand 3 states. [2018-12-02 23:24:21,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,176 INFO L93 Difference]: Finished difference Result 668 states and 1192 transitions. [2018-12-02 23:24:21,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 23:24:21,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,178 INFO L225 Difference]: With dead ends: 668 [2018-12-02 23:24:21,178 INFO L226 Difference]: Without dead ends: 666 [2018-12-02 23:24:21,179 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 23:24:21,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-12-02 23:24:21,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 488. [2018-12-02 23:24:21,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-12-02 23:24:21,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 846 transitions. [2018-12-02 23:24:21,189 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 846 transitions. Word has length 27 [2018-12-02 23:24:21,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,189 INFO L480 AbstractCegarLoop]: Abstraction has 488 states and 846 transitions. [2018-12-02 23:24:21,189 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,189 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 846 transitions. [2018-12-02 23:24:21,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-02 23:24:21,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,190 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] [2018-12-02 23:24:21,190 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1119018306, now seen corresponding path program 1 times [2018-12-02 23:24:21,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,191 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:21,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,203 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,203 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,203 INFO L87 Difference]: Start difference. First operand 488 states and 846 transitions. Second operand 3 states. [2018-12-02 23:24:21,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,218 INFO L93 Difference]: Finished difference Result 1164 states and 2032 transitions. [2018-12-02 23:24:21,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-02 23:24:21,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,220 INFO L225 Difference]: With dead ends: 1164 [2018-12-02 23:24:21,220 INFO L226 Difference]: Without dead ends: 690 [2018-12-02 23:24:21,221 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 23:24:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-12-02 23:24:21,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2018-12-02 23:24:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 688 states. [2018-12-02 23:24:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1190 transitions. [2018-12-02 23:24:21,233 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1190 transitions. Word has length 27 [2018-12-02 23:24:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,233 INFO L480 AbstractCegarLoop]: Abstraction has 688 states and 1190 transitions. [2018-12-02 23:24:21,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1190 transitions. [2018-12-02 23:24:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 23:24:21,234 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,234 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] [2018-12-02 23:24:21,234 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1970780365, now seen corresponding path program 1 times [2018-12-02 23:24:21,235 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,246 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 23:24:21,247 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,247 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,247 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,247 INFO L87 Difference]: Start difference. First operand 688 states and 1190 transitions. Second operand 3 states. [2018-12-02 23:24:21,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,262 INFO L93 Difference]: Finished difference Result 1032 states and 1780 transitions. [2018-12-02 23:24:21,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 23:24:21,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,263 INFO L225 Difference]: With dead ends: 1032 [2018-12-02 23:24:21,264 INFO L226 Difference]: Without dead ends: 698 [2018-12-02 23:24:21,264 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 23:24:21,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2018-12-02 23:24:21,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 696. [2018-12-02 23:24:21,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2018-12-02 23:24:21,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1190 transitions. [2018-12-02 23:24:21,277 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1190 transitions. Word has length 28 [2018-12-02 23:24:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,277 INFO L480 AbstractCegarLoop]: Abstraction has 696 states and 1190 transitions. [2018-12-02 23:24:21,277 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,277 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1190 transitions. [2018-12-02 23:24:21,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 23:24:21,277 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,278 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:24:21,278 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,278 INFO L82 PathProgramCache]: Analyzing trace with hash 330042225, now seen corresponding path program 1 times [2018-12-02 23:24:21,278 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,278 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,279 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,279 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,279 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,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 23:24:21,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,290 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,290 INFO L87 Difference]: Start difference. First operand 696 states and 1190 transitions. Second operand 3 states. [2018-12-02 23:24:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,307 INFO L93 Difference]: Finished difference Result 1292 states and 2248 transitions. [2018-12-02 23:24:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,307 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 23:24:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,310 INFO L225 Difference]: With dead ends: 1292 [2018-12-02 23:24:21,310 INFO L226 Difference]: Without dead ends: 1290 [2018-12-02 23:24:21,310 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 23:24:21,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2018-12-02 23:24:21,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 968. [2018-12-02 23:24:21,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 968 states. [2018-12-02 23:24:21,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1622 transitions. [2018-12-02 23:24:21,328 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1622 transitions. Word has length 28 [2018-12-02 23:24:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,328 INFO L480 AbstractCegarLoop]: Abstraction has 968 states and 1622 transitions. [2018-12-02 23:24:21,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,329 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1622 transitions. [2018-12-02 23:24:21,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-02 23:24:21,330 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,330 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] [2018-12-02 23:24:21,330 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1258305677, now seen corresponding path program 1 times [2018-12-02 23:24:21,331 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,331 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,331 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:21,345 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,345 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,345 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,345 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,346 INFO L87 Difference]: Start difference. First operand 968 states and 1622 transitions. Second operand 3 states. [2018-12-02 23:24:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,377 INFO L93 Difference]: Finished difference Result 2300 states and 3880 transitions. [2018-12-02 23:24:21,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,377 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-02 23:24:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,381 INFO L225 Difference]: With dead ends: 2300 [2018-12-02 23:24:21,381 INFO L226 Difference]: Without dead ends: 1354 [2018-12-02 23:24:21,383 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 23:24:21,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1354 states. [2018-12-02 23:24:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1354 to 1352. [2018-12-02 23:24:21,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1352 states. [2018-12-02 23:24:21,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1352 states to 1352 states and 2262 transitions. [2018-12-02 23:24:21,418 INFO L78 Accepts]: Start accepts. Automaton has 1352 states and 2262 transitions. Word has length 28 [2018-12-02 23:24:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,418 INFO L480 AbstractCegarLoop]: Abstraction has 1352 states and 2262 transitions. [2018-12-02 23:24:21,418 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1352 states and 2262 transitions. [2018-12-02 23:24:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 23:24:21,420 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,420 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] [2018-12-02 23:24:21,420 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1641587831, now seen corresponding path program 1 times [2018-12-02 23:24:21,420 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,421 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,421 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,421 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,435 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 23:24:21,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,436 INFO L87 Difference]: Start difference. First operand 1352 states and 2262 transitions. Second operand 3 states. [2018-12-02 23:24:21,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,468 INFO L93 Difference]: Finished difference Result 2028 states and 3384 transitions. [2018-12-02 23:24:21,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 23:24:21,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,472 INFO L225 Difference]: With dead ends: 2028 [2018-12-02 23:24:21,472 INFO L226 Difference]: Without dead ends: 1370 [2018-12-02 23:24:21,473 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 23:24:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1370 states. [2018-12-02 23:24:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1370 to 1368. [2018-12-02 23:24:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1368 states. [2018-12-02 23:24:21,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1368 states to 1368 states and 2262 transitions. [2018-12-02 23:24:21,507 INFO L78 Accepts]: Start accepts. Automaton has 1368 states and 2262 transitions. Word has length 29 [2018-12-02 23:24:21,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,507 INFO L480 AbstractCegarLoop]: Abstraction has 1368 states and 2262 transitions. [2018-12-02 23:24:21,507 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1368 states and 2262 transitions. [2018-12-02 23:24:21,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 23:24:21,508 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,508 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] [2018-12-02 23:24:21,508 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,509 INFO L82 PathProgramCache]: Analyzing trace with hash -352556875, now seen corresponding path program 1 times [2018-12-02 23:24:21,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,509 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,510 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,519 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:21,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,519 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,519 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,520 INFO L87 Difference]: Start difference. First operand 1368 states and 2262 transitions. Second operand 3 states. [2018-12-02 23:24:21,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,556 INFO L93 Difference]: Finished difference Result 2508 states and 4232 transitions. [2018-12-02 23:24:21,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 23:24:21,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,562 INFO L225 Difference]: With dead ends: 2508 [2018-12-02 23:24:21,562 INFO L226 Difference]: Without dead ends: 2506 [2018-12-02 23:24:21,563 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 23:24:21,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2018-12-02 23:24:21,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 1928. [2018-12-02 23:24:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2018-12-02 23:24:21,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 3110 transitions. [2018-12-02 23:24:21,600 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 3110 transitions. Word has length 29 [2018-12-02 23:24:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,600 INFO L480 AbstractCegarLoop]: Abstraction has 1928 states and 3110 transitions. [2018-12-02 23:24:21,600 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,600 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 3110 transitions. [2018-12-02 23:24:21,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 23:24:21,602 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,602 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] [2018-12-02 23:24:21,602 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1940904777, now seen corresponding path program 1 times [2018-12-02 23:24:21,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,612 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 23:24:21,613 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,613 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,613 INFO L87 Difference]: Start difference. First operand 1928 states and 3110 transitions. Second operand 3 states. [2018-12-02 23:24:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,658 INFO L93 Difference]: Finished difference Result 4556 states and 7400 transitions. [2018-12-02 23:24:21,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,658 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-02 23:24:21,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,665 INFO L225 Difference]: With dead ends: 4556 [2018-12-02 23:24:21,665 INFO L226 Difference]: Without dead ends: 2666 [2018-12-02 23:24:21,668 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 23:24:21,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2018-12-02 23:24:21,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2664. [2018-12-02 23:24:21,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2664 states. [2018-12-02 23:24:21,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2664 states to 2664 states and 4294 transitions. [2018-12-02 23:24:21,735 INFO L78 Accepts]: Start accepts. Automaton has 2664 states and 4294 transitions. Word has length 29 [2018-12-02 23:24:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,735 INFO L480 AbstractCegarLoop]: Abstraction has 2664 states and 4294 transitions. [2018-12-02 23:24:21,735 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,735 INFO L276 IsEmpty]: Start isEmpty. Operand 2664 states and 4294 transitions. [2018-12-02 23:24:21,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 23:24:21,737 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,737 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] [2018-12-02 23:24:21,738 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1955852552, now seen corresponding path program 1 times [2018-12-02 23:24:21,738 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,739 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,751 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 23:24:21,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,752 INFO L87 Difference]: Start difference. First operand 2664 states and 4294 transitions. Second operand 3 states. [2018-12-02 23:24:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,778 INFO L93 Difference]: Finished difference Result 3996 states and 6424 transitions. [2018-12-02 23:24:21,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,778 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 23:24:21,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,783 INFO L225 Difference]: With dead ends: 3996 [2018-12-02 23:24:21,783 INFO L226 Difference]: Without dead ends: 2698 [2018-12-02 23:24:21,784 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 23:24:21,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-02 23:24:21,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2696. [2018-12-02 23:24:21,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2696 states. [2018-12-02 23:24:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2696 states to 2696 states and 4294 transitions. [2018-12-02 23:24:21,821 INFO L78 Accepts]: Start accepts. Automaton has 2696 states and 4294 transitions. Word has length 30 [2018-12-02 23:24:21,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,821 INFO L480 AbstractCegarLoop]: Abstraction has 2696 states and 4294 transitions. [2018-12-02 23:24:21,821 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2696 states and 4294 transitions. [2018-12-02 23:24:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 23:24:21,823 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,823 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] [2018-12-02 23:24:21,823 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,823 INFO L82 PathProgramCache]: Analyzing trace with hash -38292154, now seen corresponding path program 1 times [2018-12-02 23:24:21,823 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,824 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,834 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 23:24:21,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,834 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,834 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,835 INFO L87 Difference]: Start difference. First operand 2696 states and 4294 transitions. Second operand 3 states. [2018-12-02 23:24:21,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:21,882 INFO L93 Difference]: Finished difference Result 4876 states and 7944 transitions. [2018-12-02 23:24:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:21,882 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 23:24:21,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:21,890 INFO L225 Difference]: With dead ends: 4876 [2018-12-02 23:24:21,890 INFO L226 Difference]: Without dead ends: 4874 [2018-12-02 23:24:21,892 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 23:24:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4874 states. [2018-12-02 23:24:21,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4874 to 3848. [2018-12-02 23:24:21,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3848 states. [2018-12-02 23:24:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3848 states to 3848 states and 5958 transitions. [2018-12-02 23:24:21,948 INFO L78 Accepts]: Start accepts. Automaton has 3848 states and 5958 transitions. Word has length 30 [2018-12-02 23:24:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:21,949 INFO L480 AbstractCegarLoop]: Abstraction has 3848 states and 5958 transitions. [2018-12-02 23:24:21,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 3848 states and 5958 transitions. [2018-12-02 23:24:21,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-02 23:24:21,951 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:21,951 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] [2018-12-02 23:24:21,951 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:21,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash -1626640056, now seen corresponding path program 1 times [2018-12-02 23:24:21,952 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:21,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:21,952 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:21,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:21,963 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 23:24:21,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:21,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:21,963 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:21,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:21,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:21,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:21,964 INFO L87 Difference]: Start difference. First operand 3848 states and 5958 transitions. Second operand 3 states. [2018-12-02 23:24:22,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:22,017 INFO L93 Difference]: Finished difference Result 9036 states and 14088 transitions. [2018-12-02 23:24:22,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:22,017 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-02 23:24:22,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:22,031 INFO L225 Difference]: With dead ends: 9036 [2018-12-02 23:24:22,031 INFO L226 Difference]: Without dead ends: 5258 [2018-12-02 23:24:22,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:22,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-02 23:24:22,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 5256. [2018-12-02 23:24:22,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5256 states. [2018-12-02 23:24:22,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5256 states to 5256 states and 8134 transitions. [2018-12-02 23:24:22,119 INFO L78 Accepts]: Start accepts. Automaton has 5256 states and 8134 transitions. Word has length 30 [2018-12-02 23:24:22,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:22,119 INFO L480 AbstractCegarLoop]: Abstraction has 5256 states and 8134 transitions. [2018-12-02 23:24:22,119 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 5256 states and 8134 transitions. [2018-12-02 23:24:22,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 23:24:22,121 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:22,122 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] [2018-12-02 23:24:22,122 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:22,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:22,122 INFO L82 PathProgramCache]: Analyzing trace with hash -1186842644, now seen corresponding path program 1 times [2018-12-02 23:24:22,122 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:22,122 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:22,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,123 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:22,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:22,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:22,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:22,131 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:22,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:22,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:22,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:22,131 INFO L87 Difference]: Start difference. First operand 5256 states and 8134 transitions. Second operand 3 states. [2018-12-02 23:24:22,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:22,186 INFO L93 Difference]: Finished difference Result 7884 states and 12168 transitions. [2018-12-02 23:24:22,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:22,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 23:24:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:22,193 INFO L225 Difference]: With dead ends: 7884 [2018-12-02 23:24:22,193 INFO L226 Difference]: Without dead ends: 5322 [2018-12-02 23:24:22,196 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 23:24:22,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5322 states. [2018-12-02 23:24:22,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5322 to 5320. [2018-12-02 23:24:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5320 states. [2018-12-02 23:24:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5320 states to 5320 states and 8134 transitions. [2018-12-02 23:24:22,263 INFO L78 Accepts]: Start accepts. Automaton has 5320 states and 8134 transitions. Word has length 31 [2018-12-02 23:24:22,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:22,263 INFO L480 AbstractCegarLoop]: Abstraction has 5320 states and 8134 transitions. [2018-12-02 23:24:22,263 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:22,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5320 states and 8134 transitions. [2018-12-02 23:24:22,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 23:24:22,266 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:22,266 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] [2018-12-02 23:24:22,266 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:22,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:22,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1113979946, now seen corresponding path program 1 times [2018-12-02 23:24:22,266 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:22,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,267 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:22,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,267 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:22,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:22,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 23:24:22,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:22,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:22,275 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:22,275 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:22,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:22,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:22,275 INFO L87 Difference]: Start difference. First operand 5320 states and 8134 transitions. Second operand 3 states. [2018-12-02 23:24:22,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:22,355 INFO L93 Difference]: Finished difference Result 15564 states and 23624 transitions. [2018-12-02 23:24:22,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:22,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 23:24:22,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:22,367 INFO L225 Difference]: With dead ends: 15564 [2018-12-02 23:24:22,368 INFO L226 Difference]: Without dead ends: 10378 [2018-12-02 23:24:22,374 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 23:24:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10378 states. [2018-12-02 23:24:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10378 to 10376. [2018-12-02 23:24:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-02 23:24:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15494 transitions. [2018-12-02 23:24:22,560 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15494 transitions. Word has length 31 [2018-12-02 23:24:22,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:22,560 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15494 transitions. [2018-12-02 23:24:22,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:22,561 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15494 transitions. [2018-12-02 23:24:22,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 23:24:22,565 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:22,566 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] [2018-12-02 23:24:22,566 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:22,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash -1592639448, now seen corresponding path program 1 times [2018-12-02 23:24:22,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:22,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:22,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:22,576 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 23:24:22,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:22,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:22,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:22,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:22,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:22,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:22,577 INFO L87 Difference]: Start difference. First operand 10376 states and 15494 transitions. Second operand 3 states. [2018-12-02 23:24:22,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:22,714 INFO L93 Difference]: Finished difference Result 12172 states and 18824 transitions. [2018-12-02 23:24:22,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:22,714 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-02 23:24:22,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:22,726 INFO L225 Difference]: With dead ends: 12172 [2018-12-02 23:24:22,726 INFO L226 Difference]: Without dead ends: 12170 [2018-12-02 23:24:22,729 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 23:24:22,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12170 states. [2018-12-02 23:24:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12170 to 10376. [2018-12-02 23:24:22,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10376 states. [2018-12-02 23:24:22,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10376 states to 10376 states and 15366 transitions. [2018-12-02 23:24:22,852 INFO L78 Accepts]: Start accepts. Automaton has 10376 states and 15366 transitions. Word has length 31 [2018-12-02 23:24:22,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:22,852 INFO L480 AbstractCegarLoop]: Abstraction has 10376 states and 15366 transitions. [2018-12-02 23:24:22,852 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 10376 states and 15366 transitions. [2018-12-02 23:24:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 23:24:22,857 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:22,857 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] [2018-12-02 23:24:22,857 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:22,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:22,857 INFO L82 PathProgramCache]: Analyzing trace with hash 173854429, now seen corresponding path program 1 times [2018-12-02 23:24:22,857 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:22,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:22,858 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:22,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:22,866 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 23:24:22,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:22,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:22,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:22,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:22,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:22,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:22,866 INFO L87 Difference]: Start difference. First operand 10376 states and 15366 transitions. Second operand 3 states. [2018-12-02 23:24:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:23,006 INFO L93 Difference]: Finished difference Result 18316 states and 27784 transitions. [2018-12-02 23:24:23,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:23,006 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 23:24:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:23,025 INFO L225 Difference]: With dead ends: 18316 [2018-12-02 23:24:23,025 INFO L226 Difference]: Without dead ends: 18314 [2018-12-02 23:24:23,028 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 23:24:23,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18314 states. [2018-12-02 23:24:23,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18314 to 15240. [2018-12-02 23:24:23,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15240 states. [2018-12-02 23:24:23,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15240 states to 15240 states and 21894 transitions. [2018-12-02 23:24:23,201 INFO L78 Accepts]: Start accepts. Automaton has 15240 states and 21894 transitions. Word has length 32 [2018-12-02 23:24:23,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:23,201 INFO L480 AbstractCegarLoop]: Abstraction has 15240 states and 21894 transitions. [2018-12-02 23:24:23,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:23,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15240 states and 21894 transitions. [2018-12-02 23:24:23,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 23:24:23,210 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:23,210 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:24:23,210 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:23,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:23,211 INFO L82 PathProgramCache]: Analyzing trace with hash -1414493473, now seen corresponding path program 1 times [2018-12-02 23:24:23,211 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:23,211 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:23,211 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:23,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:23,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:23,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:23,225 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 23:24:23,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:23,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:23,226 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:23,226 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:23,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:23,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:23,227 INFO L87 Difference]: Start difference. First operand 15240 states and 21894 transitions. Second operand 3 states. [2018-12-02 23:24:23,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:23,378 INFO L93 Difference]: Finished difference Result 35468 states and 51336 transitions. [2018-12-02 23:24:23,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:23,378 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-02 23:24:23,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:23,394 INFO L225 Difference]: With dead ends: 35468 [2018-12-02 23:24:23,394 INFO L226 Difference]: Without dead ends: 20362 [2018-12-02 23:24:23,406 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 23:24:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20362 states. [2018-12-02 23:24:23,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20362 to 20360. [2018-12-02 23:24:23,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20360 states. [2018-12-02 23:24:23,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20360 states to 20360 states and 29190 transitions. [2018-12-02 23:24:23,612 INFO L78 Accepts]: Start accepts. Automaton has 20360 states and 29190 transitions. Word has length 32 [2018-12-02 23:24:23,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:23,613 INFO L480 AbstractCegarLoop]: Abstraction has 20360 states and 29190 transitions. [2018-12-02 23:24:23,613 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:23,613 INFO L276 IsEmpty]: Start isEmpty. Operand 20360 states and 29190 transitions. [2018-12-02 23:24:23,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 23:24:23,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:23,619 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] [2018-12-02 23:24:23,619 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:23,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:23,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1094734815, now seen corresponding path program 1 times [2018-12-02 23:24:23,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:23,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:23,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:23,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:23,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:23,637 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 23:24:23,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:23,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:23,637 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:23,637 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:23,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:23,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:23,638 INFO L87 Difference]: Start difference. First operand 20360 states and 29190 transitions. Second operand 3 states. [2018-12-02 23:24:23,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:23,767 INFO L93 Difference]: Finished difference Result 30732 states and 44040 transitions. [2018-12-02 23:24:23,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:23,767 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 23:24:23,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:23,781 INFO L225 Difference]: With dead ends: 30732 [2018-12-02 23:24:23,781 INFO L226 Difference]: Without dead ends: 20746 [2018-12-02 23:24:23,789 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 23:24:23,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20746 states. [2018-12-02 23:24:24,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20746 to 20744. [2018-12-02 23:24:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20744 states. [2018-12-02 23:24:24,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20744 states to 20744 states and 29446 transitions. [2018-12-02 23:24:24,022 INFO L78 Accepts]: Start accepts. Automaton has 20744 states and 29446 transitions. Word has length 33 [2018-12-02 23:24:24,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:24,022 INFO L480 AbstractCegarLoop]: Abstraction has 20744 states and 29446 transitions. [2018-12-02 23:24:24,022 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:24,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20744 states and 29446 transitions. [2018-12-02 23:24:24,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 23:24:24,029 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:24,029 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] [2018-12-02 23:24:24,029 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:24,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:24,029 INFO L82 PathProgramCache]: Analyzing trace with hash -899409891, now seen corresponding path program 1 times [2018-12-02 23:24:24,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:24,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:24,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:24,030 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:24,052 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 23:24:24,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:24,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:24,052 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:24,053 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:24,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:24,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:24,053 INFO L87 Difference]: Start difference. First operand 20744 states and 29446 transitions. Second operand 3 states. [2018-12-02 23:24:24,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:24,267 INFO L93 Difference]: Finished difference Result 35852 states and 51976 transitions. [2018-12-02 23:24:24,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:24,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 23:24:24,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:24,288 INFO L225 Difference]: With dead ends: 35852 [2018-12-02 23:24:24,288 INFO L226 Difference]: Without dead ends: 35850 [2018-12-02 23:24:24,294 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 23:24:24,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35850 states. [2018-12-02 23:24:24,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35850 to 30728. [2018-12-02 23:24:24,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30728 states. [2018-12-02 23:24:24,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30728 states to 30728 states and 42246 transitions. [2018-12-02 23:24:24,659 INFO L78 Accepts]: Start accepts. Automaton has 30728 states and 42246 transitions. Word has length 33 [2018-12-02 23:24:24,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:24,659 INFO L480 AbstractCegarLoop]: Abstraction has 30728 states and 42246 transitions. [2018-12-02 23:24:24,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:24,659 INFO L276 IsEmpty]: Start isEmpty. Operand 30728 states and 42246 transitions. [2018-12-02 23:24:24,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-02 23:24:24,670 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:24,670 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] [2018-12-02 23:24:24,670 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:24,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:24,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1807209503, now seen corresponding path program 1 times [2018-12-02 23:24:24,670 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:24,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:24,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:24,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:24,671 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:24,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:24,680 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 23:24:24,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:24,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:24,680 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:24,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:24,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:24,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:24,681 INFO L87 Difference]: Start difference. First operand 30728 states and 42246 transitions. Second operand 3 states. [2018-12-02 23:24:24,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:24,955 INFO L93 Difference]: Finished difference Result 70668 states and 97544 transitions. [2018-12-02 23:24:24,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:24,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-02 23:24:24,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:24,981 INFO L225 Difference]: With dead ends: 70668 [2018-12-02 23:24:24,981 INFO L226 Difference]: Without dead ends: 40458 [2018-12-02 23:24:25,001 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 23:24:25,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40458 states. [2018-12-02 23:24:25,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40458 to 40456. [2018-12-02 23:24:25,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40456 states. [2018-12-02 23:24:25,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40456 states to 40456 states and 55302 transitions. [2018-12-02 23:24:25,495 INFO L78 Accepts]: Start accepts. Automaton has 40456 states and 55302 transitions. Word has length 33 [2018-12-02 23:24:25,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:25,495 INFO L480 AbstractCegarLoop]: Abstraction has 40456 states and 55302 transitions. [2018-12-02 23:24:25,495 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:25,495 INFO L276 IsEmpty]: Start isEmpty. Operand 40456 states and 55302 transitions. [2018-12-02 23:24:25,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 23:24:25,506 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:25,506 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] [2018-12-02 23:24:25,506 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:25,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:25,506 INFO L82 PathProgramCache]: Analyzing trace with hash -2111687692, now seen corresponding path program 1 times [2018-12-02 23:24:25,506 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:25,507 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:25,507 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:25,507 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:25,515 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 23:24:25,515 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:25,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:25,515 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:25,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:25,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:25,516 INFO L87 Difference]: Start difference. First operand 40456 states and 55302 transitions. Second operand 3 states. [2018-12-02 23:24:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:25,785 INFO L93 Difference]: Finished difference Result 60684 states and 82696 transitions. [2018-12-02 23:24:25,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:25,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 23:24:25,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:25,812 INFO L225 Difference]: With dead ends: 60684 [2018-12-02 23:24:25,812 INFO L226 Difference]: Without dead ends: 40970 [2018-12-02 23:24:25,826 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 23:24:25,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40970 states. [2018-12-02 23:24:26,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40970 to 40968. [2018-12-02 23:24:26,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40968 states. [2018-12-02 23:24:26,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40968 states to 40968 states and 55302 transitions. [2018-12-02 23:24:26,271 INFO L78 Accepts]: Start accepts. Automaton has 40968 states and 55302 transitions. Word has length 34 [2018-12-02 23:24:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:26,272 INFO L480 AbstractCegarLoop]: Abstraction has 40968 states and 55302 transitions. [2018-12-02 23:24:26,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:26,272 INFO L276 IsEmpty]: Start isEmpty. Operand 40968 states and 55302 transitions. [2018-12-02 23:24:26,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 23:24:26,286 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:26,286 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] [2018-12-02 23:24:26,287 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:26,287 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:26,287 INFO L82 PathProgramCache]: Analyzing trace with hash 189134898, now seen corresponding path program 1 times [2018-12-02 23:24:26,287 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:26,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:26,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:26,297 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 23:24:26,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:26,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:26,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:26,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:26,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:26,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:26,298 INFO L87 Difference]: Start difference. First operand 40968 states and 55302 transitions. Second operand 3 states. [2018-12-02 23:24:26,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:26,896 INFO L93 Difference]: Finished difference Result 69644 states and 95752 transitions. [2018-12-02 23:24:26,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:26,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 23:24:26,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:26,938 INFO L225 Difference]: With dead ends: 69644 [2018-12-02 23:24:26,938 INFO L226 Difference]: Without dead ends: 69642 [2018-12-02 23:24:26,946 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 23:24:26,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69642 states. [2018-12-02 23:24:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69642 to 61448. [2018-12-02 23:24:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61448 states. [2018-12-02 23:24:27,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61448 states to 61448 states and 80390 transitions. [2018-12-02 23:24:27,534 INFO L78 Accepts]: Start accepts. Automaton has 61448 states and 80390 transitions. Word has length 34 [2018-12-02 23:24:27,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:27,534 INFO L480 AbstractCegarLoop]: Abstraction has 61448 states and 80390 transitions. [2018-12-02 23:24:27,534 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:27,534 INFO L276 IsEmpty]: Start isEmpty. Operand 61448 states and 80390 transitions. [2018-12-02 23:24:27,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-02 23:24:27,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:27,557 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] [2018-12-02 23:24:27,557 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:27,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:27,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1399213004, now seen corresponding path program 1 times [2018-12-02 23:24:27,557 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:27,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:27,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:27,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:27,558 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:27,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:27,565 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 23:24:27,565 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:27,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:27,565 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:27,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:27,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:27,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:27,566 INFO L87 Difference]: Start difference. First operand 61448 states and 80390 transitions. Second operand 3 states. [2018-12-02 23:24:28,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:28,218 INFO L93 Difference]: Finished difference Result 140300 states and 183816 transitions. [2018-12-02 23:24:28,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:28,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-02 23:24:28,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:28,268 INFO L225 Difference]: With dead ends: 140300 [2018-12-02 23:24:28,268 INFO L226 Difference]: Without dead ends: 79882 [2018-12-02 23:24:28,298 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 23:24:28,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79882 states. [2018-12-02 23:24:29,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79882 to 79880. [2018-12-02 23:24:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79880 states. [2018-12-02 23:24:29,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79880 states to 79880 states and 103430 transitions. [2018-12-02 23:24:29,227 INFO L78 Accepts]: Start accepts. Automaton has 79880 states and 103430 transitions. Word has length 34 [2018-12-02 23:24:29,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:29,227 INFO L480 AbstractCegarLoop]: Abstraction has 79880 states and 103430 transitions. [2018-12-02 23:24:29,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:29,228 INFO L276 IsEmpty]: Start isEmpty. Operand 79880 states and 103430 transitions. [2018-12-02 23:24:29,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 23:24:29,258 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:29,258 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] [2018-12-02 23:24:29,258 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:29,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:29,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1568430036, now seen corresponding path program 1 times [2018-12-02 23:24:29,258 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:29,259 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:29,259 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:29,259 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:29,269 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 23:24:29,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:29,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:29,270 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:29,270 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:29,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:29,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:29,270 INFO L87 Difference]: Start difference. First operand 79880 states and 103430 transitions. Second operand 3 states. [2018-12-02 23:24:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:29,933 INFO L93 Difference]: Finished difference Result 119820 states and 154632 transitions. [2018-12-02 23:24:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:29,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-02 23:24:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:29,989 INFO L225 Difference]: With dead ends: 119820 [2018-12-02 23:24:29,989 INFO L226 Difference]: Without dead ends: 80906 [2018-12-02 23:24:30,016 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 23:24:30,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80906 states. [2018-12-02 23:24:31,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80906 to 80904. [2018-12-02 23:24:31,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80904 states. [2018-12-02 23:24:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80904 states to 80904 states and 103430 transitions. [2018-12-02 23:24:31,059 INFO L78 Accepts]: Start accepts. Automaton has 80904 states and 103430 transitions. Word has length 35 [2018-12-02 23:24:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:31,060 INFO L480 AbstractCegarLoop]: Abstraction has 80904 states and 103430 transitions. [2018-12-02 23:24:31,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 80904 states and 103430 transitions. [2018-12-02 23:24:31,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 23:24:31,081 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:31,081 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] [2018-12-02 23:24:31,081 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:31,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:31,082 INFO L82 PathProgramCache]: Analyzing trace with hash -425714670, now seen corresponding path program 1 times [2018-12-02 23:24:31,082 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:31,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:31,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:31,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:31,083 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:31,093 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 23:24:31,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:31,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:31,094 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:31,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:31,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:31,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:31,094 INFO L87 Difference]: Start difference. First operand 80904 states and 103430 transitions. Second operand 3 states. [2018-12-02 23:24:32,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:32,076 INFO L93 Difference]: Finished difference Result 135180 states and 175112 transitions. [2018-12-02 23:24:32,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:32,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-02 23:24:32,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:32,176 INFO L225 Difference]: With dead ends: 135180 [2018-12-02 23:24:32,176 INFO L226 Difference]: Without dead ends: 135178 [2018-12-02 23:24:32,203 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 23:24:32,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135178 states. [2018-12-02 23:24:33,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135178 to 122888. [2018-12-02 23:24:33,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122888 states. [2018-12-02 23:24:33,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122888 states to 122888 states and 152582 transitions. [2018-12-02 23:24:33,625 INFO L78 Accepts]: Start accepts. Automaton has 122888 states and 152582 transitions. Word has length 35 [2018-12-02 23:24:33,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:33,626 INFO L480 AbstractCegarLoop]: Abstraction has 122888 states and 152582 transitions. [2018-12-02 23:24:33,626 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:33,626 INFO L276 IsEmpty]: Start isEmpty. Operand 122888 states and 152582 transitions. [2018-12-02 23:24:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 23:24:33,676 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:33,676 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] [2018-12-02 23:24:33,676 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:33,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash -2014062572, now seen corresponding path program 1 times [2018-12-02 23:24:33,677 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:33,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:33,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:33,677 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:33,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:33,689 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 23:24:33,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:33,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:33,690 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:33,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:33,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:33,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:33,691 INFO L87 Difference]: Start difference. First operand 122888 states and 152582 transitions. Second operand 3 states. [2018-12-02 23:24:35,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:35,032 INFO L93 Difference]: Finished difference Result 278540 states and 345096 transitions. [2018-12-02 23:24:35,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:35,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-02 23:24:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:35,152 INFO L225 Difference]: With dead ends: 278540 [2018-12-02 23:24:35,152 INFO L226 Difference]: Without dead ends: 157706 [2018-12-02 23:24:35,224 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 23:24:35,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157706 states. [2018-12-02 23:24:37,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157706 to 157704. [2018-12-02 23:24:37,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157704 states. [2018-12-02 23:24:37,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157704 states to 157704 states and 192518 transitions. [2018-12-02 23:24:37,257 INFO L78 Accepts]: Start accepts. Automaton has 157704 states and 192518 transitions. Word has length 35 [2018-12-02 23:24:37,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:37,257 INFO L480 AbstractCegarLoop]: Abstraction has 157704 states and 192518 transitions. [2018-12-02 23:24:37,257 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:37,257 INFO L276 IsEmpty]: Start isEmpty. Operand 157704 states and 192518 transitions. [2018-12-02 23:24:37,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:24:37,312 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:37,312 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 23:24:37,312 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:37,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:37,312 INFO L82 PathProgramCache]: Analyzing trace with hash -312037047, now seen corresponding path program 1 times [2018-12-02 23:24:37,312 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:37,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:37,313 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:37,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:37,324 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 23:24:37,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:37,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:37,325 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:37,325 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:37,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:37,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:37,325 INFO L87 Difference]: Start difference. First operand 157704 states and 192518 transitions. Second operand 3 states. [2018-12-02 23:24:38,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:38,784 INFO L93 Difference]: Finished difference Result 236556 states and 287752 transitions. [2018-12-02 23:24:38,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:38,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:24:38,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:38,894 INFO L225 Difference]: With dead ends: 236556 [2018-12-02 23:24:38,894 INFO L226 Difference]: Without dead ends: 159754 [2018-12-02 23:24:38,938 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 23:24:39,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159754 states. [2018-12-02 23:24:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159754 to 159752. [2018-12-02 23:24:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159752 states. [2018-12-02 23:24:40,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159752 states to 159752 states and 192518 transitions. [2018-12-02 23:24:40,819 INFO L78 Accepts]: Start accepts. Automaton has 159752 states and 192518 transitions. Word has length 36 [2018-12-02 23:24:40,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:40,819 INFO L480 AbstractCegarLoop]: Abstraction has 159752 states and 192518 transitions. [2018-12-02 23:24:40,820 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:40,820 INFO L276 IsEmpty]: Start isEmpty. Operand 159752 states and 192518 transitions. [2018-12-02 23:24:40,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:24:40,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:40,873 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 23:24:40,873 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:40,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:40,874 INFO L82 PathProgramCache]: Analyzing trace with hash 1988785543, now seen corresponding path program 1 times [2018-12-02 23:24:40,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:40,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:40,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:40,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:40,875 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:40,883 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 23:24:40,884 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:40,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:40,884 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:40,884 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:40,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:40,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:40,885 INFO L87 Difference]: Start difference. First operand 159752 states and 192518 transitions. Second operand 3 states. [2018-12-02 23:24:43,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:43,057 INFO L93 Difference]: Finished difference Result 262156 states and 317448 transitions. [2018-12-02 23:24:43,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:43,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:24:43,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:43,277 INFO L225 Difference]: With dead ends: 262156 [2018-12-02 23:24:43,278 INFO L226 Difference]: Without dead ends: 262154 [2018-12-02 23:24:43,313 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 23:24:43,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262154 states. [2018-12-02 23:24:47,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262154 to 245768. [2018-12-02 23:24:47,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245768 states. [2018-12-02 23:24:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245768 states to 245768 states and 288774 transitions. [2018-12-02 23:24:47,438 INFO L78 Accepts]: Start accepts. Automaton has 245768 states and 288774 transitions. Word has length 36 [2018-12-02 23:24:47,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:47,438 INFO L480 AbstractCegarLoop]: Abstraction has 245768 states and 288774 transitions. [2018-12-02 23:24:47,438 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:47,438 INFO L276 IsEmpty]: Start isEmpty. Operand 245768 states and 288774 transitions. [2018-12-02 23:24:47,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-02 23:24:47,543 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:47,543 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 23:24:47,543 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:47,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:47,543 INFO L82 PathProgramCache]: Analyzing trace with hash 400437641, now seen corresponding path program 1 times [2018-12-02 23:24:47,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:47,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:47,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:47,544 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:47,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:47,553 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 23:24:47,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:47,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:47,554 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:47,554 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:47,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:47,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:47,554 INFO L87 Difference]: Start difference. First operand 245768 states and 288774 transitions. Second operand 3 states. [2018-12-02 23:24:50,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:50,283 INFO L93 Difference]: Finished difference Result 552972 states and 645128 transitions. [2018-12-02 23:24:50,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:50,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-02 23:24:50,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:50,550 INFO L225 Difference]: With dead ends: 552972 [2018-12-02 23:24:50,551 INFO L226 Difference]: Without dead ends: 311306 [2018-12-02 23:24:50,698 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 23:24:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311306 states. [2018-12-02 23:24:54,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311306 to 311304. [2018-12-02 23:24:54,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311304 states. [2018-12-02 23:24:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311304 states to 311304 states and 356358 transitions. [2018-12-02 23:24:55,149 INFO L78 Accepts]: Start accepts. Automaton has 311304 states and 356358 transitions. Word has length 36 [2018-12-02 23:24:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:24:55,149 INFO L480 AbstractCegarLoop]: Abstraction has 311304 states and 356358 transitions. [2018-12-02 23:24:55,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:24:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 311304 states and 356358 transitions. [2018-12-02 23:24:55,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 23:24:55,255 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:24:55,255 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] [2018-12-02 23:24:55,255 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:24:55,256 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:24:55,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1523025865, now seen corresponding path program 1 times [2018-12-02 23:24:55,256 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:24:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:55,256 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:24:55,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:24:55,256 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:24:55,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:24:55,265 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 23:24:55,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:24:55,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:24:55,265 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:24:55,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:24:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:24:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:24:55,266 INFO L87 Difference]: Start difference. First operand 311304 states and 356358 transitions. Second operand 3 states. [2018-12-02 23:24:57,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:24:57,892 INFO L93 Difference]: Finished difference Result 466956 states and 532488 transitions. [2018-12-02 23:24:57,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:24:57,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-02 23:24:57,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:24:58,179 INFO L225 Difference]: With dead ends: 466956 [2018-12-02 23:24:58,179 INFO L226 Difference]: Without dead ends: 315402 [2018-12-02 23:24:58,303 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 23:24:58,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315402 states. [2018-12-02 23:25:03,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315402 to 315400. [2018-12-02 23:25:03,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315400 states. [2018-12-02 23:25:04,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315400 states to 315400 states and 356358 transitions. [2018-12-02 23:25:04,168 INFO L78 Accepts]: Start accepts. Automaton has 315400 states and 356358 transitions. Word has length 37 [2018-12-02 23:25:04,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:04,168 INFO L480 AbstractCegarLoop]: Abstraction has 315400 states and 356358 transitions. [2018-12-02 23:25:04,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:04,168 INFO L276 IsEmpty]: Start isEmpty. Operand 315400 states and 356358 transitions. [2018-12-02 23:25:04,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 23:25:04,274 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:04,274 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] [2018-12-02 23:25:04,274 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:04,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:04,274 INFO L82 PathProgramCache]: Analyzing trace with hash -471118841, now seen corresponding path program 1 times [2018-12-02 23:25:04,274 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:04,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:04,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:04,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:04,275 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:04,297 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 23:25:04,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:04,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:04,297 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:04,297 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:04,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:04,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:04,297 INFO L87 Difference]: Start difference. First operand 315400 states and 356358 transitions. Second operand 3 states. [2018-12-02 23:25:08,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:08,942 INFO L93 Difference]: Finished difference Result 507914 states and 569351 transitions. [2018-12-02 23:25:08,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:08,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-02 23:25:08,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:09,366 INFO L225 Difference]: With dead ends: 507914 [2018-12-02 23:25:09,366 INFO L226 Difference]: Without dead ends: 507912 [2018-12-02 23:25:09,415 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 23:25:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507912 states. [2018-12-02 23:25:14,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507912 to 491528. [2018-12-02 23:25:14,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 491528 states. [2018-12-02 23:25:14,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491528 states to 491528 states and 544774 transitions. [2018-12-02 23:25:14,976 INFO L78 Accepts]: Start accepts. Automaton has 491528 states and 544774 transitions. Word has length 37 [2018-12-02 23:25:14,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:14,976 INFO L480 AbstractCegarLoop]: Abstraction has 491528 states and 544774 transitions. [2018-12-02 23:25:14,976 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:14,976 INFO L276 IsEmpty]: Start isEmpty. Operand 491528 states and 544774 transitions. [2018-12-02 23:25:15,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 23:25:15,186 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 23:25:15,186 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] [2018-12-02 23:25:15,186 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-02 23:25:15,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 23:25:15,186 INFO L82 PathProgramCache]: Analyzing trace with hash -2059466743, now seen corresponding path program 1 times [2018-12-02 23:25:15,186 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 23:25:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:15,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 23:25:15,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 23:25:15,187 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 23:25:15,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 23:25:15,198 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 23:25:15,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 23:25:15,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 23:25:15,198 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 23:25:15,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 23:25:15,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 23:25:15,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 23:25:15,199 INFO L87 Difference]: Start difference. First operand 491528 states and 544774 transitions. Second operand 3 states. [2018-12-02 23:25:22,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 23:25:22,744 INFO L93 Difference]: Finished difference Result 1097736 states and 1200134 transitions. [2018-12-02 23:25:22,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 23:25:22,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-02 23:25:22,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 23:25:22,745 INFO L225 Difference]: With dead ends: 1097736 [2018-12-02 23:25:22,745 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 23:25:23,096 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 23:25:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 23:25:23,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 23:25:23,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 23:25:23,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 23:25:23,096 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 37 [2018-12-02 23:25:23,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 23:25:23,096 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 23:25:23,097 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 23:25:23,097 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 23:25:23,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 23:25:23,100 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 23:25:23,148 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 23:25:23,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 23:25:23,148 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 23:25:23,148 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 23:25:23,148 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 219) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L184-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L118-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L185(line 185) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L86(lines 86 88) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L53(lines 53 55) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L86-2(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L169-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 217) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 219) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L170(line 170) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L154-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,149 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L155(line 155) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L122-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L106-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L451 ceAbstractionStarter]: At program point L209-1(lines 51 214) the Hoare annotation is: true [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L110-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-12-02 23:25:23,150 INFO L448 ceAbstractionStarter]: For program point L94-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L210(line 210) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L444 ceAbstractionStarter]: At program point L210-1(lines 5 219) the Hoare annotation is: false [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L194-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 219) the Hoare annotation is: true [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L179-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L130-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L164-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,151 INFO L448 ceAbstractionStarter]: For program point L98-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,152 INFO L448 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-12-02 23:25:23,152 INFO L451 ceAbstractionStarter]: At program point L215(lines 5 219) the Hoare annotation is: true [2018-12-02 23:25:23,152 INFO L448 ceAbstractionStarter]: For program point L149-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,152 INFO L448 ceAbstractionStarter]: For program point L199-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,152 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-12-02 23:25:23,152 INFO L448 ceAbstractionStarter]: For program point L200(line 200) no Hoare annotation was computed. [2018-12-02 23:25:23,152 INFO L448 ceAbstractionStarter]: For program point L134-1(lines 51 214) no Hoare annotation was computed. [2018-12-02 23:25:23,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 11:25:23 BoogieIcfgContainer [2018-12-02 23:25:23,158 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 23:25:23,158 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 23:25:23,158 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 23:25:23,159 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 23:25:23,159 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 11:24:20" (3/4) ... [2018-12-02 23:25:23,162 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 23:25:23,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 23:25:23,168 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 23:25:23,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-02 23:25:23,173 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-02 23:25:23,174 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 23:25:23,214 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3f28eecc-63c6-4cef-9d10-3290a7ff1f75/bin-2019/utaipan/witness.graphml [2018-12-02 23:25:23,215 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 23:25:23,215 INFO L168 Benchmark]: Toolchain (without parser) took 63058.75 ms. Allocated memory was 1.0 GB in the beginning and 6.6 GB in the end (delta: 5.6 GB). Free memory was 957.8 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,216 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 23:25:23,216 INFO L168 Benchmark]: CACSL2BoogieTranslator took 137.19 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 945.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,216 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.96 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 940.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,216 INFO L168 Benchmark]: Boogie Preprocessor took 48.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,217 INFO L168 Benchmark]: RCFGBuilder took 204.12 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: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,217 INFO L168 Benchmark]: TraceAbstraction took 62597.78 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,217 INFO L168 Benchmark]: Witness Printer took 56.20 ms. Allocated memory is still 6.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2018-12-02 23:25:23,218 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 137.19 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 945.9 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 11.96 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 940.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 121.1 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.12 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: 32.8 MB). Peak memory consumption was 32.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 62597.78 ms. Allocated memory was 1.2 GB in the beginning and 6.6 GB in the end (delta: 5.5 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 3.5 GB. Max. memory is 11.5 GB. * Witness Printer took 56.20 ms. Allocated memory is still 6.6 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 217]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 56 locations, 1 error locations. SAFE Result, 62.5s OverallTime, 40 OverallIterations, 1 TraceHistogramMax, 30.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4632 SDtfs, 2311 SDslu, 3194 SDs, 0 SdLazy, 213 SolverSat, 40 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=491528occurred in iteration=39, 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: 30.6s AutomataMinimizationTime, 40 MinimizatonAttempts, 65580 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 16394 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 1225 NumberOfCodeBlocks, 1225 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 1185 ConstructedInterpolants, 0 QuantifiedInterpolants, 74775 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...