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_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 11:15:48,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 11:15:48,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 11:15:48,686 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 11:15:48,687 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 11:15:48,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 11:15:48,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 11:15:48,704 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 11:15:48,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 11:15:48,708 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 11:15:48,711 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 11:15:48,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 11:15:48,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 11:15:48,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 11:15:48,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 11:15:48,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 11:15:48,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 11:15:48,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 11:15:48,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 11:15:48,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 11:15:48,732 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 11:15:48,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 11:15:48,738 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 11:15:48,739 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 11:15:48,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 11:15:48,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 11:15:48,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 11:15:48,742 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 11:15:48,742 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 11:15:48,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 11:15:48,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 11:15:48,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 11:15:48,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 11:15:48,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 11:15:48,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 11:15:48,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 11:15:48,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 11:15:48,749 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 11:15:48,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 11:15:48,750 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 11:15:48,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 11:15:48,752 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-09-08 11:15:48,765 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 11:15:48,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 11:15:48,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 11:15:48,767 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 11:15:48,767 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 11:15:48,767 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 11:15:48,767 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 11:15:48,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 11:15:48,768 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 11:15:48,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 11:15:48,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 11:15:48,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 11:15:48,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 11:15:48,769 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 11:15:48,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 11:15:48,769 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 11:15:48,769 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 11:15:48,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 11:15:48,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 11:15:48,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 11:15:48,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 11:15:48,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 11:15:48,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 11:15:48,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 11:15:48,771 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 11:15:48,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 11:15:48,771 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 11:15:48,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 11:15:48,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 11:15:48,799 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 11:15:48,814 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 11:15:48,817 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 11:15:48,819 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 11:15:48,819 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 11:15:48,820 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:15:48,879 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe37e2a3/e3102e0dad5f4118b5f7b3f9388dc4d4/FLAG1f843c6a2 [2019-09-08 11:15:49,361 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 11:15:49,365 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:15:49,377 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe37e2a3/e3102e0dad5f4118b5f7b3f9388dc4d4/FLAG1f843c6a2 [2019-09-08 11:15:49,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fe37e2a3/e3102e0dad5f4118b5f7b3f9388dc4d4 [2019-09-08 11:15:49,726 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 11:15:49,728 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 11:15:49,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 11:15:49,729 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 11:15:49,732 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 11:15:49,733 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:15:49" (1/1) ... [2019-09-08 11:15:49,736 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c490221 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:49, skipping insertion in model container [2019-09-08 11:15:49,736 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 11:15:49" (1/1) ... [2019-09-08 11:15:49,743 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 11:15:49,806 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 11:15:50,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:15:50,261 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 11:15:50,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 11:15:50,413 INFO L192 MainTranslator]: Completed translation [2019-09-08 11:15:50,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50 WrapperNode [2019-09-08 11:15:50,414 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 11:15:50,415 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 11:15:50,415 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 11:15:50,415 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 11:15:50,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,438 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,438 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,454 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,466 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,469 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (1/1) ... [2019-09-08 11:15:50,474 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 11:15:50,475 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 11:15:50,475 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 11:15:50,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 11:15:50,476 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (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-09-08 11:15:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 11:15:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 11:15:50,538 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 11:15:50,538 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 11:15:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 11:15:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 11:15:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 11:15:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 11:15:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 11:15:50,539 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 11:15:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 11:15:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 11:15:50,540 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 11:15:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 11:15:50,541 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 11:15:50,542 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 11:15:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 11:15:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 11:15:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 11:15:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 11:15:50,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 11:15:51,412 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 11:15:51,413 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 11:15:51,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:15:51 BoogieIcfgContainer [2019-09-08 11:15:51,415 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 11:15:51,416 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 11:15:51,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 11:15:51,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 11:15:51,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 11:15:49" (1/3) ... [2019-09-08 11:15:51,421 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bda6814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:15:51, skipping insertion in model container [2019-09-08 11:15:51,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 11:15:50" (2/3) ... [2019-09-08 11:15:51,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bda6814 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 11:15:51, skipping insertion in model container [2019-09-08 11:15:51,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 11:15:51" (3/3) ... [2019-09-08 11:15:51,424 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.1.ufo.BOUNDED-12.pals.c.v+cfa-reducer.c [2019-09-08 11:15:51,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 11:15:51,444 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 11:15:51,462 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 11:15:51,497 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 11:15:51,498 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 11:15:51,498 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 11:15:51,498 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 11:15:51,499 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 11:15:51,499 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 11:15:51,499 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 11:15:51,499 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 11:15:51,500 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 11:15:51,523 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states. [2019-09-08 11:15:51,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-09-08 11:15:51,537 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:51,538 INFO L399 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] [2019-09-08 11:15:51,541 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:51,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:51,547 INFO L82 PathProgramCache]: Analyzing trace with hash -474732239, now seen corresponding path program 1 times [2019-09-08 11:15:51,549 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:51,549 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:51,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:51,606 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:51,606 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:52,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:52,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:52,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:52,050 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:52,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:52,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:52,067 INFO L87 Difference]: Start difference. First operand 168 states. Second operand 3 states. [2019-09-08 11:15:52,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:52,192 INFO L93 Difference]: Finished difference Result 392 states and 634 transitions. [2019-09-08 11:15:52,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:52,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-09-08 11:15:52,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:52,223 INFO L225 Difference]: With dead ends: 392 [2019-09-08 11:15:52,223 INFO L226 Difference]: Without dead ends: 264 [2019-09-08 11:15:52,232 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:52,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-09-08 11:15:52,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-09-08 11:15:52,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-09-08 11:15:52,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 390 transitions. [2019-09-08 11:15:52,304 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 390 transitions. Word has length 77 [2019-09-08 11:15:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:52,305 INFO L475 AbstractCegarLoop]: Abstraction has 262 states and 390 transitions. [2019-09-08 11:15:52,305 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:52,305 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 390 transitions. [2019-09-08 11:15:52,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-08 11:15:52,309 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:52,309 INFO L399 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] [2019-09-08 11:15:52,310 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:52,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:52,310 INFO L82 PathProgramCache]: Analyzing trace with hash -992316925, now seen corresponding path program 1 times [2019-09-08 11:15:52,310 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:52,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:52,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:52,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:52,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:52,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:52,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:52,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:52,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:52,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:52,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:52,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:52,495 INFO L87 Difference]: Start difference. First operand 262 states and 390 transitions. Second operand 3 states. [2019-09-08 11:15:52,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:52,590 INFO L93 Difference]: Finished difference Result 658 states and 1022 transitions. [2019-09-08 11:15:52,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:52,590 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-08 11:15:52,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:52,595 INFO L225 Difference]: With dead ends: 658 [2019-09-08 11:15:52,595 INFO L226 Difference]: Without dead ends: 444 [2019-09-08 11:15:52,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:52,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-09-08 11:15:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 442. [2019-09-08 11:15:52,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2019-09-08 11:15:52,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 677 transitions. [2019-09-08 11:15:52,638 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 677 transitions. Word has length 78 [2019-09-08 11:15:52,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:52,639 INFO L475 AbstractCegarLoop]: Abstraction has 442 states and 677 transitions. [2019-09-08 11:15:52,639 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:52,639 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 677 transitions. [2019-09-08 11:15:52,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-08 11:15:52,642 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:52,642 INFO L399 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] [2019-09-08 11:15:52,643 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:52,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:52,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1011193650, now seen corresponding path program 1 times [2019-09-08 11:15:52,643 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:52,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:52,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:52,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:52,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:52,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:52,790 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:52,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:52,791 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:52,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:52,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:52,792 INFO L87 Difference]: Start difference. First operand 442 states and 677 transitions. Second operand 3 states. [2019-09-08 11:15:52,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:52,845 INFO L93 Difference]: Finished difference Result 1166 states and 1831 transitions. [2019-09-08 11:15:52,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:52,845 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-08 11:15:52,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:52,851 INFO L225 Difference]: With dead ends: 1166 [2019-09-08 11:15:52,851 INFO L226 Difference]: Without dead ends: 772 [2019-09-08 11:15:52,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:52,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2019-09-08 11:15:52,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 770. [2019-09-08 11:15:52,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770 states. [2019-09-08 11:15:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 770 states and 1197 transitions. [2019-09-08 11:15:52,899 INFO L78 Accepts]: Start accepts. Automaton has 770 states and 1197 transitions. Word has length 79 [2019-09-08 11:15:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:52,899 INFO L475 AbstractCegarLoop]: Abstraction has 770 states and 1197 transitions. [2019-09-08 11:15:52,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1197 transitions. [2019-09-08 11:15:52,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-08 11:15:52,903 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:52,903 INFO L399 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] [2019-09-08 11:15:52,903 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:52,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:52,904 INFO L82 PathProgramCache]: Analyzing trace with hash 373615374, now seen corresponding path program 1 times [2019-09-08 11:15:52,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:52,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:52,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:52,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:53,017 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:53,017 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:53,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:53,019 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:53,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:53,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:53,020 INFO L87 Difference]: Start difference. First operand 770 states and 1197 transitions. Second operand 3 states. [2019-09-08 11:15:53,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:53,092 INFO L93 Difference]: Finished difference Result 2086 states and 3287 transitions. [2019-09-08 11:15:53,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:53,093 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-08 11:15:53,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:53,101 INFO L225 Difference]: With dead ends: 2086 [2019-09-08 11:15:53,102 INFO L226 Difference]: Without dead ends: 1364 [2019-09-08 11:15:53,104 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:53,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1364 states. [2019-09-08 11:15:53,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1364 to 1362. [2019-09-08 11:15:53,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1362 states. [2019-09-08 11:15:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1362 states to 1362 states and 2129 transitions. [2019-09-08 11:15:53,166 INFO L78 Accepts]: Start accepts. Automaton has 1362 states and 2129 transitions. Word has length 80 [2019-09-08 11:15:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:53,167 INFO L475 AbstractCegarLoop]: Abstraction has 1362 states and 2129 transitions. [2019-09-08 11:15:53,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:53,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1362 states and 2129 transitions. [2019-09-08 11:15:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-08 11:15:53,169 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:53,169 INFO L399 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] [2019-09-08 11:15:53,169 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:53,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:53,170 INFO L82 PathProgramCache]: Analyzing trace with hash 779333447, now seen corresponding path program 1 times [2019-09-08 11:15:53,170 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:53,170 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:53,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:53,172 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:53,172 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:53,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:53,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:53,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:53,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:53,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:53,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:53,273 INFO L87 Difference]: Start difference. First operand 1362 states and 2129 transitions. Second operand 3 states. [2019-09-08 11:15:53,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:53,434 INFO L93 Difference]: Finished difference Result 3734 states and 5875 transitions. [2019-09-08 11:15:53,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:53,434 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-08 11:15:53,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:53,454 INFO L225 Difference]: With dead ends: 3734 [2019-09-08 11:15:53,455 INFO L226 Difference]: Without dead ends: 2420 [2019-09-08 11:15:53,459 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:53,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2019-09-08 11:15:53,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2019-09-08 11:15:53,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2418 states. [2019-09-08 11:15:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3777 transitions. [2019-09-08 11:15:53,596 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3777 transitions. Word has length 81 [2019-09-08 11:15:53,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:53,598 INFO L475 AbstractCegarLoop]: Abstraction has 2418 states and 3777 transitions. [2019-09-08 11:15:53,598 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:53,598 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3777 transitions. [2019-09-08 11:15:53,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-08 11:15:53,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:53,600 INFO L399 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] [2019-09-08 11:15:53,600 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:53,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:53,601 INFO L82 PathProgramCache]: Analyzing trace with hash -148987347, now seen corresponding path program 1 times [2019-09-08 11:15:53,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:53,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:53,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:53,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:53,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:53,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:53,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:53,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:15:53,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:15:53,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:15:53,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:53,726 INFO L87 Difference]: Start difference. First operand 2418 states and 3777 transitions. Second operand 3 states. [2019-09-08 11:15:53,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:53,921 INFO L93 Difference]: Finished difference Result 6646 states and 10403 transitions. [2019-09-08 11:15:53,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:15:53,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-08 11:15:53,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:53,946 INFO L225 Difference]: With dead ends: 6646 [2019-09-08 11:15:53,947 INFO L226 Difference]: Without dead ends: 4276 [2019-09-08 11:15:53,955 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:15:53,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4276 states. [2019-09-08 11:15:54,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4276 to 4274. [2019-09-08 11:15:54,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4274 states. [2019-09-08 11:15:54,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4274 states to 4274 states and 6641 transitions. [2019-09-08 11:15:54,157 INFO L78 Accepts]: Start accepts. Automaton has 4274 states and 6641 transitions. Word has length 82 [2019-09-08 11:15:54,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:54,157 INFO L475 AbstractCegarLoop]: Abstraction has 4274 states and 6641 transitions. [2019-09-08 11:15:54,157 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:15:54,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4274 states and 6641 transitions. [2019-09-08 11:15:54,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-08 11:15:54,158 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:54,159 INFO L399 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] [2019-09-08 11:15:54,159 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:54,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:54,165 INFO L82 PathProgramCache]: Analyzing trace with hash 328210800, now seen corresponding path program 1 times [2019-09-08 11:15:54,165 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:54,166 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:54,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:54,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:54,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:54,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:54,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:54,482 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:15:54,482 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:15:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:15:54,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:15:54,483 INFO L87 Difference]: Start difference. First operand 4274 states and 6641 transitions. Second operand 8 states. [2019-09-08 11:15:55,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:15:55,813 INFO L93 Difference]: Finished difference Result 25790 states and 39863 transitions. [2019-09-08 11:15:55,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:15:55,814 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-08 11:15:55,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:15:55,930 INFO L225 Difference]: With dead ends: 25790 [2019-09-08 11:15:55,931 INFO L226 Difference]: Without dead ends: 21564 [2019-09-08 11:15:55,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:15:55,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21564 states. [2019-09-08 11:15:57,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21564 to 21554. [2019-09-08 11:15:57,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21554 states. [2019-09-08 11:15:57,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21554 states to 21554 states and 33201 transitions. [2019-09-08 11:15:57,437 INFO L78 Accepts]: Start accepts. Automaton has 21554 states and 33201 transitions. Word has length 83 [2019-09-08 11:15:57,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:15:57,438 INFO L475 AbstractCegarLoop]: Abstraction has 21554 states and 33201 transitions. [2019-09-08 11:15:57,438 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:15:57,438 INFO L276 IsEmpty]: Start isEmpty. Operand 21554 states and 33201 transitions. [2019-09-08 11:15:57,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:15:57,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:15:57,440 INFO L399 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] [2019-09-08 11:15:57,440 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:15:57,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:15:57,441 INFO L82 PathProgramCache]: Analyzing trace with hash -513165031, now seen corresponding path program 1 times [2019-09-08 11:15:57,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:15:57,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:15:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:57,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:15:57,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:15:57,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:15:57,552 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:15:57,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:15:57,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:15:57,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:15:57,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:15:57,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:15:57,555 INFO L87 Difference]: Start difference. First operand 21554 states and 33201 transitions. Second operand 5 states. [2019-09-08 11:16:00,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:00,124 INFO L93 Difference]: Finished difference Result 64566 states and 99507 transitions. [2019-09-08 11:16:00,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 11:16:00,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-08 11:16:00,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:00,230 INFO L225 Difference]: With dead ends: 64566 [2019-09-08 11:16:00,231 INFO L226 Difference]: Without dead ends: 43060 [2019-09-08 11:16:00,275 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 11:16:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43060 states. [2019-09-08 11:16:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43060 to 43058. [2019-09-08 11:16:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43058 states. [2019-09-08 11:16:02,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43058 states to 43058 states and 66001 transitions. [2019-09-08 11:16:02,177 INFO L78 Accepts]: Start accepts. Automaton has 43058 states and 66001 transitions. Word has length 85 [2019-09-08 11:16:02,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:02,178 INFO L475 AbstractCegarLoop]: Abstraction has 43058 states and 66001 transitions. [2019-09-08 11:16:02,178 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:16:02,178 INFO L276 IsEmpty]: Start isEmpty. Operand 43058 states and 66001 transitions. [2019-09-08 11:16:02,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-08 11:16:02,179 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:02,179 INFO L399 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] [2019-09-08 11:16:02,180 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:02,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:02,180 INFO L82 PathProgramCache]: Analyzing trace with hash -670112898, now seen corresponding path program 1 times [2019-09-08 11:16:02,180 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:02,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:02,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:02,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:02,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:02,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:02,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:02,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:16:02,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:16:02,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:16:02,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:16:02,376 INFO L87 Difference]: Start difference. First operand 43058 states and 66001 transitions. Second operand 8 states. [2019-09-08 11:16:10,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:10,500 INFO L93 Difference]: Finished difference Result 243328 states and 373592 transitions. [2019-09-08 11:16:10,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 11:16:10,501 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-08 11:16:10,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:10,919 INFO L225 Difference]: With dead ends: 243328 [2019-09-08 11:16:10,919 INFO L226 Difference]: Without dead ends: 200318 [2019-09-08 11:16:11,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:16:11,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200318 states. [2019-09-08 11:16:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200318 to 86066. [2019-09-08 11:16:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86066 states. [2019-09-08 11:16:17,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86066 states to 86066 states and 130417 transitions. [2019-09-08 11:16:17,815 INFO L78 Accepts]: Start accepts. Automaton has 86066 states and 130417 transitions. Word has length 85 [2019-09-08 11:16:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:17,816 INFO L475 AbstractCegarLoop]: Abstraction has 86066 states and 130417 transitions. [2019-09-08 11:16:17,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:16:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 86066 states and 130417 transitions. [2019-09-08 11:16:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-08 11:16:17,817 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:17,817 INFO L399 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] [2019-09-08 11:16:17,818 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:17,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:17,818 INFO L82 PathProgramCache]: Analyzing trace with hash 682803964, now seen corresponding path program 1 times [2019-09-08 11:16:17,818 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:17,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:17,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:17,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:17,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:17,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:17,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 11:16:17,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 11:16:17,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 11:16:17,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 11:16:17,928 INFO L87 Difference]: Start difference. First operand 86066 states and 130417 transitions. Second operand 5 states. [2019-09-08 11:16:26,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:26,403 INFO L93 Difference]: Finished difference Result 175156 states and 263858 transitions. [2019-09-08 11:16:26,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 11:16:26,403 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-08 11:16:26,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:26,656 INFO L225 Difference]: With dead ends: 175156 [2019-09-08 11:16:26,656 INFO L226 Difference]: Without dead ends: 175154 [2019-09-08 11:16:26,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 11:16:26,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175154 states. [2019-09-08 11:16:31,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175154 to 89138. [2019-09-08 11:16:31,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89138 states. [2019-09-08 11:16:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89138 states to 89138 states and 133489 transitions. [2019-09-08 11:16:31,723 INFO L78 Accepts]: Start accepts. Automaton has 89138 states and 133489 transitions. Word has length 86 [2019-09-08 11:16:31,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:31,723 INFO L475 AbstractCegarLoop]: Abstraction has 89138 states and 133489 transitions. [2019-09-08 11:16:31,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 11:16:31,723 INFO L276 IsEmpty]: Start isEmpty. Operand 89138 states and 133489 transitions. [2019-09-08 11:16:31,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-08 11:16:31,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:31,725 INFO L399 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] [2019-09-08 11:16:31,725 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:31,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:31,725 INFO L82 PathProgramCache]: Analyzing trace with hash -298293779, now seen corresponding path program 1 times [2019-09-08 11:16:31,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:31,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:31,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:31,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:31,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:31,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:16:31,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:16:31,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:16:31,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:16:31,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:16:31,797 INFO L87 Difference]: Start difference. First operand 89138 states and 133489 transitions. Second operand 3 states. [2019-09-08 11:16:39,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:16:39,020 INFO L93 Difference]: Finished difference Result 199128 states and 297733 transitions. [2019-09-08 11:16:39,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:16:39,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-08 11:16:39,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:16:39,171 INFO L225 Difference]: With dead ends: 199128 [2019-09-08 11:16:39,172 INFO L226 Difference]: Without dead ends: 110038 [2019-09-08 11:16:39,267 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:16:39,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110038 states. [2019-09-08 11:16:44,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110038 to 110036. [2019-09-08 11:16:44,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110036 states. [2019-09-08 11:16:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110036 states to 110036 states and 163939 transitions. [2019-09-08 11:16:44,807 INFO L78 Accepts]: Start accepts. Automaton has 110036 states and 163939 transitions. Word has length 87 [2019-09-08 11:16:44,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:16:44,808 INFO L475 AbstractCegarLoop]: Abstraction has 110036 states and 163939 transitions. [2019-09-08 11:16:44,808 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:16:44,808 INFO L276 IsEmpty]: Start isEmpty. Operand 110036 states and 163939 transitions. [2019-09-08 11:16:44,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-08 11:16:44,846 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:16:44,847 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:16:44,847 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:16:44,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:16:44,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1662270977, now seen corresponding path program 1 times [2019-09-08 11:16:44,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:16:44,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:16:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:44,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:44,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:16:44,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:16:45,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:16:45,147 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:16:45,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:16:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:16:45,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 31 conjunts are in the unsatisfiable core [2019-09-08 11:16:45,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:16:45,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 11:16:45,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:16:45,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 19 [2019-09-08 11:16:45,707 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 11:16:45,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 11:16:45,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2019-09-08 11:16:45,708 INFO L87 Difference]: Start difference. First operand 110036 states and 163939 transitions. Second operand 19 states. [2019-09-08 11:18:32,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:18:32,550 INFO L93 Difference]: Finished difference Result 1294254 states and 1906193 transitions. [2019-09-08 11:18:32,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-09-08 11:18:32,551 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 116 [2019-09-08 11:18:32,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:18:35,730 INFO L225 Difference]: With dead ends: 1294254 [2019-09-08 11:18:35,731 INFO L226 Difference]: Without dead ends: 1184268 [2019-09-08 11:18:35,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16517 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=6040, Invalid=31790, Unknown=0, NotChecked=0, Total=37830 [2019-09-08 11:18:36,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1184268 states. [2019-09-08 11:19:11,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1184268 to 255780. [2019-09-08 11:19:11,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255780 states. [2019-09-08 11:19:11,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255780 states to 255780 states and 375891 transitions. [2019-09-08 11:19:11,487 INFO L78 Accepts]: Start accepts. Automaton has 255780 states and 375891 transitions. Word has length 116 [2019-09-08 11:19:11,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:19:11,487 INFO L475 AbstractCegarLoop]: Abstraction has 255780 states and 375891 transitions. [2019-09-08 11:19:11,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 11:19:11,488 INFO L276 IsEmpty]: Start isEmpty. Operand 255780 states and 375891 transitions. [2019-09-08 11:19:11,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:19:11,547 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:19:11,547 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:19:11,548 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:19:11,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:19:11,548 INFO L82 PathProgramCache]: Analyzing trace with hash 482487770, now seen corresponding path program 1 times [2019-09-08 11:19:11,548 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:19:11,548 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:19:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:11,550 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:19:11,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:19:11,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:19:11,637 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:19:11,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:19:11,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:19:11,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:19:11,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:19:11,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:11,639 INFO L87 Difference]: Start difference. First operand 255780 states and 375891 transitions. Second operand 3 states. [2019-09-08 11:19:48,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:19:48,693 INFO L93 Difference]: Finished difference Result 655254 states and 961799 transitions. [2019-09-08 11:19:48,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:19:48,694 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 11:19:48,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:19:49,328 INFO L225 Difference]: With dead ends: 655254 [2019-09-08 11:19:49,328 INFO L226 Difference]: Without dead ends: 434212 [2019-09-08 11:19:49,510 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:19:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434212 states. [2019-09-08 11:20:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434212 to 423234. [2019-09-08 11:20:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423234 states. [2019-09-08 11:20:35,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423234 states to 423234 states and 617101 transitions. [2019-09-08 11:20:35,788 INFO L78 Accepts]: Start accepts. Automaton has 423234 states and 617101 transitions. Word has length 117 [2019-09-08 11:20:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:20:35,789 INFO L475 AbstractCegarLoop]: Abstraction has 423234 states and 617101 transitions. [2019-09-08 11:20:35,789 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:20:35,789 INFO L276 IsEmpty]: Start isEmpty. Operand 423234 states and 617101 transitions. [2019-09-08 11:20:35,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:20:35,849 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:20:35,849 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:20:35,849 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:20:35,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:20:35,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1877792189, now seen corresponding path program 1 times [2019-09-08 11:20:35,850 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:20:35,850 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:20:35,851 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:35,851 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:20:35,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:20:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:20:35,935 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:20:35,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:20:35,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:20:35,937 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:20:35,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:20:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:20:35,938 INFO L87 Difference]: Start difference. First operand 423234 states and 617101 transitions. Second operand 3 states. [2019-09-08 11:21:48,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:21:48,681 INFO L93 Difference]: Finished difference Result 1092518 states and 1596815 transitions. [2019-09-08 11:21:48,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:21:48,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-08 11:21:48,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:21:49,727 INFO L225 Difference]: With dead ends: 1092518 [2019-09-08 11:21:49,727 INFO L226 Difference]: Without dead ends: 707124 [2019-09-08 11:21:50,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:21:50,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707124 states. [2019-09-08 11:23:02,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707124 to 627266. [2019-09-08 11:23:02,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627266 states. [2019-09-08 11:23:03,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627266 states to 627266 states and 912965 transitions. [2019-09-08 11:23:03,344 INFO L78 Accepts]: Start accepts. Automaton has 627266 states and 912965 transitions. Word has length 117 [2019-09-08 11:23:03,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:23:03,344 INFO L475 AbstractCegarLoop]: Abstraction has 627266 states and 912965 transitions. [2019-09-08 11:23:03,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:23:03,345 INFO L276 IsEmpty]: Start isEmpty. Operand 627266 states and 912965 transitions. [2019-09-08 11:23:03,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-08 11:23:03,427 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:23:03,427 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09-08 11:23:03,428 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:23:03,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:23:03,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1892887198, now seen corresponding path program 1 times [2019-09-08 11:23:03,428 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:23:03,429 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:23:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:03,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:23:03,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:23:03,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:03,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 11:23:03,543 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-08 11:23:03,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 11:23:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:23:03,685 INFO L256 TraceCheckSpWp]: Trace formula consists of 933 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-08 11:23:03,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 11:23:03,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:23:03,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 11:23:03,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2019-09-08 11:23:03,798 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:23:03,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:23:03,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:23:03,799 INFO L87 Difference]: Start difference. First operand 627266 states and 912965 transitions. Second operand 11 states. [2019-09-08 11:25:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:25:36,357 INFO L93 Difference]: Finished difference Result 1761164 states and 2561445 transitions. [2019-09-08 11:25:36,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 11:25:36,357 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 117 [2019-09-08 11:25:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:25:38,397 INFO L225 Difference]: With dead ends: 1761164 [2019-09-08 11:25:38,398 INFO L226 Difference]: Without dead ends: 1269322 [2019-09-08 11:25:38,821 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:25:39,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269322 states.