./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/locks/test_locks_15_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_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/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 129b0578c0c64625cef50fbcfd5d128651ff3275 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 00:56:16,461 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 00:56:16,462 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 00:56:16,468 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 00:56:16,468 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 00:56:16,469 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 00:56:16,469 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 00:56:16,470 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 00:56:16,471 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 00:56:16,472 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 00:56:16,472 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 00:56:16,472 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 00:56:16,473 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 00:56:16,473 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 00:56:16,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 00:56:16,474 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 00:56:16,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 00:56:16,475 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 00:56:16,476 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 00:56:16,477 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 00:56:16,478 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 00:56:16,478 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 00:56:16,480 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 00:56:16,480 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 00:56:16,480 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 00:56:16,480 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 00:56:16,481 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 00:56:16,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 00:56:16,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 00:56:16,482 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 00:56:16,482 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 00:56:16,483 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 00:56:16,483 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 00:56:16,483 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 00:56:16,484 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 00:56:16,484 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 00:56:16,484 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-09 00:56:16,491 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 00:56:16,491 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 00:56:16,492 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 00:56:16,492 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 00:56:16,492 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 00:56:16,492 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 00:56:16,492 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 00:56:16,493 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 00:56:16,493 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 00:56:16,493 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 00:56:16,493 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 00:56:16,493 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 00:56:16,493 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 00:56:16,494 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 00:56:16,494 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-09 00:56:16,495 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 00:56:16,495 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 00:56:16,495 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 00:56:16,495 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 00:56:16,495 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 00:56:16,495 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 00:56:16,495 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:56:16,495 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 00:56:16,496 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 00:56:16,496 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 00:56:16,496 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 00:56:16,496 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 00:56:16,496 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 00:56:16,496 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 00:56:16,496 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_139a3a10-faa1-477c-b635-71c99256932f/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 -> 129b0578c0c64625cef50fbcfd5d128651ff3275 [2018-12-09 00:56:16,513 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 00:56:16,520 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 00:56:16,522 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 00:56:16,523 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 00:56:16,523 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 00:56:16,524 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/../../sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:56:16,559 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/data/9692116e3/bf6b0885a47741218e9c3ab7e02874a5/FLAG1de3c55e7 [2018-12-09 00:56:16,846 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 00:56:16,846 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/sv-benchmarks/c/locks/test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:56:16,852 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/data/9692116e3/bf6b0885a47741218e9c3ab7e02874a5/FLAG1de3c55e7 [2018-12-09 00:56:16,861 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/data/9692116e3/bf6b0885a47741218e9c3ab7e02874a5 [2018-12-09 00:56:16,863 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 00:56:16,864 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 00:56:16,865 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 00:56:16,865 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 00:56:16,867 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 00:56:16,868 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:56:16" (1/1) ... [2018-12-09 00:56:16,869 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 09.12 12:56:16, skipping insertion in model container [2018-12-09 00:56:16,869 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 12:56:16" (1/1) ... [2018-12-09 00:56:16,874 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 00:56:16,888 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 00:56:17,000 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:56:17,003 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 00:56:17,024 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 00:56:17,035 INFO L195 MainTranslator]: Completed translation [2018-12-09 00:56:17,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17 WrapperNode [2018-12-09 00:56:17,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 00:56:17,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 00:56:17,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 00:56:17,037 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 00:56:17,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,046 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 00:56:17,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 00:56:17,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 00:56:17,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 00:56:17,087 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,088 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,088 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,095 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,097 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... [2018-12-09 00:56:17,098 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 00:56:17,099 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 00:56:17,099 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 00:56:17,099 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 00:56:17,100 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 00:56:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 00:56:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 00:56:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 00:56:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 00:56:17,131 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 00:56:17,131 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 00:56:17,298 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 00:56:17,298 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 00:56:17,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:17 BoogieIcfgContainer [2018-12-09 00:56:17,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 00:56:17,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 00:56:17,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 00:56:17,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 00:56:17,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 12:56:16" (1/3) ... [2018-12-09 00:56:17,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7614c415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:56:17, skipping insertion in model container [2018-12-09 00:56:17,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 12:56:17" (2/3) ... [2018-12-09 00:56:17,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7614c415 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 12:56:17, skipping insertion in model container [2018-12-09 00:56:17,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:17" (3/3) ... [2018-12-09 00:56:17,303 INFO L112 eAbstractionObserver]: Analyzing ICFG test_locks_15_true-unreach-call_true-valid-memsafety_false-termination.c [2018-12-09 00:56:17,309 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 00:56:17,313 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-09 00:56:17,322 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-09 00:56:17,341 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 00:56:17,341 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 00:56:17,341 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 00:56:17,341 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 00:56:17,341 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 00:56:17,341 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 00:56:17,341 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 00:56:17,341 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 00:56:17,351 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states. [2018-12-09 00:56:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:56:17,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,355 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-09 00:56:17,356 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,359 INFO L82 PathProgramCache]: Analyzing trace with hash -563360106, now seen corresponding path program 1 times [2018-12-09 00:56:17,360 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,387 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,464 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,464 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,467 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,476 INFO L87 Difference]: Start difference. First operand 59 states. Second operand 3 states. [2018-12-09 00:56:17,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,504 INFO L93 Difference]: Finished difference Result 117 states and 210 transitions. [2018-12-09 00:56:17,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:56:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,512 INFO L225 Difference]: With dead ends: 117 [2018-12-09 00:56:17,513 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 00:56:17,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 00:56:17,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 70. [2018-12-09 00:56:17,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-12-09 00:56:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 129 transitions. [2018-12-09 00:56:17,539 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 129 transitions. Word has length 25 [2018-12-09 00:56:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,540 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 129 transitions. [2018-12-09 00:56:17,540 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,540 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 129 transitions. [2018-12-09 00:56:17,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-09 00:56:17,540 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,540 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-09 00:56:17,541 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1737462484, now seen corresponding path program 1 times [2018-12-09 00:56:17,541 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,542 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,573 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,574 INFO L87 Difference]: Start difference. First operand 70 states and 129 transitions. Second operand 3 states. [2018-12-09 00:56:17,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,589 INFO L93 Difference]: Finished difference Result 167 states and 312 transitions. [2018-12-09 00:56:17,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2018-12-09 00:56:17,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,590 INFO L225 Difference]: With dead ends: 167 [2018-12-09 00:56:17,590 INFO L226 Difference]: Without dead ends: 102 [2018-12-09 00:56:17,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-12-09 00:56:17,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2018-12-09 00:56:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-12-09 00:56:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 185 transitions. [2018-12-09 00:56:17,597 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 185 transitions. Word has length 25 [2018-12-09 00:56:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,597 INFO L480 AbstractCegarLoop]: Abstraction has 100 states and 185 transitions. [2018-12-09 00:56:17,597 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,597 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 185 transitions. [2018-12-09 00:56:17,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:56:17,598 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,598 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-09 00:56:17,598 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,598 INFO L82 PathProgramCache]: Analyzing trace with hash -284082342, now seen corresponding path program 1 times [2018-12-09 00:56:17,598 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,599 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,620 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,620 INFO L87 Difference]: Start difference. First operand 100 states and 185 transitions. Second operand 3 states. [2018-12-09 00:56:17,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,631 INFO L93 Difference]: Finished difference Result 153 states and 279 transitions. [2018-12-09 00:56:17,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:56:17,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,632 INFO L225 Difference]: With dead ends: 153 [2018-12-09 00:56:17,632 INFO L226 Difference]: Without dead ends: 105 [2018-12-09 00:56:17,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-12-09 00:56:17,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2018-12-09 00:56:17,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-12-09 00:56:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 187 transitions. [2018-12-09 00:56:17,637 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 187 transitions. Word has length 26 [2018-12-09 00:56:17,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,637 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 187 transitions. [2018-12-09 00:56:17,637 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,638 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 187 transitions. [2018-12-09 00:56:17,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:56:17,638 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,638 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-09 00:56:17,638 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1973026084, now seen corresponding path program 1 times [2018-12-09 00:56:17,638 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,639 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,639 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,639 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,664 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,665 INFO L87 Difference]: Start difference. First operand 103 states and 187 transitions. Second operand 3 states. [2018-12-09 00:56:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,678 INFO L93 Difference]: Finished difference Result 196 states and 360 transitions. [2018-12-09 00:56:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:56:17,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,680 INFO L225 Difference]: With dead ends: 196 [2018-12-09 00:56:17,680 INFO L226 Difference]: Without dead ends: 194 [2018-12-09 00:56:17,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-12-09 00:56:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 136. [2018-12-09 00:56:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-12-09 00:56:17,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 248 transitions. [2018-12-09 00:56:17,689 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 248 transitions. Word has length 26 [2018-12-09 00:56:17,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,689 INFO L480 AbstractCegarLoop]: Abstraction has 136 states and 248 transitions. [2018-12-09 00:56:17,689 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,689 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 248 transitions. [2018-12-09 00:56:17,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-09 00:56:17,690 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,690 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-09 00:56:17,690 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,691 INFO L82 PathProgramCache]: Analyzing trace with hash 327796506, now seen corresponding path program 1 times [2018-12-09 00:56:17,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,692 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,716 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,716 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,717 INFO L87 Difference]: Start difference. First operand 136 states and 248 transitions. Second operand 3 states. [2018-12-09 00:56:17,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,734 INFO L93 Difference]: Finished difference Result 324 states and 598 transitions. [2018-12-09 00:56:17,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-09 00:56:17,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,736 INFO L225 Difference]: With dead ends: 324 [2018-12-09 00:56:17,736 INFO L226 Difference]: Without dead ends: 196 [2018-12-09 00:56:17,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-12-09 00:56:17,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-12-09 00:56:17,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-12-09 00:56:17,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 354 transitions. [2018-12-09 00:56:17,746 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 354 transitions. Word has length 26 [2018-12-09 00:56:17,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,746 INFO L480 AbstractCegarLoop]: Abstraction has 194 states and 354 transitions. [2018-12-09 00:56:17,746 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,746 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 354 transitions. [2018-12-09 00:56:17,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:56:17,747 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,747 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-09 00:56:17,747 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1034054359, now seen corresponding path program 1 times [2018-12-09 00:56:17,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,771 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,771 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,772 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,772 INFO L87 Difference]: Start difference. First operand 194 states and 354 transitions. Second operand 3 states. [2018-12-09 00:56:17,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,786 INFO L93 Difference]: Finished difference Result 291 states and 529 transitions. [2018-12-09 00:56:17,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,787 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:56:17,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,788 INFO L225 Difference]: With dead ends: 291 [2018-12-09 00:56:17,788 INFO L226 Difference]: Without dead ends: 198 [2018-12-09 00:56:17,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-12-09 00:56:17,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 196. [2018-12-09 00:56:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-12-09 00:56:17,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 354 transitions. [2018-12-09 00:56:17,797 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 354 transitions. Word has length 27 [2018-12-09 00:56:17,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,798 INFO L480 AbstractCegarLoop]: Abstraction has 196 states and 354 transitions. [2018-12-09 00:56:17,798 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,798 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 354 transitions. [2018-12-09 00:56:17,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:56:17,799 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,799 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-09 00:56:17,799 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1571969195, now seen corresponding path program 1 times [2018-12-09 00:56:17,799 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,800 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,800 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,801 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,819 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,819 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,820 INFO L87 Difference]: Start difference. First operand 196 states and 354 transitions. Second operand 3 states. [2018-12-09 00:56:17,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,836 INFO L93 Difference]: Finished difference Result 372 states and 680 transitions. [2018-12-09 00:56:17,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:56:17,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,837 INFO L225 Difference]: With dead ends: 372 [2018-12-09 00:56:17,837 INFO L226 Difference]: Without dead ends: 370 [2018-12-09 00:56:17,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-12-09 00:56:17,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 264. [2018-12-09 00:56:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-12-09 00:56:17,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 474 transitions. [2018-12-09 00:56:17,846 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 474 transitions. Word has length 27 [2018-12-09 00:56:17,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,847 INFO L480 AbstractCegarLoop]: Abstraction has 264 states and 474 transitions. [2018-12-09 00:56:17,847 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,847 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 474 transitions. [2018-12-09 00:56:17,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:56:17,848 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,848 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-09 00:56:17,848 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,849 INFO L82 PathProgramCache]: Analyzing trace with hash -422175511, now seen corresponding path program 1 times [2018-12-09 00:56:17,849 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,850 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,850 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,866 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,866 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,866 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,866 INFO L87 Difference]: Start difference. First operand 264 states and 474 transitions. Second operand 3 states. [2018-12-09 00:56:17,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,889 INFO L93 Difference]: Finished difference Result 632 states and 1144 transitions. [2018-12-09 00:56:17,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,890 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2018-12-09 00:56:17,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,891 INFO L225 Difference]: With dead ends: 632 [2018-12-09 00:56:17,891 INFO L226 Difference]: Without dead ends: 378 [2018-12-09 00:56:17,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-12-09 00:56:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 376. [2018-12-09 00:56:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-12-09 00:56:17,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 674 transitions. [2018-12-09 00:56:17,900 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 674 transitions. Word has length 27 [2018-12-09 00:56:17,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,900 INFO L480 AbstractCegarLoop]: Abstraction has 376 states and 674 transitions. [2018-12-09 00:56:17,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 674 transitions. [2018-12-09 00:56:17,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:56:17,901 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,901 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-09 00:56:17,902 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1486617231, now seen corresponding path program 1 times [2018-12-09 00:56:17,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,903 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,918 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,918 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,919 INFO L87 Difference]: Start difference. First operand 376 states and 674 transitions. Second operand 3 states. [2018-12-09 00:56:17,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,930 INFO L93 Difference]: Finished difference Result 564 states and 1008 transitions. [2018-12-09 00:56:17,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:56:17,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,932 INFO L225 Difference]: With dead ends: 564 [2018-12-09 00:56:17,932 INFO L226 Difference]: Without dead ends: 382 [2018-12-09 00:56:17,932 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-12-09 00:56:17,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-12-09 00:56:17,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-12-09 00:56:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 674 transitions. [2018-12-09 00:56:17,941 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 674 transitions. Word has length 28 [2018-12-09 00:56:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,941 INFO L480 AbstractCegarLoop]: Abstraction has 380 states and 674 transitions. [2018-12-09 00:56:17,941 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 674 transitions. [2018-12-09 00:56:17,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:56:17,943 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,943 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-09 00:56:17,943 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,943 INFO L82 PathProgramCache]: Analyzing trace with hash -202326511, now seen corresponding path program 1 times [2018-12-09 00:56:17,943 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,944 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:17,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:17,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:17,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:17,961 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:17,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:17,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:17,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,962 INFO L87 Difference]: Start difference. First operand 380 states and 674 transitions. Second operand 3 states. [2018-12-09 00:56:17,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:17,977 INFO L93 Difference]: Finished difference Result 716 states and 1288 transitions. [2018-12-09 00:56:17,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:17,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:56:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:17,980 INFO L225 Difference]: With dead ends: 716 [2018-12-09 00:56:17,980 INFO L226 Difference]: Without dead ends: 714 [2018-12-09 00:56:17,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2018-12-09 00:56:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 520. [2018-12-09 00:56:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 520 states. [2018-12-09 00:56:17,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 520 states to 520 states and 910 transitions. [2018-12-09 00:56:17,994 INFO L78 Accepts]: Start accepts. Automaton has 520 states and 910 transitions. Word has length 28 [2018-12-09 00:56:17,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:17,994 INFO L480 AbstractCegarLoop]: Abstraction has 520 states and 910 transitions. [2018-12-09 00:56:17,994 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:17,994 INFO L276 IsEmpty]: Start isEmpty. Operand 520 states and 910 transitions. [2018-12-09 00:56:17,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-12-09 00:56:17,995 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:17,995 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-09 00:56:17,995 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:17,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:17,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2098496079, now seen corresponding path program 1 times [2018-12-09 00:56:17,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,996 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:17,996 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:17,996 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,011 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,011 INFO L87 Difference]: Start difference. First operand 520 states and 910 transitions. Second operand 3 states. [2018-12-09 00:56:18,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,032 INFO L93 Difference]: Finished difference Result 1244 states and 2192 transitions. [2018-12-09 00:56:18,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2018-12-09 00:56:18,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,034 INFO L225 Difference]: With dead ends: 1244 [2018-12-09 00:56:18,035 INFO L226 Difference]: Without dead ends: 738 [2018-12-09 00:56:18,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2018-12-09 00:56:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 736. [2018-12-09 00:56:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 736 states. [2018-12-09 00:56:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 736 states to 736 states and 1286 transitions. [2018-12-09 00:56:18,055 INFO L78 Accepts]: Start accepts. Automaton has 736 states and 1286 transitions. Word has length 28 [2018-12-09 00:56:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,055 INFO L480 AbstractCegarLoop]: Abstraction has 736 states and 1286 transitions. [2018-12-09 00:56:18,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 736 states and 1286 transitions. [2018-12-09 00:56:18,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:56:18,057 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,057 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-09 00:56:18,057 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,057 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1976941762, now seen corresponding path program 1 times [2018-12-09 00:56:18,057 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,058 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,078 INFO L87 Difference]: Start difference. First operand 736 states and 1286 transitions. Second operand 3 states. [2018-12-09 00:56:18,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,099 INFO L93 Difference]: Finished difference Result 1104 states and 1924 transitions. [2018-12-09 00:56:18,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:56:18,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,102 INFO L225 Difference]: With dead ends: 1104 [2018-12-09 00:56:18,102 INFO L226 Difference]: Without dead ends: 746 [2018-12-09 00:56:18,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 746 states. [2018-12-09 00:56:18,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 746 to 744. [2018-12-09 00:56:18,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 744 states. [2018-12-09 00:56:18,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 744 states to 744 states and 1286 transitions. [2018-12-09 00:56:18,118 INFO L78 Accepts]: Start accepts. Automaton has 744 states and 1286 transitions. Word has length 29 [2018-12-09 00:56:18,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,118 INFO L480 AbstractCegarLoop]: Abstraction has 744 states and 1286 transitions. [2018-12-09 00:56:18,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,118 INFO L276 IsEmpty]: Start isEmpty. Operand 744 states and 1286 transitions. [2018-12-09 00:56:18,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:56:18,119 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,119 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-09 00:56:18,119 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,120 INFO L82 PathProgramCache]: Analyzing trace with hash 629081792, now seen corresponding path program 1 times [2018-12-09 00:56:18,120 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,121 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,136 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,136 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,136 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,137 INFO L87 Difference]: Start difference. First operand 744 states and 1286 transitions. Second operand 3 states. [2018-12-09 00:56:18,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,161 INFO L93 Difference]: Finished difference Result 1388 states and 2440 transitions. [2018-12-09 00:56:18,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:56:18,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,165 INFO L225 Difference]: With dead ends: 1388 [2018-12-09 00:56:18,165 INFO L226 Difference]: Without dead ends: 1386 [2018-12-09 00:56:18,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1386 states. [2018-12-09 00:56:18,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1386 to 1032. [2018-12-09 00:56:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1032 states. [2018-12-09 00:56:18,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1750 transitions. [2018-12-09 00:56:18,194 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1750 transitions. Word has length 29 [2018-12-09 00:56:18,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,194 INFO L480 AbstractCegarLoop]: Abstraction has 1032 states and 1750 transitions. [2018-12-09 00:56:18,194 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,195 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1750 transitions. [2018-12-09 00:56:18,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 00:56:18,196 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,196 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-09 00:56:18,196 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,197 INFO L82 PathProgramCache]: Analyzing trace with hash -1365062914, now seen corresponding path program 1 times [2018-12-09 00:56:18,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,198 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,212 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,212 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,213 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,213 INFO L87 Difference]: Start difference. First operand 1032 states and 1750 transitions. Second operand 3 states. [2018-12-09 00:56:18,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,241 INFO L93 Difference]: Finished difference Result 2460 states and 4200 transitions. [2018-12-09 00:56:18,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,241 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2018-12-09 00:56:18,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,244 INFO L225 Difference]: With dead ends: 2460 [2018-12-09 00:56:18,244 INFO L226 Difference]: Without dead ends: 1450 [2018-12-09 00:56:18,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2018-12-09 00:56:18,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1448. [2018-12-09 00:56:18,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1448 states. [2018-12-09 00:56:18,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1448 states to 1448 states and 2454 transitions. [2018-12-09 00:56:18,270 INFO L78 Accepts]: Start accepts. Automaton has 1448 states and 2454 transitions. Word has length 29 [2018-12-09 00:56:18,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,271 INFO L480 AbstractCegarLoop]: Abstraction has 1448 states and 2454 transitions. [2018-12-09 00:56:18,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,271 INFO L276 IsEmpty]: Start isEmpty. Operand 1448 states and 2454 transitions. [2018-12-09 00:56:18,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:56:18,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,272 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-09 00:56:18,272 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1973087804, now seen corresponding path program 1 times [2018-12-09 00:56:18,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,288 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,288 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,289 INFO L87 Difference]: Start difference. First operand 1448 states and 2454 transitions. Second operand 3 states. [2018-12-09 00:56:18,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,320 INFO L93 Difference]: Finished difference Result 2172 states and 3672 transitions. [2018-12-09 00:56:18,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 00:56:18,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,324 INFO L225 Difference]: With dead ends: 2172 [2018-12-09 00:56:18,324 INFO L226 Difference]: Without dead ends: 1466 [2018-12-09 00:56:18,326 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1466 states. [2018-12-09 00:56:18,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1466 to 1464. [2018-12-09 00:56:18,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1464 states. [2018-12-09 00:56:18,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1464 states to 1464 states and 2454 transitions. [2018-12-09 00:56:18,369 INFO L78 Accepts]: Start accepts. Automaton has 1464 states and 2454 transitions. Word has length 30 [2018-12-09 00:56:18,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,369 INFO L480 AbstractCegarLoop]: Abstraction has 1464 states and 2454 transitions. [2018-12-09 00:56:18,369 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,369 INFO L276 IsEmpty]: Start isEmpty. Operand 1464 states and 2454 transitions. [2018-12-09 00:56:18,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:56:18,371 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,371 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-09 00:56:18,371 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,371 INFO L82 PathProgramCache]: Analyzing trace with hash 632935750, now seen corresponding path program 1 times [2018-12-09 00:56:18,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,372 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,385 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,385 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,385 INFO L87 Difference]: Start difference. First operand 1464 states and 2454 transitions. Second operand 3 states. [2018-12-09 00:56:18,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,419 INFO L93 Difference]: Finished difference Result 2700 states and 4616 transitions. [2018-12-09 00:56:18,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 00:56:18,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,426 INFO L225 Difference]: With dead ends: 2700 [2018-12-09 00:56:18,426 INFO L226 Difference]: Without dead ends: 2698 [2018-12-09 00:56:18,427 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2018-12-09 00:56:18,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2056. [2018-12-09 00:56:18,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2056 states. [2018-12-09 00:56:18,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 3366 transitions. [2018-12-09 00:56:18,457 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 3366 transitions. Word has length 30 [2018-12-09 00:56:18,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,458 INFO L480 AbstractCegarLoop]: Abstraction has 2056 states and 3366 transitions. [2018-12-09 00:56:18,458 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 3366 transitions. [2018-12-09 00:56:18,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-12-09 00:56:18,459 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,459 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-09 00:56:18,459 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1361208956, now seen corresponding path program 1 times [2018-12-09 00:56:18,459 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,460 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,469 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,469 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,469 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,470 INFO L87 Difference]: Start difference. First operand 2056 states and 3366 transitions. Second operand 3 states. [2018-12-09 00:56:18,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,524 INFO L93 Difference]: Finished difference Result 4876 states and 8040 transitions. [2018-12-09 00:56:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,525 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2018-12-09 00:56:18,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,532 INFO L225 Difference]: With dead ends: 4876 [2018-12-09 00:56:18,532 INFO L226 Difference]: Without dead ends: 2858 [2018-12-09 00:56:18,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-12-09 00:56:18,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2856. [2018-12-09 00:56:18,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2856 states. [2018-12-09 00:56:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 4678 transitions. [2018-12-09 00:56:18,588 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 4678 transitions. Word has length 30 [2018-12-09 00:56:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,588 INFO L480 AbstractCegarLoop]: Abstraction has 2856 states and 4678 transitions. [2018-12-09 00:56:18,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,588 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 4678 transitions. [2018-12-09 00:56:18,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:56:18,589 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,589 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-09 00:56:18,590 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1853614765, now seen corresponding path program 1 times [2018-12-09 00:56:18,590 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,590 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,590 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,599 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,600 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,600 INFO L87 Difference]: Start difference. First operand 2856 states and 4678 transitions. Second operand 3 states. [2018-12-09 00:56:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,640 INFO L93 Difference]: Finished difference Result 4284 states and 7000 transitions. [2018-12-09 00:56:18,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:56:18,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,645 INFO L225 Difference]: With dead ends: 4284 [2018-12-09 00:56:18,645 INFO L226 Difference]: Without dead ends: 2890 [2018-12-09 00:56:18,647 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2890 states. [2018-12-09 00:56:18,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2890 to 2888. [2018-12-09 00:56:18,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2888 states. [2018-12-09 00:56:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2888 states to 2888 states and 4678 transitions. [2018-12-09 00:56:18,690 INFO L78 Accepts]: Start accepts. Automaton has 2888 states and 4678 transitions. Word has length 31 [2018-12-09 00:56:18,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,690 INFO L480 AbstractCegarLoop]: Abstraction has 2888 states and 4678 transitions. [2018-12-09 00:56:18,690 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,690 INFO L276 IsEmpty]: Start isEmpty. Operand 2888 states and 4678 transitions. [2018-12-09 00:56:18,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:56:18,691 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,692 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-09 00:56:18,692 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,692 INFO L82 PathProgramCache]: Analyzing trace with hash 752408789, now seen corresponding path program 1 times [2018-12-09 00:56:18,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,693 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,693 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,707 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,707 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,707 INFO L87 Difference]: Start difference. First operand 2888 states and 4678 transitions. Second operand 3 states. [2018-12-09 00:56:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,776 INFO L93 Difference]: Finished difference Result 5260 states and 8712 transitions. [2018-12-09 00:56:18,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,777 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:56:18,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,789 INFO L225 Difference]: With dead ends: 5260 [2018-12-09 00:56:18,789 INFO L226 Difference]: Without dead ends: 5258 [2018-12-09 00:56:18,791 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5258 states. [2018-12-09 00:56:18,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5258 to 4104. [2018-12-09 00:56:18,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4104 states. [2018-12-09 00:56:18,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4104 states to 4104 states and 6470 transitions. [2018-12-09 00:56:18,848 INFO L78 Accepts]: Start accepts. Automaton has 4104 states and 6470 transitions. Word has length 31 [2018-12-09 00:56:18,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:18,849 INFO L480 AbstractCegarLoop]: Abstraction has 4104 states and 6470 transitions. [2018-12-09 00:56:18,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:18,849 INFO L276 IsEmpty]: Start isEmpty. Operand 4104 states and 6470 transitions. [2018-12-09 00:56:18,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-09 00:56:18,851 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:18,851 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-09 00:56:18,851 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:18,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:18,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1241735917, now seen corresponding path program 1 times [2018-12-09 00:56:18,852 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:18,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:18,852 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:18,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:18,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:18,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:18,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:18,871 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:18,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:18,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:18,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,872 INFO L87 Difference]: Start difference. First operand 4104 states and 6470 transitions. Second operand 3 states. [2018-12-09 00:56:18,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:18,944 INFO L93 Difference]: Finished difference Result 9676 states and 15368 transitions. [2018-12-09 00:56:18,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:18,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2018-12-09 00:56:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:18,957 INFO L225 Difference]: With dead ends: 9676 [2018-12-09 00:56:18,958 INFO L226 Difference]: Without dead ends: 5642 [2018-12-09 00:56:18,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:18,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5642 states. [2018-12-09 00:56:19,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5642 to 5640. [2018-12-09 00:56:19,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5640 states. [2018-12-09 00:56:19,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5640 states to 5640 states and 8902 transitions. [2018-12-09 00:56:19,063 INFO L78 Accepts]: Start accepts. Automaton has 5640 states and 8902 transitions. Word has length 31 [2018-12-09 00:56:19,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:19,063 INFO L480 AbstractCegarLoop]: Abstraction has 5640 states and 8902 transitions. [2018-12-09 00:56:19,063 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:19,063 INFO L276 IsEmpty]: Start isEmpty. Operand 5640 states and 8902 transitions. [2018-12-09 00:56:19,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:56:19,066 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:19,066 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-09 00:56:19,066 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:19,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:19,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1850049785, now seen corresponding path program 1 times [2018-12-09 00:56:19,066 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,067 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:19,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,067 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:19,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:19,077 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:19,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:19,077 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:19,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:19,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:19,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,078 INFO L87 Difference]: Start difference. First operand 5640 states and 8902 transitions. Second operand 3 states. [2018-12-09 00:56:19,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:19,122 INFO L93 Difference]: Finished difference Result 8460 states and 13320 transitions. [2018-12-09 00:56:19,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:19,123 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 00:56:19,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:19,129 INFO L225 Difference]: With dead ends: 8460 [2018-12-09 00:56:19,129 INFO L226 Difference]: Without dead ends: 5706 [2018-12-09 00:56:19,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2018-12-09 00:56:19,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 5704. [2018-12-09 00:56:19,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5704 states. [2018-12-09 00:56:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5704 states to 5704 states and 8902 transitions. [2018-12-09 00:56:19,202 INFO L78 Accepts]: Start accepts. Automaton has 5704 states and 8902 transitions. Word has length 32 [2018-12-09 00:56:19,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:19,203 INFO L480 AbstractCegarLoop]: Abstraction has 5704 states and 8902 transitions. [2018-12-09 00:56:19,203 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:19,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5704 states and 8902 transitions. [2018-12-09 00:56:19,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:56:19,205 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:19,205 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-09 00:56:19,206 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:19,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:19,206 INFO L82 PathProgramCache]: Analyzing trace with hash 161106043, now seen corresponding path program 1 times [2018-12-09 00:56:19,206 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:19,206 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,206 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:19,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:19,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:19,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:19,223 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:19,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:19,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:19,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,224 INFO L87 Difference]: Start difference. First operand 5704 states and 8902 transitions. Second operand 3 states. [2018-12-09 00:56:19,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:19,350 INFO L93 Difference]: Finished difference Result 16716 states and 25928 transitions. [2018-12-09 00:56:19,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:19,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 00:56:19,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:19,365 INFO L225 Difference]: With dead ends: 16716 [2018-12-09 00:56:19,365 INFO L226 Difference]: Without dead ends: 11146 [2018-12-09 00:56:19,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11146 states. [2018-12-09 00:56:19,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11146 to 11144. [2018-12-09 00:56:19,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-09 00:56:19,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 17030 transitions. [2018-12-09 00:56:19,514 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 17030 transitions. Word has length 32 [2018-12-09 00:56:19,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:19,514 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 17030 transitions. [2018-12-09 00:56:19,514 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:19,514 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 17030 transitions. [2018-12-09 00:56:19,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-09 00:56:19,520 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:19,520 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-09 00:56:19,520 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:19,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:19,520 INFO L82 PathProgramCache]: Analyzing trace with hash -2139716547, now seen corresponding path program 1 times [2018-12-09 00:56:19,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,521 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:19,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:19,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:19,530 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:19,530 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:19,530 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:19,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:19,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:19,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,530 INFO L87 Difference]: Start difference. First operand 11144 states and 17030 transitions. Second operand 3 states. [2018-12-09 00:56:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:19,629 INFO L93 Difference]: Finished difference Result 13196 states and 20872 transitions. [2018-12-09 00:56:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:19,630 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2018-12-09 00:56:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:19,643 INFO L225 Difference]: With dead ends: 13196 [2018-12-09 00:56:19,643 INFO L226 Difference]: Without dead ends: 13194 [2018-12-09 00:56:19,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13194 states. [2018-12-09 00:56:19,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13194 to 11144. [2018-12-09 00:56:19,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11144 states. [2018-12-09 00:56:19,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11144 states to 11144 states and 16902 transitions. [2018-12-09 00:56:19,766 INFO L78 Accepts]: Start accepts. Automaton has 11144 states and 16902 transitions. Word has length 32 [2018-12-09 00:56:19,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:19,766 INFO L480 AbstractCegarLoop]: Abstraction has 11144 states and 16902 transitions. [2018-12-09 00:56:19,766 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:19,767 INFO L276 IsEmpty]: Start isEmpty. Operand 11144 states and 16902 transitions. [2018-12-09 00:56:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:56:19,770 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:19,770 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-09 00:56:19,771 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:19,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:19,771 INFO L82 PathProgramCache]: Analyzing trace with hash 699534184, now seen corresponding path program 1 times [2018-12-09 00:56:19,771 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,771 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:19,771 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:19,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:19,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:19,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:19,791 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:19,791 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:19,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:19,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,791 INFO L87 Difference]: Start difference. First operand 11144 states and 16902 transitions. Second operand 3 states. [2018-12-09 00:56:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:19,919 INFO L93 Difference]: Finished difference Result 19852 states and 30856 transitions. [2018-12-09 00:56:19,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:19,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 00:56:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:19,939 INFO L225 Difference]: With dead ends: 19852 [2018-12-09 00:56:19,939 INFO L226 Difference]: Without dead ends: 19850 [2018-12-09 00:56:19,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:19,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19850 states. [2018-12-09 00:56:20,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19850 to 16264. [2018-12-09 00:56:20,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16264 states. [2018-12-09 00:56:20,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16264 states to 16264 states and 23942 transitions. [2018-12-09 00:56:20,122 INFO L78 Accepts]: Start accepts. Automaton has 16264 states and 23942 transitions. Word has length 33 [2018-12-09 00:56:20,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:20,122 INFO L480 AbstractCegarLoop]: Abstraction has 16264 states and 23942 transitions. [2018-12-09 00:56:20,122 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:20,122 INFO L276 IsEmpty]: Start isEmpty. Operand 16264 states and 23942 transitions. [2018-12-09 00:56:20,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-12-09 00:56:20,128 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:20,128 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:56:20,128 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:20,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:20,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1294610522, now seen corresponding path program 1 times [2018-12-09 00:56:20,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:20,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:20,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:20,129 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:20,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:20,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:20,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:20,147 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:20,147 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:20,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:20,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:20,147 INFO L87 Difference]: Start difference. First operand 16264 states and 23942 transitions. Second operand 3 states. [2018-12-09 00:56:20,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:20,286 INFO L93 Difference]: Finished difference Result 38028 states and 56456 transitions. [2018-12-09 00:56:20,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:20,286 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2018-12-09 00:56:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:20,301 INFO L225 Difference]: With dead ends: 38028 [2018-12-09 00:56:20,301 INFO L226 Difference]: Without dead ends: 21898 [2018-12-09 00:56:20,314 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21898 states. [2018-12-09 00:56:20,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21898 to 21896. [2018-12-09 00:56:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21896 states. [2018-12-09 00:56:20,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21896 states to 21896 states and 32262 transitions. [2018-12-09 00:56:20,587 INFO L78 Accepts]: Start accepts. Automaton has 21896 states and 32262 transitions. Word has length 33 [2018-12-09 00:56:20,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:20,588 INFO L480 AbstractCegarLoop]: Abstraction has 21896 states and 32262 transitions. [2018-12-09 00:56:20,588 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:20,588 INFO L276 IsEmpty]: Start isEmpty. Operand 21896 states and 32262 transitions. [2018-12-09 00:56:20,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:56:20,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:20,594 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-09 00:56:20,594 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:20,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:20,595 INFO L82 PathProgramCache]: Analyzing trace with hash 210937712, now seen corresponding path program 1 times [2018-12-09 00:56:20,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:20,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:20,595 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:20,595 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:20,595 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:20,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:20,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:20,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:20,605 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:20,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:20,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:20,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:20,606 INFO L87 Difference]: Start difference. First operand 21896 states and 32262 transitions. Second operand 3 states. [2018-12-09 00:56:20,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:20,740 INFO L93 Difference]: Finished difference Result 33036 states and 48648 transitions. [2018-12-09 00:56:20,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:20,741 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 00:56:20,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:20,755 INFO L225 Difference]: With dead ends: 33036 [2018-12-09 00:56:20,755 INFO L226 Difference]: Without dead ends: 22282 [2018-12-09 00:56:20,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:20,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22282 states. [2018-12-09 00:56:20,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22282 to 22280. [2018-12-09 00:56:20,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22280 states. [2018-12-09 00:56:20,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22280 states to 22280 states and 32518 transitions. [2018-12-09 00:56:20,990 INFO L78 Accepts]: Start accepts. Automaton has 22280 states and 32518 transitions. Word has length 34 [2018-12-09 00:56:20,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:20,990 INFO L480 AbstractCegarLoop]: Abstraction has 22280 states and 32518 transitions. [2018-12-09 00:56:20,990 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:20,990 INFO L276 IsEmpty]: Start isEmpty. Operand 22280 states and 32518 transitions. [2018-12-09 00:56:20,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:56:20,997 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:20,997 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-09 00:56:20,997 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:20,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:20,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1478006030, now seen corresponding path program 1 times [2018-12-09 00:56:20,997 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:20,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:20,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:20,998 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:21,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:21,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:21,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:21,055 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:21,055 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:21,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:21,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:21,055 INFO L87 Difference]: Start difference. First operand 22280 states and 32518 transitions. Second operand 3 states. [2018-12-09 00:56:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:21,270 INFO L93 Difference]: Finished difference Result 38924 states and 58120 transitions. [2018-12-09 00:56:21,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:21,270 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 00:56:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:21,294 INFO L225 Difference]: With dead ends: 38924 [2018-12-09 00:56:21,294 INFO L226 Difference]: Without dead ends: 38922 [2018-12-09 00:56:21,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:21,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38922 states. [2018-12-09 00:56:21,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38922 to 32776. [2018-12-09 00:56:21,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32776 states. [2018-12-09 00:56:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32776 states to 32776 states and 46342 transitions. [2018-12-09 00:56:21,663 INFO L78 Accepts]: Start accepts. Automaton has 32776 states and 46342 transitions. Word has length 34 [2018-12-09 00:56:21,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:21,664 INFO L480 AbstractCegarLoop]: Abstraction has 32776 states and 46342 transitions. [2018-12-09 00:56:21,664 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:21,664 INFO L276 IsEmpty]: Start isEmpty. Operand 32776 states and 46342 transitions. [2018-12-09 00:56:21,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-12-09 00:56:21,679 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:21,679 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-09 00:56:21,679 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:21,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:21,680 INFO L82 PathProgramCache]: Analyzing trace with hash 822816560, now seen corresponding path program 1 times [2018-12-09 00:56:21,680 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:21,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:21,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:21,680 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:21,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:21,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:21,704 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:21,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:21,704 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:21,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:21,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:21,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:21,704 INFO L87 Difference]: Start difference. First operand 32776 states and 46342 transitions. Second operand 3 states. [2018-12-09 00:56:22,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:22,053 INFO L93 Difference]: Finished difference Result 75788 states and 107784 transitions. [2018-12-09 00:56:22,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:22,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2018-12-09 00:56:22,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:22,079 INFO L225 Difference]: With dead ends: 75788 [2018-12-09 00:56:22,079 INFO L226 Difference]: Without dead ends: 43530 [2018-12-09 00:56:22,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:22,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43530 states. [2018-12-09 00:56:22,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43530 to 43528. [2018-12-09 00:56:22,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43528 states. [2018-12-09 00:56:22,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43528 states to 43528 states and 61446 transitions. [2018-12-09 00:56:22,615 INFO L78 Accepts]: Start accepts. Automaton has 43528 states and 61446 transitions. Word has length 34 [2018-12-09 00:56:22,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:22,615 INFO L480 AbstractCegarLoop]: Abstraction has 43528 states and 61446 transitions. [2018-12-09 00:56:22,615 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:22,616 INFO L276 IsEmpty]: Start isEmpty. Operand 43528 states and 61446 transitions. [2018-12-09 00:56:22,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:56:22,627 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:22,627 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-09 00:56:22,627 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:22,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:22,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1426668155, now seen corresponding path program 1 times [2018-12-09 00:56:22,628 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:22,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:22,628 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:22,628 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:22,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:22,647 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:22,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:22,647 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:22,647 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:22,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:22,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:22,647 INFO L87 Difference]: Start difference. First operand 43528 states and 61446 transitions. Second operand 3 states. [2018-12-09 00:56:22,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:22,925 INFO L93 Difference]: Finished difference Result 65292 states and 91912 transitions. [2018-12-09 00:56:22,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:22,926 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 00:56:22,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:22,956 INFO L225 Difference]: With dead ends: 65292 [2018-12-09 00:56:22,956 INFO L226 Difference]: Without dead ends: 44042 [2018-12-09 00:56:22,973 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44042 states. [2018-12-09 00:56:23,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44042 to 44040. [2018-12-09 00:56:23,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44040 states. [2018-12-09 00:56:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44040 states to 44040 states and 61446 transitions. [2018-12-09 00:56:23,437 INFO L78 Accepts]: Start accepts. Automaton has 44040 states and 61446 transitions. Word has length 35 [2018-12-09 00:56:23,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:23,437 INFO L480 AbstractCegarLoop]: Abstraction has 44040 states and 61446 transitions. [2018-12-09 00:56:23,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:23,437 INFO L276 IsEmpty]: Start isEmpty. Operand 44040 states and 61446 transitions. [2018-12-09 00:56:23,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:56:23,449 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:23,449 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-09 00:56:23,449 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:23,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:23,450 INFO L82 PathProgramCache]: Analyzing trace with hash -262275587, now seen corresponding path program 1 times [2018-12-09 00:56:23,450 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:23,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:23,451 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:23,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:23,451 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:23,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:23,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:23,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:23,472 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:23,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:23,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:23,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:23,472 INFO L87 Difference]: Start difference. First operand 44040 states and 61446 transitions. Second operand 3 states. [2018-12-09 00:56:24,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:24,010 INFO L93 Difference]: Finished difference Result 75788 states and 108040 transitions. [2018-12-09 00:56:24,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:24,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 00:56:24,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:24,059 INFO L225 Difference]: With dead ends: 75788 [2018-12-09 00:56:24,059 INFO L226 Difference]: Without dead ends: 75786 [2018-12-09 00:56:24,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:24,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75786 states. [2018-12-09 00:56:24,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75786 to 65544. [2018-12-09 00:56:24,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65544 states. [2018-12-09 00:56:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65544 states to 65544 states and 88582 transitions. [2018-12-09 00:56:24,787 INFO L78 Accepts]: Start accepts. Automaton has 65544 states and 88582 transitions. Word has length 35 [2018-12-09 00:56:24,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:24,788 INFO L480 AbstractCegarLoop]: Abstraction has 65544 states and 88582 transitions. [2018-12-09 00:56:24,788 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:24,788 INFO L276 IsEmpty]: Start isEmpty. Operand 65544 states and 88582 transitions. [2018-12-09 00:56:24,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-09 00:56:24,813 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:24,813 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-09 00:56:24,814 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:24,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:24,814 INFO L82 PathProgramCache]: Analyzing trace with hash 2038547003, now seen corresponding path program 1 times [2018-12-09 00:56:24,814 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:24,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:24,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:24,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:24,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:24,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:24,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:24,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:24,831 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:24,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:24,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:24,832 INFO L87 Difference]: Start difference. First operand 65544 states and 88582 transitions. Second operand 3 states. [2018-12-09 00:56:25,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:25,446 INFO L93 Difference]: Finished difference Result 150540 states and 204296 transitions. [2018-12-09 00:56:25,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:25,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2018-12-09 00:56:25,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:25,506 INFO L225 Difference]: With dead ends: 150540 [2018-12-09 00:56:25,507 INFO L226 Difference]: Without dead ends: 86026 [2018-12-09 00:56:25,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:25,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86026 states. [2018-12-09 00:56:26,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86026 to 86024. [2018-12-09 00:56:26,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86024 states. [2018-12-09 00:56:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86024 states to 86024 states and 115718 transitions. [2018-12-09 00:56:26,627 INFO L78 Accepts]: Start accepts. Automaton has 86024 states and 115718 transitions. Word has length 35 [2018-12-09 00:56:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:26,627 INFO L480 AbstractCegarLoop]: Abstraction has 86024 states and 115718 transitions. [2018-12-09 00:56:26,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:26,627 INFO L276 IsEmpty]: Start isEmpty. Operand 86024 states and 115718 transitions. [2018-12-09 00:56:26,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:56:26,653 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:26,653 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-09 00:56:26,654 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:26,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:26,654 INFO L82 PathProgramCache]: Analyzing trace with hash 459606565, now seen corresponding path program 1 times [2018-12-09 00:56:26,654 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:26,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:26,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:26,655 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:26,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:26,663 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:26,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:26,664 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:26,664 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:26,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:26,664 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:26,664 INFO L87 Difference]: Start difference. First operand 86024 states and 115718 transitions. Second operand 3 states. [2018-12-09 00:56:27,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:27,353 INFO L93 Difference]: Finished difference Result 129036 states and 173064 transitions. [2018-12-09 00:56:27,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:27,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 00:56:27,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:27,410 INFO L225 Difference]: With dead ends: 129036 [2018-12-09 00:56:27,410 INFO L226 Difference]: Without dead ends: 87050 [2018-12-09 00:56:27,433 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:27,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87050 states. [2018-12-09 00:56:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87050 to 87048. [2018-12-09 00:56:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87048 states. [2018-12-09 00:56:28,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87048 states to 87048 states and 115718 transitions. [2018-12-09 00:56:28,465 INFO L78 Accepts]: Start accepts. Automaton has 87048 states and 115718 transitions. Word has length 36 [2018-12-09 00:56:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:28,465 INFO L480 AbstractCegarLoop]: Abstraction has 87048 states and 115718 transitions. [2018-12-09 00:56:28,465 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 87048 states and 115718 transitions. [2018-12-09 00:56:28,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:56:28,492 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:28,492 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-09 00:56:28,492 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:28,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:28,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1229337177, now seen corresponding path program 1 times [2018-12-09 00:56:28,493 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:28,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:28,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:28,493 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:28,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:28,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:28,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:28,507 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:28,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:28,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:28,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:28,507 INFO L87 Difference]: Start difference. First operand 87048 states and 115718 transitions. Second operand 3 states. [2018-12-09 00:56:29,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:29,627 INFO L93 Difference]: Finished difference Result 147468 states and 199688 transitions. [2018-12-09 00:56:29,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:29,628 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 00:56:29,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:29,724 INFO L225 Difference]: With dead ends: 147468 [2018-12-09 00:56:29,724 INFO L226 Difference]: Without dead ends: 147466 [2018-12-09 00:56:29,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:29,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147466 states. [2018-12-09 00:56:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147466 to 131080. [2018-12-09 00:56:31,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131080 states. [2018-12-09 00:56:31,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131080 states to 131080 states and 168966 transitions. [2018-12-09 00:56:31,288 INFO L78 Accepts]: Start accepts. Automaton has 131080 states and 168966 transitions. Word has length 36 [2018-12-09 00:56:31,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:31,288 INFO L480 AbstractCegarLoop]: Abstraction has 131080 states and 168966 transitions. [2018-12-09 00:56:31,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:31,288 INFO L276 IsEmpty]: Start isEmpty. Operand 131080 states and 168966 transitions. [2018-12-09 00:56:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-12-09 00:56:31,337 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:31,337 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-09 00:56:31,337 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:31,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:31,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1071485413, now seen corresponding path program 1 times [2018-12-09 00:56:31,337 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:31,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:31,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:31,338 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:31,359 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:31,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:31,359 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:31,359 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:31,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:31,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:31,360 INFO L87 Difference]: Start difference. First operand 131080 states and 168966 transitions. Second operand 3 states. [2018-12-09 00:56:32,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:32,694 INFO L93 Difference]: Finished difference Result 299020 states and 386056 transitions. [2018-12-09 00:56:32,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:32,695 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2018-12-09 00:56:32,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:32,828 INFO L225 Difference]: With dead ends: 299020 [2018-12-09 00:56:32,828 INFO L226 Difference]: Without dead ends: 169994 [2018-12-09 00:56:32,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:32,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169994 states. [2018-12-09 00:56:35,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169994 to 169992. [2018-12-09 00:56:35,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169992 states. [2018-12-09 00:56:36,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169992 states to 169992 states and 217094 transitions. [2018-12-09 00:56:36,057 INFO L78 Accepts]: Start accepts. Automaton has 169992 states and 217094 transitions. Word has length 36 [2018-12-09 00:56:36,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:36,058 INFO L480 AbstractCegarLoop]: Abstraction has 169992 states and 217094 transitions. [2018-12-09 00:56:36,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:36,058 INFO L276 IsEmpty]: Start isEmpty. Operand 169992 states and 217094 transitions. [2018-12-09 00:56:36,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:56:36,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:36,115 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-09 00:56:36,115 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:36,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash 545468688, now seen corresponding path program 1 times [2018-12-09 00:56:36,115 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:36,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:36,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:36,116 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:36,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:36,127 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:36,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:36,127 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:36,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:36,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:36,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:36,127 INFO L87 Difference]: Start difference. First operand 169992 states and 217094 transitions. Second operand 3 states. [2018-12-09 00:56:37,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:37,600 INFO L93 Difference]: Finished difference Result 254988 states and 324616 transitions. [2018-12-09 00:56:37,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:37,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 00:56:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:37,716 INFO L225 Difference]: With dead ends: 254988 [2018-12-09 00:56:37,716 INFO L226 Difference]: Without dead ends: 172042 [2018-12-09 00:56:37,746 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:37,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172042 states. [2018-12-09 00:56:39,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172042 to 172040. [2018-12-09 00:56:39,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172040 states. [2018-12-09 00:56:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172040 states to 172040 states and 217094 transitions. [2018-12-09 00:56:39,707 INFO L78 Accepts]: Start accepts. Automaton has 172040 states and 217094 transitions. Word has length 37 [2018-12-09 00:56:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:39,708 INFO L480 AbstractCegarLoop]: Abstraction has 172040 states and 217094 transitions. [2018-12-09 00:56:39,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 172040 states and 217094 transitions. [2018-12-09 00:56:39,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:56:39,765 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:39,765 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-09 00:56:39,765 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:39,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:39,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1143475054, now seen corresponding path program 1 times [2018-12-09 00:56:39,766 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:39,766 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:39,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:39,766 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:39,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:39,786 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:39,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:39,786 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:39,786 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:39,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:39,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:39,786 INFO L87 Difference]: Start difference. First operand 172040 states and 217094 transitions. Second operand 3 states. [2018-12-09 00:56:42,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:42,154 INFO L93 Difference]: Finished difference Result 286732 states and 366600 transitions. [2018-12-09 00:56:42,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:42,155 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 00:56:42,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:42,373 INFO L225 Difference]: With dead ends: 286732 [2018-12-09 00:56:42,373 INFO L226 Difference]: Without dead ends: 286730 [2018-12-09 00:56:42,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:42,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286730 states. [2018-12-09 00:56:45,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286730 to 262152. [2018-12-09 00:56:45,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262152 states. [2018-12-09 00:56:45,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262152 states to 262152 states and 321542 transitions. [2018-12-09 00:56:45,246 INFO L78 Accepts]: Start accepts. Automaton has 262152 states and 321542 transitions. Word has length 37 [2018-12-09 00:56:45,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:45,246 INFO L480 AbstractCegarLoop]: Abstraction has 262152 states and 321542 transitions. [2018-12-09 00:56:45,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:45,246 INFO L276 IsEmpty]: Start isEmpty. Operand 262152 states and 321542 transitions. [2018-12-09 00:56:45,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-09 00:56:45,359 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:45,359 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-09 00:56:45,359 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:45,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:45,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1157347536, now seen corresponding path program 1 times [2018-12-09 00:56:45,359 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:45,360 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:45,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:45,360 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:45,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:45,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:45,371 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:45,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:45,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:45,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:45,371 INFO L87 Difference]: Start difference. First operand 262152 states and 321542 transitions. Second operand 3 states. [2018-12-09 00:56:49,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:49,607 INFO L93 Difference]: Finished difference Result 593932 states and 727048 transitions. [2018-12-09 00:56:49,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:49,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2018-12-09 00:56:49,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:49,854 INFO L225 Difference]: With dead ends: 593932 [2018-12-09 00:56:49,854 INFO L226 Difference]: Without dead ends: 335882 [2018-12-09 00:56:49,968 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:50,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335882 states. [2018-12-09 00:56:53,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335882 to 335880. [2018-12-09 00:56:53,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335880 states. [2018-12-09 00:56:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335880 states to 335880 states and 405510 transitions. [2018-12-09 00:56:54,239 INFO L78 Accepts]: Start accepts. Automaton has 335880 states and 405510 transitions. Word has length 37 [2018-12-09 00:56:54,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:56:54,239 INFO L480 AbstractCegarLoop]: Abstraction has 335880 states and 405510 transitions. [2018-12-09 00:56:54,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:56:54,239 INFO L276 IsEmpty]: Start isEmpty. Operand 335880 states and 405510 transitions. [2018-12-09 00:56:54,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 00:56:54,354 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:56:54,354 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:56:54,354 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:56:54,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:56:54,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1087772454, now seen corresponding path program 1 times [2018-12-09 00:56:54,354 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:56:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:54,355 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:56:54,355 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:56:54,355 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:56:54,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:56:54,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:56:54,373 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:56:54,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:56:54,373 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:56:54,373 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:56:54,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:56:54,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:54,373 INFO L87 Difference]: Start difference. First operand 335880 states and 405510 transitions. Second operand 3 states. [2018-12-09 00:56:57,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:56:57,393 INFO L93 Difference]: Finished difference Result 503820 states and 606216 transitions. [2018-12-09 00:56:57,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:56:57,394 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-09 00:56:57,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:56:57,661 INFO L225 Difference]: With dead ends: 503820 [2018-12-09 00:56:57,662 INFO L226 Difference]: Without dead ends: 339978 [2018-12-09 00:56:57,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:56:57,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339978 states. [2018-12-09 00:57:01,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339978 to 339976. [2018-12-09 00:57:01,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339976 states. [2018-12-09 00:57:02,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339976 states to 339976 states and 405510 transitions. [2018-12-09 00:57:02,109 INFO L78 Accepts]: Start accepts. Automaton has 339976 states and 405510 transitions. Word has length 38 [2018-12-09 00:57:02,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:57:02,109 INFO L480 AbstractCegarLoop]: Abstraction has 339976 states and 405510 transitions. [2018-12-09 00:57:02,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:57:02,109 INFO L276 IsEmpty]: Start isEmpty. Operand 339976 states and 405510 transitions. [2018-12-09 00:57:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 00:57:02,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:57:02,228 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:02,229 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:57:02,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:02,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1518251100, now seen corresponding path program 1 times [2018-12-09 00:57:02,229 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:57:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:02,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:02,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:02,229 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:57:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:02,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:02,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:02,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:57:02,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:57:02,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:57:02,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:57:02,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:02,246 INFO L87 Difference]: Start difference. First operand 339976 states and 405510 transitions. Second operand 3 states. [2018-12-09 00:57:08,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:08,415 INFO L93 Difference]: Finished difference Result 557068 states and 667656 transitions. [2018-12-09 00:57:08,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:57:08,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-09 00:57:08,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:57:08,911 INFO L225 Difference]: With dead ends: 557068 [2018-12-09 00:57:08,912 INFO L226 Difference]: Without dead ends: 557066 [2018-12-09 00:57:08,969 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557066 states. [2018-12-09 00:57:14,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557066 to 524296. [2018-12-09 00:57:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524296 states. [2018-12-09 00:57:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524296 states to 524296 states and 610310 transitions. [2018-12-09 00:57:15,060 INFO L78 Accepts]: Start accepts. Automaton has 524296 states and 610310 transitions. Word has length 38 [2018-12-09 00:57:15,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:57:15,060 INFO L480 AbstractCegarLoop]: Abstraction has 524296 states and 610310 transitions. [2018-12-09 00:57:15,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:57:15,060 INFO L276 IsEmpty]: Start isEmpty. Operand 524296 states and 610310 transitions. [2018-12-09 00:57:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-12-09 00:57:15,316 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:57:15,316 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:15,316 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:57:15,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:15,317 INFO L82 PathProgramCache]: Analyzing trace with hash -475893606, now seen corresponding path program 1 times [2018-12-09 00:57:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:57:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:15,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:15,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:15,317 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:57:15,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:15,327 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:15,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:57:15,327 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:57:15,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:57:15,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:57:15,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:15,327 INFO L87 Difference]: Start difference. First operand 524296 states and 610310 transitions. Second operand 3 states. [2018-12-09 00:57:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:21,886 INFO L93 Difference]: Finished difference Result 1179660 states and 1363976 transitions. [2018-12-09 00:57:21,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:57:21,886 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2018-12-09 00:57:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:57:22,431 INFO L225 Difference]: With dead ends: 1179660 [2018-12-09 00:57:22,431 INFO L226 Difference]: Without dead ends: 663562 [2018-12-09 00:57:22,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:22,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663562 states. [2018-12-09 00:57:33,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663562 to 663560. [2018-12-09 00:57:33,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663560 states. [2018-12-09 00:57:34,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663560 states to 663560 states and 753670 transitions. [2018-12-09 00:57:34,572 INFO L78 Accepts]: Start accepts. Automaton has 663560 states and 753670 transitions. Word has length 38 [2018-12-09 00:57:34,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:57:34,572 INFO L480 AbstractCegarLoop]: Abstraction has 663560 states and 753670 transitions. [2018-12-09 00:57:34,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:57:34,572 INFO L276 IsEmpty]: Start isEmpty. Operand 663560 states and 753670 transitions. [2018-12-09 00:57:34,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:57:34,826 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:57:34,826 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:34,826 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:57:34,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:34,826 INFO L82 PathProgramCache]: Analyzing trace with hash -178639963, now seen corresponding path program 1 times [2018-12-09 00:57:34,826 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:57:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:34,827 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:34,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:34,827 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:57:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:34,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:34,838 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:34,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:57:34,838 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:57:34,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:57:34,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:57:34,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:34,839 INFO L87 Difference]: Start difference. First operand 663560 states and 753670 transitions. Second operand 3 states. [2018-12-09 00:57:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:57:41,257 INFO L93 Difference]: Finished difference Result 995340 states and 1126408 transitions. [2018-12-09 00:57:41,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:57:41,258 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 00:57:41,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:57:41,906 INFO L225 Difference]: With dead ends: 995340 [2018-12-09 00:57:41,906 INFO L226 Difference]: Without dead ends: 671754 [2018-12-09 00:57:42,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:42,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671754 states. [2018-12-09 00:57:53,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671754 to 671752. [2018-12-09 00:57:53,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671752 states. [2018-12-09 00:57:54,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671752 states to 671752 states and 753670 transitions. [2018-12-09 00:57:54,531 INFO L78 Accepts]: Start accepts. Automaton has 671752 states and 753670 transitions. Word has length 39 [2018-12-09 00:57:54,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:57:54,531 INFO L480 AbstractCegarLoop]: Abstraction has 671752 states and 753670 transitions. [2018-12-09 00:57:54,531 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:57:54,531 INFO L276 IsEmpty]: Start isEmpty. Operand 671752 states and 753670 transitions. [2018-12-09 00:57:54,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:57:54,790 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:57:54,791 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:57:54,791 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:57:54,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:57:54,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1867583705, now seen corresponding path program 1 times [2018-12-09 00:57:54,791 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:57:54,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:54,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:57:54,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:57:54,792 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:57:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:57:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:57:54,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:57:54,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:57:54,800 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:57:54,800 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:57:54,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:57:54,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:57:54,801 INFO L87 Difference]: Start difference. First operand 671752 states and 753670 transitions. Second operand 3 states. [2018-12-09 00:58:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:58:05,730 INFO L93 Difference]: Finished difference Result 1081354 states and 1204231 transitions. [2018-12-09 00:58:05,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:58:05,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 00:58:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:58:06,727 INFO L225 Difference]: With dead ends: 1081354 [2018-12-09 00:58:06,727 INFO L226 Difference]: Without dead ends: 1081352 [2018-12-09 00:58:06,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:58:07,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081352 states. [2018-12-09 00:58:22,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081352 to 1048584. [2018-12-09 00:58:22,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048584 states. [2018-12-09 00:58:23,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048584 states to 1048584 states and 1155078 transitions. [2018-12-09 00:58:23,720 INFO L78 Accepts]: Start accepts. Automaton has 1048584 states and 1155078 transitions. Word has length 39 [2018-12-09 00:58:23,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:58:23,720 INFO L480 AbstractCegarLoop]: Abstraction has 1048584 states and 1155078 transitions. [2018-12-09 00:58:23,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:58:23,720 INFO L276 IsEmpty]: Start isEmpty. Operand 1048584 states and 1155078 transitions. [2018-12-09 00:58:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-09 00:58:24,554 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:58:24,554 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:58:24,555 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:58:24,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:58:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash 433238885, now seen corresponding path program 1 times [2018-12-09 00:58:24,555 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:58:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:24,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:58:24,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:58:24,555 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:58:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:58:24,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:58:24,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 00:58:24,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 00:58:24,563 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:58:24,564 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 00:58:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 00:58:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:58:24,564 INFO L87 Difference]: Start difference. First operand 1048584 states and 1155078 transitions. Second operand 3 states. [2018-12-09 00:58:38,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:58:38,051 INFO L93 Difference]: Finished difference Result 2342920 states and 2547718 transitions. [2018-12-09 00:58:38,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 00:58:38,052 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2018-12-09 00:58:38,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:58:38,052 INFO L225 Difference]: With dead ends: 2342920 [2018-12-09 00:58:38,052 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:58:38,600 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 00:58:38,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:58:38,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:58:38,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:58:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:58:38,601 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2018-12-09 00:58:38,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:58:38,601 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:58:38,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 00:58:38,601 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:58:38,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:58:38,604 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:58:38,656 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 00:58:38,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:58:38,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:58:38,656 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:58:38,656 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:58:38,656 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L119-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L103-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L139-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,657 INFO L448 ceAbstractionStarter]: For program point L107-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L451 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 93) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L91-2(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L444 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L143-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L127-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L95-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2018-12-09 00:58:38,658 INFO L451 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2018-12-09 00:58:38,658 INFO L448 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L131-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L115-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-12-09 00:58:38,659 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2018-12-09 00:58:38,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:58:38 BoogieIcfgContainer [2018-12-09 00:58:38,663 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:58:38,664 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:58:38,664 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:58:38,664 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:58:38,664 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 12:56:17" (3/4) ... [2018-12-09 00:58:38,666 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:58:38,671 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:58:38,671 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:58:38,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2018-12-09 00:58:38,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:58:38,675 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 00:58:38,719 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_139a3a10-faa1-477c-b635-71c99256932f/bin-2019/utaipan/witness.graphml [2018-12-09 00:58:38,719 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:58:38,720 INFO L168 Benchmark]: Toolchain (without parser) took 141856.97 ms. Allocated memory was 1.0 GB in the beginning and 9.1 GB in the end (delta: 8.1 GB). Free memory was 952.4 MB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 5.5 GB. Max. memory is 11.5 GB. [2018-12-09 00:58:38,721 INFO L168 Benchmark]: CDTParser took 0.11 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-09 00:58:38,721 INFO L168 Benchmark]: CACSL2BoogieTranslator took 171.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 940.6 MB in the end (delta: 11.8 MB). Peak memory consumption was 11.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:38,722 INFO L168 Benchmark]: Boogie Procedure Inliner took 14.45 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:38,722 INFO L168 Benchmark]: Boogie Preprocessor took 47.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:38,722 INFO L168 Benchmark]: RCFGBuilder took 200.19 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:58:38,722 INFO L168 Benchmark]: TraceAbstraction took 141363.96 ms. Allocated memory was 1.2 GB in the beginning and 9.1 GB in the end (delta: 8.0 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. [2018-12-09 00:58:38,723 INFO L168 Benchmark]: Witness Printer took 56.01 ms. Allocated memory is still 9.1 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-12-09 00:58:38,724 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.11 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 171.65 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 940.6 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 14.45 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.2 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 935.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.19 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: 25.1 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 141363.96 ms. Allocated memory was 1.2 GB in the beginning and 9.1 GB in the end (delta: 8.0 GB). Free memory was 1.1 GB in the beginning and 3.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 5.6 GB. Max. memory is 11.5 GB. * Witness Printer took 56.01 ms. Allocated memory is still 9.1 GB. Free memory was 3.5 GB in the beginning and 3.5 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: 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: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 59 locations, 1 error locations. SAFE Result, 141.3s OverallTime, 43 OverallIterations, 1 TraceHistogramMax, 66.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 5309 SDtfs, 2663 SDslu, 3669 SDs, 0 SdLazy, 229 SolverSat, 43 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1048584occurred in iteration=42, 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: 71.1s AutomataMinimizationTime, 43 MinimizatonAttempts, 131120 StatesRemovedByMinimization, 42 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 32778 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.5s InterpolantComputationTime, 1382 NumberOfCodeBlocks, 1382 NumberOfCodeBlocksAsserted, 43 NumberOfCheckSat, 1339 ConstructedInterpolants, 0 QuantifiedInterpolants, 89720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 43 InterpolantComputations, 43 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...