java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 19:44:39,362 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 19:44:39,365 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 19:44:39,386 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 19:44:39,386 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 19:44:39,388 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 19:44:39,390 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 19:44:39,400 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 19:44:39,404 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 19:44:39,406 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 19:44:39,409 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 19:44:39,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 19:44:39,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 19:44:39,414 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 19:44:39,416 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 19:44:39,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 19:44:39,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 19:44:39,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 19:44:39,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 19:44:39,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 19:44:39,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 19:44:39,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 19:44:39,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 19:44:39,431 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 19:44:39,432 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 19:44:39,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 19:44:39,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 19:44:39,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 19:44:39,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 19:44:39,435 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 19:44:39,435 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 19:44:39,436 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 19:44:39,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 19:44:39,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 19:44:39,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 19:44:39,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 19:44:39,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 19:44:39,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 19:44:39,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 19:44:39,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 19:44:39,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 19:44:39,445 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 19:44:39,471 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 19:44:39,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 19:44:39,472 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 19:44:39,472 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 19:44:39,472 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 19:44:39,473 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 19:44:39,473 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 19:44:39,474 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 19:44:39,474 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 19:44:39,474 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 19:44:39,474 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 19:44:39,474 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 19:44:39,475 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 19:44:39,475 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 19:44:39,475 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 19:44:39,475 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 19:44:39,475 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 19:44:39,476 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 19:44:39,476 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 19:44:39,476 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 19:44:39,477 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 19:44:39,477 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 19:44:39,478 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 19:44:39,478 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 19:44:39,478 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 19:44:39,478 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 19:44:39,478 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 19:44:39,478 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 19:44:39,478 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-13 19:44:39,743 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 19:44:39,766 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 19:44:39,769 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 19:44:39,771 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 19:44:39,771 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 19:44:39,772 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:44:39,845 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8a10501/5c3ff35b23ac4608be7e62c32de00265/FLAGf600270d9 [2019-10-13 19:44:40,430 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 19:44:40,431 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:44:40,448 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8a10501/5c3ff35b23ac4608be7e62c32de00265/FLAGf600270d9 [2019-10-13 19:44:40,710 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8a10501/5c3ff35b23ac4608be7e62c32de00265 [2019-10-13 19:44:40,718 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 19:44:40,720 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 19:44:40,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:40,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 19:44:40,725 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 19:44:40,726 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:40" (1/1) ... [2019-10-13 19:44:40,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3890461f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:40, skipping insertion in model container [2019-10-13 19:44:40,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 07:44:40" (1/1) ... [2019-10-13 19:44:40,736 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 19:44:40,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 19:44:41,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:41,273 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 19:44:41,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 19:44:41,419 INFO L192 MainTranslator]: Completed translation [2019-10-13 19:44:41,420 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41 WrapperNode [2019-10-13 19:44:41,420 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 19:44:41,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 19:44:41,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 19:44:41,421 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 19:44:41,436 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,449 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,450 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,471 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,487 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,492 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... [2019-10-13 19:44:41,499 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 19:44:41,499 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 19:44:41,500 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 19:44:41,500 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 19:44:41,501 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 [2019-10-13 19:44:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 19:44:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 19:44:41,576 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 19:44:41,576 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 19:44:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 19:44:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 19:44:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 19:44:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 19:44:41,577 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 19:44:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 19:44:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 19:44:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 19:44:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 19:44:41,578 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 19:44:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 19:44:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 19:44:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 19:44:41,579 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 19:44:42,823 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 19:44:42,823 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 19:44:42,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:42 BoogieIcfgContainer [2019-10-13 19:44:42,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 19:44:42,826 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 19:44:42,826 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 19:44:42,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 19:44:42,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 07:44:40" (1/3) ... [2019-10-13 19:44:42,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddf5397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:42, skipping insertion in model container [2019-10-13 19:44:42,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 07:44:41" (2/3) ... [2019-10-13 19:44:42,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddf5397 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 07:44:42, skipping insertion in model container [2019-10-13 19:44:42,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 07:44:42" (3/3) ... [2019-10-13 19:44:42,833 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-10-13 19:44:42,848 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 19:44:42,863 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 19:44:42,875 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 19:44:42,904 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 19:44:42,905 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 19:44:42,905 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 19:44:42,905 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 19:44:42,905 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 19:44:42,906 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 19:44:42,906 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 19:44:42,906 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 19:44:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states. [2019-10-13 19:44:42,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 19:44:42,955 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:42,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:42,957 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:42,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:42,962 INFO L82 PathProgramCache]: Analyzing trace with hash 343036633, now seen corresponding path program 1 times [2019-10-13 19:44:42,969 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:42,969 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990744308] [2019-10-13 19:44:42,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:42,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:42,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:43,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:43,915 WARN L191 SmtUtils]: Spent 251.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:43,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:43,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:43,989 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990744308] [2019-10-13 19:44:43,991 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:43,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:43,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388193915] [2019-10-13 19:44:44,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:44,001 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:44,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:44,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:44,019 INFO L87 Difference]: Start difference. First operand 223 states. Second operand 5 states. [2019-10-13 19:44:46,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:46,038 INFO L93 Difference]: Finished difference Result 636 states and 1118 transitions. [2019-10-13 19:44:46,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 19:44:46,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-10-13 19:44:46,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:46,057 INFO L225 Difference]: With dead ends: 636 [2019-10-13 19:44:46,057 INFO L226 Difference]: Without dead ends: 418 [2019-10-13 19:44:46,062 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:46,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-10-13 19:44:46,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 416. [2019-10-13 19:44:46,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2019-10-13 19:44:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 609 transitions. [2019-10-13 19:44:46,143 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 609 transitions. Word has length 98 [2019-10-13 19:44:46,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:46,144 INFO L462 AbstractCegarLoop]: Abstraction has 416 states and 609 transitions. [2019-10-13 19:44:46,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:46,144 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 609 transitions. [2019-10-13 19:44:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 19:44:46,149 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:46,149 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:46,150 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:46,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:46,150 INFO L82 PathProgramCache]: Analyzing trace with hash -936762471, now seen corresponding path program 1 times [2019-10-13 19:44:46,151 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:46,151 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728973883] [2019-10-13 19:44:46,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:46,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:46,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:46,481 WARN L191 SmtUtils]: Spent 212.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:46,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:46,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728973883] [2019-10-13 19:44:46,506 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:46,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:46,507 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085037089] [2019-10-13 19:44:46,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:46,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:46,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:46,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:46,510 INFO L87 Difference]: Start difference. First operand 416 states and 609 transitions. Second operand 4 states. [2019-10-13 19:44:48,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:48,188 INFO L93 Difference]: Finished difference Result 1202 states and 1757 transitions. [2019-10-13 19:44:48,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:48,189 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 99 [2019-10-13 19:44:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:48,195 INFO L225 Difference]: With dead ends: 1202 [2019-10-13 19:44:48,195 INFO L226 Difference]: Without dead ends: 818 [2019-10-13 19:44:48,199 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:48,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2019-10-13 19:44:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 418. [2019-10-13 19:44:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2019-10-13 19:44:48,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 611 transitions. [2019-10-13 19:44:48,262 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 611 transitions. Word has length 99 [2019-10-13 19:44:48,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:48,263 INFO L462 AbstractCegarLoop]: Abstraction has 418 states and 611 transitions. [2019-10-13 19:44:48,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:48,263 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 611 transitions. [2019-10-13 19:44:48,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:44:48,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:48,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:48,268 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:48,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:48,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1773874167, now seen corresponding path program 1 times [2019-10-13 19:44:48,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:48,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443703104] [2019-10-13 19:44:48,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:48,270 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:48,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:48,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:48,628 WARN L191 SmtUtils]: Spent 210.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:48,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:48,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:48,671 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443703104] [2019-10-13 19:44:48,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:48,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:48,673 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984620346] [2019-10-13 19:44:48,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:48,679 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:48,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:48,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:48,681 INFO L87 Difference]: Start difference. First operand 418 states and 611 transitions. Second operand 4 states. [2019-10-13 19:44:50,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:50,249 INFO L93 Difference]: Finished difference Result 1038 states and 1538 transitions. [2019-10-13 19:44:50,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:50,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 100 [2019-10-13 19:44:50,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:50,257 INFO L225 Difference]: With dead ends: 1038 [2019-10-13 19:44:50,257 INFO L226 Difference]: Without dead ends: 802 [2019-10-13 19:44:50,259 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:50,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 802 states. [2019-10-13 19:44:50,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 802 to 800. [2019-10-13 19:44:50,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 800 states. [2019-10-13 19:44:50,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1163 transitions. [2019-10-13 19:44:50,333 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1163 transitions. Word has length 100 [2019-10-13 19:44:50,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:50,336 INFO L462 AbstractCegarLoop]: Abstraction has 800 states and 1163 transitions. [2019-10-13 19:44:50,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:50,336 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1163 transitions. [2019-10-13 19:44:50,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-13 19:44:50,350 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:50,351 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:50,351 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:50,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:50,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1816624602, now seen corresponding path program 1 times [2019-10-13 19:44:50,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:50,353 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948851379] [2019-10-13 19:44:50,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:50,353 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:50,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:50,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:50,770 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:50,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:50,797 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948851379] [2019-10-13 19:44:50,798 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:50,798 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:50,798 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32175611] [2019-10-13 19:44:50,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:50,799 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:50,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:50,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:50,800 INFO L87 Difference]: Start difference. First operand 800 states and 1163 transitions. Second operand 5 states. [2019-10-13 19:44:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:51,670 INFO L93 Difference]: Finished difference Result 1239 states and 1819 transitions. [2019-10-13 19:44:51,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:51,671 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-10-13 19:44:51,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:51,676 INFO L225 Difference]: With dead ends: 1239 [2019-10-13 19:44:51,676 INFO L226 Difference]: Without dead ends: 611 [2019-10-13 19:44:51,679 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:51,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-10-13 19:44:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 611. [2019-10-13 19:44:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-10-13 19:44:51,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 883 transitions. [2019-10-13 19:44:51,716 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 883 transitions. Word has length 100 [2019-10-13 19:44:51,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:51,716 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 883 transitions. [2019-10-13 19:44:51,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:51,717 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 883 transitions. [2019-10-13 19:44:51,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-13 19:44:51,721 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:51,721 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:51,721 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:51,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:51,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1713248280, now seen corresponding path program 1 times [2019-10-13 19:44:51,722 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:51,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12372813] [2019-10-13 19:44:51,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:51,723 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:51,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:52,153 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:52,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:52,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:52,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12372813] [2019-10-13 19:44:52,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:52,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:52,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507258207] [2019-10-13 19:44:52,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:52,183 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:52,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:52,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:52,183 INFO L87 Difference]: Start difference. First operand 611 states and 883 transitions. Second operand 5 states. [2019-10-13 19:44:53,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:53,719 INFO L93 Difference]: Finished difference Result 1485 states and 2148 transitions. [2019-10-13 19:44:53,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:53,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 102 [2019-10-13 19:44:53,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:53,727 INFO L225 Difference]: With dead ends: 1485 [2019-10-13 19:44:53,727 INFO L226 Difference]: Without dead ends: 897 [2019-10-13 19:44:53,730 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:53,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2019-10-13 19:44:53,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 895. [2019-10-13 19:44:53,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2019-10-13 19:44:53,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 1282 transitions. [2019-10-13 19:44:53,792 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 1282 transitions. Word has length 102 [2019-10-13 19:44:53,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:53,795 INFO L462 AbstractCegarLoop]: Abstraction has 895 states and 1282 transitions. [2019-10-13 19:44:53,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 1282 transitions. [2019-10-13 19:44:53,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:44:53,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:53,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:53,800 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:53,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:53,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1610605002, now seen corresponding path program 1 times [2019-10-13 19:44:53,802 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:53,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860404804] [2019-10-13 19:44:53,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,803 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:53,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:53,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:54,158 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:54,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:54,188 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860404804] [2019-10-13 19:44:54,189 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:54,189 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:54,189 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717971938] [2019-10-13 19:44:54,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:54,190 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:54,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:54,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:54,191 INFO L87 Difference]: Start difference. First operand 895 states and 1282 transitions. Second operand 4 states. [2019-10-13 19:44:55,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:55,768 INFO L93 Difference]: Finished difference Result 2174 states and 3182 transitions. [2019-10-13 19:44:55,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:44:55,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2019-10-13 19:44:55,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:55,784 INFO L225 Difference]: With dead ends: 2174 [2019-10-13 19:44:55,785 INFO L226 Difference]: Without dead ends: 1607 [2019-10-13 19:44:55,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:55,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2019-10-13 19:44:55,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1605. [2019-10-13 19:44:55,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1605 states. [2019-10-13 19:44:55,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1605 states to 1605 states and 2301 transitions. [2019-10-13 19:44:55,867 INFO L78 Accepts]: Start accepts. Automaton has 1605 states and 2301 transitions. Word has length 104 [2019-10-13 19:44:55,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:55,868 INFO L462 AbstractCegarLoop]: Abstraction has 1605 states and 2301 transitions. [2019-10-13 19:44:55,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 1605 states and 2301 transitions. [2019-10-13 19:44:55,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-13 19:44:55,871 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:55,871 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:55,871 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:55,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:55,872 INFO L82 PathProgramCache]: Analyzing trace with hash -817857369, now seen corresponding path program 1 times [2019-10-13 19:44:55,872 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:55,872 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148677477] [2019-10-13 19:44:55,872 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:55,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:55,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:56,259 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:56,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:56,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:56,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148677477] [2019-10-13 19:44:56,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:56,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:56,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778397488] [2019-10-13 19:44:56,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:56,290 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:56,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:56,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:56,291 INFO L87 Difference]: Start difference. First operand 1605 states and 2301 transitions. Second operand 5 states. [2019-10-13 19:44:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:57,251 INFO L93 Difference]: Finished difference Result 2391 states and 3456 transitions. [2019-10-13 19:44:57,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:57,252 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 104 [2019-10-13 19:44:57,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:57,258 INFO L225 Difference]: With dead ends: 2391 [2019-10-13 19:44:57,259 INFO L226 Difference]: Without dead ends: 1319 [2019-10-13 19:44:57,262 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:44:57,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1319 states. [2019-10-13 19:44:57,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1319 to 1319. [2019-10-13 19:44:57,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1319 states. [2019-10-13 19:44:57,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1319 states to 1319 states and 1881 transitions. [2019-10-13 19:44:57,325 INFO L78 Accepts]: Start accepts. Automaton has 1319 states and 1881 transitions. Word has length 104 [2019-10-13 19:44:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:57,325 INFO L462 AbstractCegarLoop]: Abstraction has 1319 states and 1881 transitions. [2019-10-13 19:44:57,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:44:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1319 states and 1881 transitions. [2019-10-13 19:44:57,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:44:57,328 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:57,328 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:57,329 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:57,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:57,329 INFO L82 PathProgramCache]: Analyzing trace with hash 669169858, now seen corresponding path program 1 times [2019-10-13 19:44:57,329 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:57,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889054703] [2019-10-13 19:44:57,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:57,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,569 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:57,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:57,589 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889054703] [2019-10-13 19:44:57,590 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:57,590 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:44:57,590 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254560653] [2019-10-13 19:44:57,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:44:57,591 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:57,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:44:57,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:44:57,591 INFO L87 Difference]: Start difference. First operand 1319 states and 1881 transitions. Second operand 4 states. [2019-10-13 19:44:57,814 WARN L191 SmtUtils]: Spent 193.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 19:44:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:44:58,865 INFO L93 Difference]: Finished difference Result 3197 states and 4694 transitions. [2019-10-13 19:44:58,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:44:58,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-10-13 19:44:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:44:58,877 INFO L225 Difference]: With dead ends: 3197 [2019-10-13 19:44:58,877 INFO L226 Difference]: Without dead ends: 2376 [2019-10-13 19:44:58,880 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:58,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-10-13 19:44:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 2374. [2019-10-13 19:44:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2019-10-13 19:44:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 3419 transitions. [2019-10-13 19:44:58,985 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 3419 transitions. Word has length 106 [2019-10-13 19:44:58,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:44:58,987 INFO L462 AbstractCegarLoop]: Abstraction has 2374 states and 3419 transitions. [2019-10-13 19:44:58,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:44:58,987 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 3419 transitions. [2019-10-13 19:44:58,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-13 19:44:58,991 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:44:58,991 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:44:58,991 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:44:58,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:44:58,992 INFO L82 PathProgramCache]: Analyzing trace with hash -53512537, now seen corresponding path program 1 times [2019-10-13 19:44:58,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:44:58,992 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495035100] [2019-10-13 19:44:58,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:58,992 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:44:58,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:44:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,322 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:44:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:44:59,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:44:59,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495035100] [2019-10-13 19:44:59,388 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:44:59,388 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:44:59,388 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752085561] [2019-10-13 19:44:59,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:44:59,389 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:44:59,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:44:59,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:44:59,390 INFO L87 Difference]: Start difference. First operand 2374 states and 3419 transitions. Second operand 5 states. [2019-10-13 19:45:00,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:00,834 INFO L93 Difference]: Finished difference Result 6864 states and 9875 transitions. [2019-10-13 19:45:00,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:00,835 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-13 19:45:00,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:00,855 INFO L225 Difference]: With dead ends: 6864 [2019-10-13 19:45:00,856 INFO L226 Difference]: Without dead ends: 4533 [2019-10-13 19:45:00,862 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:00,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-10-13 19:45:01,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4531. [2019-10-13 19:45:01,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-10-13 19:45:01,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6454 transitions. [2019-10-13 19:45:01,164 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6454 transitions. Word has length 106 [2019-10-13 19:45:01,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:01,165 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6454 transitions. [2019-10-13 19:45:01,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:01,165 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6454 transitions. [2019-10-13 19:45:01,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-13 19:45:01,173 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:01,173 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:01,173 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:01,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:01,174 INFO L82 PathProgramCache]: Analyzing trace with hash 2125527721, now seen corresponding path program 1 times [2019-10-13 19:45:01,174 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:01,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632248476] [2019-10-13 19:45:01,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:01,179 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:01,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,431 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:01,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:01,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:01,455 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632248476] [2019-10-13 19:45:01,456 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:01,456 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:01,456 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347904020] [2019-10-13 19:45:01,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:01,457 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:01,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:01,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:01,458 INFO L87 Difference]: Start difference. First operand 4531 states and 6454 transitions. Second operand 4 states. [2019-10-13 19:45:02,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:02,662 INFO L93 Difference]: Finished difference Result 13393 states and 19105 transitions. [2019-10-13 19:45:02,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:02,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-13 19:45:02,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:02,690 INFO L225 Difference]: With dead ends: 13393 [2019-10-13 19:45:02,690 INFO L226 Difference]: Without dead ends: 8971 [2019-10-13 19:45:02,700 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:02,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8971 states. [2019-10-13 19:45:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8971 to 4537. [2019-10-13 19:45:02,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4537 states. [2019-10-13 19:45:02,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4537 states to 4537 states and 6460 transitions. [2019-10-13 19:45:02,965 INFO L78 Accepts]: Start accepts. Automaton has 4537 states and 6460 transitions. Word has length 107 [2019-10-13 19:45:02,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:02,965 INFO L462 AbstractCegarLoop]: Abstraction has 4537 states and 6460 transitions. [2019-10-13 19:45:02,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:02,965 INFO L276 IsEmpty]: Start isEmpty. Operand 4537 states and 6460 transitions. [2019-10-13 19:45:02,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:45:02,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:02,972 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:02,972 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:02,973 INFO L82 PathProgramCache]: Analyzing trace with hash -871367960, now seen corresponding path program 1 times [2019-10-13 19:45:02,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:02,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745467826] [2019-10-13 19:45:02,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:02,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:02,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,283 WARN L191 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:03,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:03,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:03,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745467826] [2019-10-13 19:45:03,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:03,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:03,307 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683818776] [2019-10-13 19:45:03,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:03,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:03,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:03,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:03,308 INFO L87 Difference]: Start difference. First operand 4537 states and 6460 transitions. Second operand 5 states. [2019-10-13 19:45:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:04,330 INFO L93 Difference]: Finished difference Result 9032 states and 12864 transitions. [2019-10-13 19:45:04,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:04,331 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-10-13 19:45:04,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:04,349 INFO L225 Difference]: With dead ends: 9032 [2019-10-13 19:45:04,349 INFO L226 Difference]: Without dead ends: 4531 [2019-10-13 19:45:04,357 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2019-10-13 19:45:04,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4531. [2019-10-13 19:45:04,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4531 states. [2019-10-13 19:45:04,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4531 states to 4531 states and 6448 transitions. [2019-10-13 19:45:04,553 INFO L78 Accepts]: Start accepts. Automaton has 4531 states and 6448 transitions. Word has length 108 [2019-10-13 19:45:04,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:04,553 INFO L462 AbstractCegarLoop]: Abstraction has 4531 states and 6448 transitions. [2019-10-13 19:45:04,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:04,554 INFO L276 IsEmpty]: Start isEmpty. Operand 4531 states and 6448 transitions. [2019-10-13 19:45:04,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-13 19:45:04,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:04,560 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:04,560 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:04,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:04,561 INFO L82 PathProgramCache]: Analyzing trace with hash -1746692037, now seen corresponding path program 1 times [2019-10-13 19:45:04,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:04,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761841741] [2019-10-13 19:45:04,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:04,562 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:04,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:04,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:04,826 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:04,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:04,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761841741] [2019-10-13 19:45:04,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:04,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:04,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121509547] [2019-10-13 19:45:04,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:04,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:04,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:04,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:04,895 INFO L87 Difference]: Start difference. First operand 4531 states and 6448 transitions. Second operand 4 states. [2019-10-13 19:45:06,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:06,662 INFO L93 Difference]: Finished difference Result 10307 states and 14773 transitions. [2019-10-13 19:45:06,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 19:45:06,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-10-13 19:45:06,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:06,679 INFO L225 Difference]: With dead ends: 10307 [2019-10-13 19:45:06,679 INFO L226 Difference]: Without dead ends: 6717 [2019-10-13 19:45:06,689 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6717 states. [2019-10-13 19:45:07,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6717 to 6715. [2019-10-13 19:45:07,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6715 states. [2019-10-13 19:45:07,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6715 states to 6715 states and 9383 transitions. [2019-10-13 19:45:07,019 INFO L78 Accepts]: Start accepts. Automaton has 6715 states and 9383 transitions. Word has length 108 [2019-10-13 19:45:07,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:07,020 INFO L462 AbstractCegarLoop]: Abstraction has 6715 states and 9383 transitions. [2019-10-13 19:45:07,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:07,020 INFO L276 IsEmpty]: Start isEmpty. Operand 6715 states and 9383 transitions. [2019-10-13 19:45:07,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-13 19:45:07,027 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:07,028 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:07,028 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:07,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:07,028 INFO L82 PathProgramCache]: Analyzing trace with hash -848505304, now seen corresponding path program 1 times [2019-10-13 19:45:07,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:07,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238003730] [2019-10-13 19:45:07,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:07,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:07,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:07,309 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:07,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:07,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238003730] [2019-10-13 19:45:07,338 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:07,338 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:07,338 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212291498] [2019-10-13 19:45:07,339 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:07,339 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:07,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:07,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:07,340 INFO L87 Difference]: Start difference. First operand 6715 states and 9383 transitions. Second operand 5 states. [2019-10-13 19:45:08,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:08,459 INFO L93 Difference]: Finished difference Result 12456 states and 17427 transitions. [2019-10-13 19:45:08,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:08,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-10-13 19:45:08,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:08,472 INFO L225 Difference]: With dead ends: 12456 [2019-10-13 19:45:08,472 INFO L226 Difference]: Without dead ends: 6092 [2019-10-13 19:45:08,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:08,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6092 states. [2019-10-13 19:45:08,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6092 to 6023. [2019-10-13 19:45:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6023 states. [2019-10-13 19:45:08,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6023 states to 6023 states and 8366 transitions. [2019-10-13 19:45:08,764 INFO L78 Accepts]: Start accepts. Automaton has 6023 states and 8366 transitions. Word has length 110 [2019-10-13 19:45:08,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:08,765 INFO L462 AbstractCegarLoop]: Abstraction has 6023 states and 8366 transitions. [2019-10-13 19:45:08,765 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:08,765 INFO L276 IsEmpty]: Start isEmpty. Operand 6023 states and 8366 transitions. [2019-10-13 19:45:08,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:45:08,771 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:08,772 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:08,772 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:08,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:08,772 INFO L82 PathProgramCache]: Analyzing trace with hash 1621946400, now seen corresponding path program 1 times [2019-10-13 19:45:08,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:08,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539843379] [2019-10-13 19:45:08,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:08,773 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:08,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:08,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:08,989 WARN L191 SmtUtils]: Spent 162.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:08,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:09,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:09,011 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539843379] [2019-10-13 19:45:09,011 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:09,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:09,012 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842450855] [2019-10-13 19:45:09,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:09,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:09,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:09,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:09,013 INFO L87 Difference]: Start difference. First operand 6023 states and 8366 transitions. Second operand 4 states. [2019-10-13 19:45:09,257 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification that was a NOOP. DAG size: 168 [2019-10-13 19:45:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:10,810 INFO L93 Difference]: Finished difference Result 14841 states and 21156 transitions. [2019-10-13 19:45:10,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:10,811 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-13 19:45:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:10,835 INFO L225 Difference]: With dead ends: 14841 [2019-10-13 19:45:10,836 INFO L226 Difference]: Without dead ends: 10994 [2019-10-13 19:45:10,849 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10994 states. [2019-10-13 19:45:11,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10994 to 10992. [2019-10-13 19:45:11,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10992 states. [2019-10-13 19:45:11,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10992 states to 10992 states and 15347 transitions. [2019-10-13 19:45:11,421 INFO L78 Accepts]: Start accepts. Automaton has 10992 states and 15347 transitions. Word has length 112 [2019-10-13 19:45:11,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:11,422 INFO L462 AbstractCegarLoop]: Abstraction has 10992 states and 15347 transitions. [2019-10-13 19:45:11,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 19:45:11,422 INFO L276 IsEmpty]: Start isEmpty. Operand 10992 states and 15347 transitions. [2019-10-13 19:45:11,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-13 19:45:11,432 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:11,432 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:11,432 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:11,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:11,433 INFO L82 PathProgramCache]: Analyzing trace with hash 900773541, now seen corresponding path program 1 times [2019-10-13 19:45:11,433 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:11,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375749151] [2019-10-13 19:45:11,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:11,438 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:11,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:11,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,738 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:11,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:11,768 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375749151] [2019-10-13 19:45:11,769 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:11,769 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 19:45:11,769 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418627995] [2019-10-13 19:45:11,769 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 19:45:11,770 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:11,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 19:45:11,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 19:45:11,770 INFO L87 Difference]: Start difference. First operand 10992 states and 15347 transitions. Second operand 5 states. [2019-10-13 19:45:13,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 19:45:13,434 INFO L93 Difference]: Finished difference Result 22202 states and 30971 transitions. [2019-10-13 19:45:13,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 19:45:13,435 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-10-13 19:45:13,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 19:45:13,457 INFO L225 Difference]: With dead ends: 22202 [2019-10-13 19:45:13,458 INFO L226 Difference]: Without dead ends: 11365 [2019-10-13 19:45:13,472 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-13 19:45:13,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11365 states. [2019-10-13 19:45:14,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11365 to 11179. [2019-10-13 19:45:14,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11179 states. [2019-10-13 19:45:14,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11179 states to 11179 states and 15555 transitions. [2019-10-13 19:45:14,117 INFO L78 Accepts]: Start accepts. Automaton has 11179 states and 15555 transitions. Word has length 112 [2019-10-13 19:45:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 19:45:14,117 INFO L462 AbstractCegarLoop]: Abstraction has 11179 states and 15555 transitions. [2019-10-13 19:45:14,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 19:45:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 11179 states and 15555 transitions. [2019-10-13 19:45:14,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-13 19:45:14,125 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 19:45:14,125 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 19:45:14,125 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 19:45:14,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 19:45:14,126 INFO L82 PathProgramCache]: Analyzing trace with hash 288500069, now seen corresponding path program 1 times [2019-10-13 19:45:14,126 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-13 19:45:14,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783774570] [2019-10-13 19:45:14,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:14,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 19:45:14,127 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 19:45:14,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:14,351 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification that was a NOOP. DAG size: 166 [2019-10-13 19:45:14,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 19:45:14,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 19:45:14,371 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783774570] [2019-10-13 19:45:14,373 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 19:45:14,373 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 19:45:14,374 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8698896] [2019-10-13 19:45:14,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 19:45:14,374 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-13 19:45:14,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 19:45:14,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 19:45:14,375 INFO L87 Difference]: Start difference. First operand 11179 states and 15555 transitions. Second operand 4 states.