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_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 13:10:35,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 13:10:35,691 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 13:10:35,711 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 13:10:35,711 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 13:10:35,713 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 13:10:35,715 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 13:10:35,725 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 13:10:35,730 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 13:10:35,733 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 13:10:35,735 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 13:10:35,738 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 13:10:35,738 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 13:10:35,740 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 13:10:35,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 13:10:35,744 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 13:10:35,746 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 13:10:35,747 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 13:10:35,749 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 13:10:35,754 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 13:10:35,759 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 13:10:35,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 13:10:35,765 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 13:10:35,766 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 13:10:35,769 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 13:10:35,769 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 13:10:35,769 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 13:10:35,771 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 13:10:35,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 13:10:35,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 13:10:35,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 13:10:35,776 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 13:10:35,777 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 13:10:35,778 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 13:10:35,780 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 13:10:35,780 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 13:10:35,781 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 13:10:35,781 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 13:10:35,781 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 13:10:35,782 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 13:10:35,783 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 13:10:35,784 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 13:10:35,807 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 13:10:35,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 13:10:35,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 13:10:35,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 13:10:35,810 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 13:10:35,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 13:10:35,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 13:10:35,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 13:10:35,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 13:10:35,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 13:10:35,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 13:10:35,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 13:10:35,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 13:10:35,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 13:10:35,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 13:10:35,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 13:10:35,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 13:10:35,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 13:10:35,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 13:10:35,813 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 13:10:35,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 13:10:35,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 13:10:35,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 13:10:35,814 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 13:10:35,814 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 13:10:35,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 13:10:35,814 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 13:10:35,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 13:10:35,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 13:10:35,845 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 13:10:35,859 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 13:10:35,863 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 13:10:35,865 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 13:10:35,865 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 13:10:35,866 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:10:35,933 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43ebde14/bb529a20283f4449ac2d122c912f7ee3/FLAG365d82782 [2019-09-08 13:10:36,476 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 13:10:36,477 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:10:36,502 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43ebde14/bb529a20283f4449ac2d122c912f7ee3/FLAG365d82782 [2019-09-08 13:10:36,769 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a43ebde14/bb529a20283f4449ac2d122c912f7ee3 [2019-09-08 13:10:36,778 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 13:10:36,779 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 13:10:36,780 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 13:10:36,780 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 13:10:36,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 13:10:36,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:36" (1/1) ... [2019-09-08 13:10:36,788 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:36, skipping insertion in model container [2019-09-08 13:10:36,788 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 01:10:36" (1/1) ... [2019-09-08 13:10:36,796 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 13:10:36,867 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 13:10:37,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:10:37,450 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 13:10:37,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 13:10:37,606 INFO L192 MainTranslator]: Completed translation [2019-09-08 13:10:37,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37 WrapperNode [2019-09-08 13:10:37,606 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 13:10:37,607 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 13:10:37,607 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 13:10:37,607 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 13:10:37,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,634 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,635 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,663 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,685 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,690 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (1/1) ... [2019-09-08 13:10:37,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 13:10:37,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 13:10:37,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 13:10:37,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 13:10:37,700 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (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 13:10:37,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 13:10:37,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 13:10:37,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 13:10:37,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 13:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 13:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 13:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 13:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 13:10:37,781 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 13:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 13:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 13:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 13:10:37,782 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 13:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 13:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 13:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 13:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 13:10:37,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 13:10:37,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 13:10:39,350 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 13:10:39,351 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 13:10:39,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:39 BoogieIcfgContainer [2019-09-08 13:10:39,352 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 13:10:39,353 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 13:10:39,353 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 13:10:39,356 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 13:10:39,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 01:10:36" (1/3) ... [2019-09-08 13:10:39,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3e80e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:39, skipping insertion in model container [2019-09-08 13:10:39,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 01:10:37" (2/3) ... [2019-09-08 13:10:39,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b3e80e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 01:10:39, skipping insertion in model container [2019-09-08 13:10:39,359 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 01:10:39" (3/3) ... [2019-09-08 13:10:39,360 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.4.2.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 13:10:39,373 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 13:10:39,398 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 13:10:39,417 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 13:10:39,468 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 13:10:39,469 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 13:10:39,469 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 13:10:39,470 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 13:10:39,470 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 13:10:39,470 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 13:10:39,470 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 13:10:39,470 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 13:10:39,470 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 13:10:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states. [2019-09-08 13:10:39,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-08 13:10:39,546 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:39,547 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:39,549 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:39,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:39,555 INFO L82 PathProgramCache]: Analyzing trace with hash -35123060, now seen corresponding path program 1 times [2019-09-08 13:10:39,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:39,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:39,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:39,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:39,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:39,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:40,247 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 13:10:40,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:40,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:40,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:40,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:40,272 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:40,274 INFO L87 Difference]: Start difference. First operand 347 states. Second operand 3 states. [2019-09-08 13:10:40,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:40,457 INFO L93 Difference]: Finished difference Result 635 states and 1098 transitions. [2019-09-08 13:10:40,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:40,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-09-08 13:10:40,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:40,490 INFO L225 Difference]: With dead ends: 635 [2019-09-08 13:10:40,491 INFO L226 Difference]: Without dead ends: 477 [2019-09-08 13:10:40,498 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 13:10:40,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2019-09-08 13:10:40,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 475. [2019-09-08 13:10:40,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 475 states. [2019-09-08 13:10:40,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 783 transitions. [2019-09-08 13:10:40,604 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 783 transitions. Word has length 122 [2019-09-08 13:10:40,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:40,606 INFO L475 AbstractCegarLoop]: Abstraction has 475 states and 783 transitions. [2019-09-08 13:10:40,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:40,635 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 783 transitions. [2019-09-08 13:10:40,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-09-08 13:10:40,641 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:40,641 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:40,642 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:40,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:40,643 INFO L82 PathProgramCache]: Analyzing trace with hash 993718675, now seen corresponding path program 1 times [2019-09-08 13:10:40,644 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:40,644 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:40,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:40,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:40,865 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 13:10:40,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:40,866 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:40,868 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:40,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:40,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:40,868 INFO L87 Difference]: Start difference. First operand 475 states and 783 transitions. Second operand 3 states. [2019-09-08 13:10:40,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:40,934 INFO L93 Difference]: Finished difference Result 1011 states and 1679 transitions. [2019-09-08 13:10:40,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:40,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-09-08 13:10:40,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:40,941 INFO L225 Difference]: With dead ends: 1011 [2019-09-08 13:10:40,941 INFO L226 Difference]: Without dead ends: 733 [2019-09-08 13:10:40,944 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 13:10:40,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2019-09-08 13:10:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 731. [2019-09-08 13:10:40,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 731 states. [2019-09-08 13:10:40,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 731 states to 731 states and 1210 transitions. [2019-09-08 13:10:40,991 INFO L78 Accepts]: Start accepts. Automaton has 731 states and 1210 transitions. Word has length 125 [2019-09-08 13:10:40,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:40,992 INFO L475 AbstractCegarLoop]: Abstraction has 731 states and 1210 transitions. [2019-09-08 13:10:40,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:40,992 INFO L276 IsEmpty]: Start isEmpty. Operand 731 states and 1210 transitions. [2019-09-08 13:10:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 13:10:40,995 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:40,996 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:40,996 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:40,996 INFO L82 PathProgramCache]: Analyzing trace with hash -1625513079, now seen corresponding path program 1 times [2019-09-08 13:10:40,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:40,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:40,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:40,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:41,163 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 13:10:41,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:41,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:41,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:41,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:41,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:41,167 INFO L87 Difference]: Start difference. First operand 731 states and 1210 transitions. Second operand 3 states. [2019-09-08 13:10:41,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:41,228 INFO L93 Difference]: Finished difference Result 1759 states and 2924 transitions. [2019-09-08 13:10:41,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:41,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 13:10:41,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:41,240 INFO L225 Difference]: With dead ends: 1759 [2019-09-08 13:10:41,240 INFO L226 Difference]: Without dead ends: 1225 [2019-09-08 13:10:41,244 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 13:10:41,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2019-09-08 13:10:41,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1223. [2019-09-08 13:10:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1223 states. [2019-09-08 13:10:41,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 2026 transitions. [2019-09-08 13:10:41,314 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 2026 transitions. Word has length 128 [2019-09-08 13:10:41,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:41,316 INFO L475 AbstractCegarLoop]: Abstraction has 1223 states and 2026 transitions. [2019-09-08 13:10:41,316 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 2026 transitions. [2019-09-08 13:10:41,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 13:10:41,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:41,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:41,321 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:41,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:41,322 INFO L82 PathProgramCache]: Analyzing trace with hash 649173988, now seen corresponding path program 1 times [2019-09-08 13:10:41,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:41,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:41,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:41,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:41,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:41,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-09-08 13:10:41,507 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:41,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:41,509 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:41,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:41,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:41,509 INFO L87 Difference]: Start difference. First operand 1223 states and 2026 transitions. Second operand 3 states. [2019-09-08 13:10:41,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:41,603 INFO L93 Difference]: Finished difference Result 3195 states and 5300 transitions. [2019-09-08 13:10:41,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:41,603 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-09-08 13:10:41,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:41,619 INFO L225 Difference]: With dead ends: 3195 [2019-09-08 13:10:41,620 INFO L226 Difference]: Without dead ends: 2169 [2019-09-08 13:10:41,623 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 13:10:41,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2019-09-08 13:10:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2167. [2019-09-08 13:10:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2167 states. [2019-09-08 13:10:41,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2167 states to 2167 states and 3582 transitions. [2019-09-08 13:10:41,718 INFO L78 Accepts]: Start accepts. Automaton has 2167 states and 3582 transitions. Word has length 131 [2019-09-08 13:10:41,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:41,718 INFO L475 AbstractCegarLoop]: Abstraction has 2167 states and 3582 transitions. [2019-09-08 13:10:41,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:41,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2167 states and 3582 transitions. [2019-09-08 13:10:41,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-08 13:10:41,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:41,722 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:41,723 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:41,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:41,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1855611538, now seen corresponding path program 1 times [2019-09-08 13:10:41,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:41,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:41,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:41,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:41,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:41,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:42,032 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 13:10:42,033 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:42,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:10:42,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:10:42,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:10:42,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:10:42,034 INFO L87 Difference]: Start difference. First operand 2167 states and 3582 transitions. Second operand 6 states. [2019-09-08 13:10:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:42,588 INFO L93 Difference]: Finished difference Result 8233 states and 13695 transitions. [2019-09-08 13:10:42,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:10:42,588 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 134 [2019-09-08 13:10:42,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:42,623 INFO L225 Difference]: With dead ends: 8233 [2019-09-08 13:10:42,623 INFO L226 Difference]: Without dead ends: 6263 [2019-09-08 13:10:42,630 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:10:42,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6263 states. [2019-09-08 13:10:43,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6263 to 4929. [2019-09-08 13:10:43,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4929 states. [2019-09-08 13:10:43,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4929 states to 4929 states and 8167 transitions. [2019-09-08 13:10:43,119 INFO L78 Accepts]: Start accepts. Automaton has 4929 states and 8167 transitions. Word has length 134 [2019-09-08 13:10:43,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:43,119 INFO L475 AbstractCegarLoop]: Abstraction has 4929 states and 8167 transitions. [2019-09-08 13:10:43,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:10:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 4929 states and 8167 transitions. [2019-09-08 13:10:43,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 13:10:43,124 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:43,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:43,125 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:43,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:43,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1755551114, now seen corresponding path program 1 times [2019-09-08 13:10:43,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:43,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:43,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:43,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:43,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:43,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:43,328 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 13:10:43,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:43,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:43,329 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:43,330 INFO L87 Difference]: Start difference. First operand 4929 states and 8167 transitions. Second operand 4 states. [2019-09-08 13:10:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:43,750 INFO L93 Difference]: Finished difference Result 13059 states and 21734 transitions. [2019-09-08 13:10:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:43,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-09-08 13:10:43,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:43,875 INFO L225 Difference]: With dead ends: 13059 [2019-09-08 13:10:43,875 INFO L226 Difference]: Without dead ends: 8327 [2019-09-08 13:10:43,885 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:43,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8327 states. [2019-09-08 13:10:44,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8327 to 7273. [2019-09-08 13:10:44,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7273 states. [2019-09-08 13:10:44,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7273 states to 7273 states and 12070 transitions. [2019-09-08 13:10:44,454 INFO L78 Accepts]: Start accepts. Automaton has 7273 states and 12070 transitions. Word has length 135 [2019-09-08 13:10:44,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:44,455 INFO L475 AbstractCegarLoop]: Abstraction has 7273 states and 12070 transitions. [2019-09-08 13:10:44,455 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:44,455 INFO L276 IsEmpty]: Start isEmpty. Operand 7273 states and 12070 transitions. [2019-09-08 13:10:44,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:10:44,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:44,464 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:44,464 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:44,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:44,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1365624242, now seen corresponding path program 1 times [2019-09-08 13:10:44,465 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:44,465 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:44,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:44,467 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:44,467 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:44,616 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 13:10:44,617 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:44,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:44,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:44,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:44,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:44,618 INFO L87 Difference]: Start difference. First operand 7273 states and 12070 transitions. Second operand 3 states. [2019-09-08 13:10:45,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:45,521 INFO L93 Difference]: Finished difference Result 16045 states and 26759 transitions. [2019-09-08 13:10:45,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:45,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:10:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:45,612 INFO L225 Difference]: With dead ends: 16045 [2019-09-08 13:10:45,612 INFO L226 Difference]: Without dead ends: 11099 [2019-09-08 13:10:45,630 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 13:10:45,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11099 states. [2019-09-08 13:10:46,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11099 to 11097. [2019-09-08 13:10:46,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11097 states. [2019-09-08 13:10:46,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11097 states to 11097 states and 18425 transitions. [2019-09-08 13:10:46,464 INFO L78 Accepts]: Start accepts. Automaton has 11097 states and 18425 transitions. Word has length 136 [2019-09-08 13:10:46,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:46,464 INFO L475 AbstractCegarLoop]: Abstraction has 11097 states and 18425 transitions. [2019-09-08 13:10:46,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:46,465 INFO L276 IsEmpty]: Start isEmpty. Operand 11097 states and 18425 transitions. [2019-09-08 13:10:46,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:10:46,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:46,468 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:46,468 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:46,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:46,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1188137794, now seen corresponding path program 1 times [2019-09-08 13:10:46,469 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:46,469 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:46,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:46,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:46,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:46,583 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 13:10:46,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:46,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:46,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:46,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:46,585 INFO L87 Difference]: Start difference. First operand 11097 states and 18425 transitions. Second operand 3 states. [2019-09-08 13:10:47,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:47,299 INFO L93 Difference]: Finished difference Result 21684 states and 36050 transitions. [2019-09-08 13:10:47,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:47,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:10:47,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:47,340 INFO L225 Difference]: With dead ends: 21684 [2019-09-08 13:10:47,341 INFO L226 Difference]: Without dead ends: 15670 [2019-09-08 13:10:47,355 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 13:10:47,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15670 states. [2019-09-08 13:10:47,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15670 to 15668. [2019-09-08 13:10:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15668 states. [2019-09-08 13:10:48,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15668 states to 15668 states and 25956 transitions. [2019-09-08 13:10:48,659 INFO L78 Accepts]: Start accepts. Automaton has 15668 states and 25956 transitions. Word has length 136 [2019-09-08 13:10:48,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:48,659 INFO L475 AbstractCegarLoop]: Abstraction has 15668 states and 25956 transitions. [2019-09-08 13:10:48,659 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:48,660 INFO L276 IsEmpty]: Start isEmpty. Operand 15668 states and 25956 transitions. [2019-09-08 13:10:48,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:10:48,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:48,662 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:48,662 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:48,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:48,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1350880053, now seen corresponding path program 1 times [2019-09-08 13:10:48,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:48,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:48,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:48,665 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:48,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:48,809 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 13:10:48,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:48,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:10:48,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:10:48,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:10:48,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:48,811 INFO L87 Difference]: Start difference. First operand 15668 states and 25956 transitions. Second operand 4 states. [2019-09-08 13:10:49,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:49,861 INFO L93 Difference]: Finished difference Result 42122 states and 69934 transitions. [2019-09-08 13:10:49,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:10:49,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-09-08 13:10:49,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:49,924 INFO L225 Difference]: With dead ends: 42122 [2019-09-08 13:10:49,924 INFO L226 Difference]: Without dead ends: 26712 [2019-09-08 13:10:49,958 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:10:49,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26712 states. [2019-09-08 13:10:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26712 to 23307. [2019-09-08 13:10:50,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23307 states. [2019-09-08 13:10:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23307 states to 23307 states and 38542 transitions. [2019-09-08 13:10:50,899 INFO L78 Accepts]: Start accepts. Automaton has 23307 states and 38542 transitions. Word has length 136 [2019-09-08 13:10:50,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:50,899 INFO L475 AbstractCegarLoop]: Abstraction has 23307 states and 38542 transitions. [2019-09-08 13:10:50,900 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:10:50,900 INFO L276 IsEmpty]: Start isEmpty. Operand 23307 states and 38542 transitions. [2019-09-08 13:10:50,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:10:50,902 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:50,902 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:50,903 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:50,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:50,903 INFO L82 PathProgramCache]: Analyzing trace with hash -788578752, now seen corresponding path program 1 times [2019-09-08 13:10:50,903 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:50,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:50,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:50,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:51,012 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 13:10:51,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:51,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:51,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:51,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:51,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:51,014 INFO L87 Difference]: Start difference. First operand 23307 states and 38542 transitions. Second operand 3 states. [2019-09-08 13:10:52,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:52,501 INFO L93 Difference]: Finished difference Result 48435 states and 80219 transitions. [2019-09-08 13:10:52,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:52,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:10:52,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:52,579 INFO L225 Difference]: With dead ends: 48435 [2019-09-08 13:10:52,579 INFO L226 Difference]: Without dead ends: 33980 [2019-09-08 13:10:52,609 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 13:10:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33980 states. [2019-09-08 13:10:54,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33980 to 33978. [2019-09-08 13:10:54,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33978 states. [2019-09-08 13:10:54,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33978 states to 33978 states and 56027 transitions. [2019-09-08 13:10:54,512 INFO L78 Accepts]: Start accepts. Automaton has 33978 states and 56027 transitions. Word has length 136 [2019-09-08 13:10:54,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:54,513 INFO L475 AbstractCegarLoop]: Abstraction has 33978 states and 56027 transitions. [2019-09-08 13:10:54,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:54,513 INFO L276 IsEmpty]: Start isEmpty. Operand 33978 states and 56027 transitions. [2019-09-08 13:10:54,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 13:10:54,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:54,515 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:54,516 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:54,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:54,516 INFO L82 PathProgramCache]: Analyzing trace with hash -783429068, now seen corresponding path program 1 times [2019-09-08 13:10:54,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:54,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:54,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:54,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:54,607 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 13:10:54,607 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:54,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:10:54,608 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:10:54,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:10:54,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:10:54,608 INFO L87 Difference]: Start difference. First operand 33978 states and 56027 transitions. Second operand 3 states. [2019-09-08 13:10:55,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:10:55,865 INFO L93 Difference]: Finished difference Result 74043 states and 122228 transitions. [2019-09-08 13:10:55,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:10:55,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-09-08 13:10:55,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:10:55,987 INFO L225 Difference]: With dead ends: 74043 [2019-09-08 13:10:55,987 INFO L226 Difference]: Without dead ends: 50517 [2019-09-08 13:10:56,037 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 13:10:56,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50517 states. [2019-09-08 13:10:57,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50517 to 50515. [2019-09-08 13:10:57,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50515 states. [2019-09-08 13:10:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50515 states to 50515 states and 82987 transitions. [2019-09-08 13:10:57,705 INFO L78 Accepts]: Start accepts. Automaton has 50515 states and 82987 transitions. Word has length 136 [2019-09-08 13:10:57,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:10:57,706 INFO L475 AbstractCegarLoop]: Abstraction has 50515 states and 82987 transitions. [2019-09-08 13:10:57,706 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:10:57,706 INFO L276 IsEmpty]: Start isEmpty. Operand 50515 states and 82987 transitions. [2019-09-08 13:10:57,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 13:10:57,707 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:10:57,708 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:10:57,708 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:10:57,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:10:57,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1129443555, now seen corresponding path program 1 times [2019-09-08 13:10:57,708 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:10:57,708 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:10:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:57,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:10:57,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:10:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:10:57,866 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 13:10:57,867 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:10:57,867 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 13:10:57,867 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 13:10:57,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 13:10:57,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 13:10:57,869 INFO L87 Difference]: Start difference. First operand 50515 states and 82987 transitions. Second operand 7 states. [2019-09-08 13:11:04,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:04,757 INFO L93 Difference]: Finished difference Result 235795 states and 387004 transitions. [2019-09-08 13:11:04,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 13:11:04,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 137 [2019-09-08 13:11:04,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:05,053 INFO L225 Difference]: With dead ends: 235795 [2019-09-08 13:11:05,054 INFO L226 Difference]: Without dead ends: 185545 [2019-09-08 13:11:05,128 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 13:11:05,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185545 states. [2019-09-08 13:11:14,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185545 to 140538. [2019-09-08 13:11:14,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140538 states. [2019-09-08 13:11:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140538 states to 140538 states and 228866 transitions. [2019-09-08 13:11:14,338 INFO L78 Accepts]: Start accepts. Automaton has 140538 states and 228866 transitions. Word has length 137 [2019-09-08 13:11:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:14,338 INFO L475 AbstractCegarLoop]: Abstraction has 140538 states and 228866 transitions. [2019-09-08 13:11:14,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 13:11:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 140538 states and 228866 transitions. [2019-09-08 13:11:14,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 13:11:14,340 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:14,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:14,341 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:14,341 INFO L82 PathProgramCache]: Analyzing trace with hash -705506052, now seen corresponding path program 1 times [2019-09-08 13:11:14,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:14,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:14,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:14,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:14,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:14,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:14,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-09-08 13:11:14,455 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:14,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:11:14,456 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:11:14,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:11:14,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:11:14,457 INFO L87 Difference]: Start difference. First operand 140538 states and 228866 transitions. Second operand 4 states. [2019-09-08 13:11:26,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:26,450 INFO L93 Difference]: Finished difference Result 414543 states and 675293 transitions. [2019-09-08 13:11:26,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 13:11:26,451 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-09-08 13:11:26,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:26,879 INFO L225 Difference]: With dead ends: 414543 [2019-09-08 13:11:26,879 INFO L226 Difference]: Without dead ends: 274270 [2019-09-08 13:11:27,001 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:11:27,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274270 states. [2019-09-08 13:11:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274270 to 206995. [2019-09-08 13:11:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206995 states. [2019-09-08 13:11:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206995 states to 206995 states and 336271 transitions. [2019-09-08 13:11:39,537 INFO L78 Accepts]: Start accepts. Automaton has 206995 states and 336271 transitions. Word has length 138 [2019-09-08 13:11:39,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:11:39,538 INFO L475 AbstractCegarLoop]: Abstraction has 206995 states and 336271 transitions. [2019-09-08 13:11:39,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:11:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 206995 states and 336271 transitions. [2019-09-08 13:11:39,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 13:11:39,539 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:11:39,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:11:39,540 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:11:39,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:11:39,540 INFO L82 PathProgramCache]: Analyzing trace with hash -876112340, now seen corresponding path program 1 times [2019-09-08 13:11:39,540 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:11:39,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:11:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:39,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:11:39,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:11:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:11:39,853 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 13:11:39,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:11:39,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:11:39,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:11:39,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:11:39,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:11:39,855 INFO L87 Difference]: Start difference. First operand 206995 states and 336271 transitions. Second operand 6 states. [2019-09-08 13:11:56,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:11:56,806 INFO L93 Difference]: Finished difference Result 505595 states and 822137 transitions. [2019-09-08 13:11:56,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:11:56,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 140 [2019-09-08 13:11:56,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:11:57,330 INFO L225 Difference]: With dead ends: 505595 [2019-09-08 13:11:57,330 INFO L226 Difference]: Without dead ends: 298865 [2019-09-08 13:11:57,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:11:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298865 states. [2019-09-08 13:12:15,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298865 to 236155. [2019-09-08 13:12:15,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236155 states. [2019-09-08 13:12:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236155 states to 236155 states and 382876 transitions. [2019-09-08 13:12:15,723 INFO L78 Accepts]: Start accepts. Automaton has 236155 states and 382876 transitions. Word has length 140 [2019-09-08 13:12:15,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:12:15,724 INFO L475 AbstractCegarLoop]: Abstraction has 236155 states and 382876 transitions. [2019-09-08 13:12:15,724 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:12:15,724 INFO L276 IsEmpty]: Start isEmpty. Operand 236155 states and 382876 transitions. [2019-09-08 13:12:15,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 13:12:15,725 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:12:15,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:12:15,725 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:12:15,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:12:15,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1795769074, now seen corresponding path program 1 times [2019-09-08 13:12:15,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:12:15,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:12:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:15,727 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:12:15,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:12:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:12:15,972 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 13:12:15,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:12:15,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:12:15,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:12:15,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:12:15,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:12:15,974 INFO L87 Difference]: Start difference. First operand 236155 states and 382876 transitions. Second operand 6 states. [2019-09-08 13:12:44,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:12:44,362 INFO L93 Difference]: Finished difference Result 694563 states and 1128732 transitions. [2019-09-08 13:12:44,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:12:44,363 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-09-08 13:12:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:12:45,116 INFO L225 Difference]: With dead ends: 694563 [2019-09-08 13:12:45,117 INFO L226 Difference]: Without dead ends: 458673 [2019-09-08 13:12:45,294 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:12:45,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458673 states. [2019-09-08 13:13:16,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458673 to 420187. [2019-09-08 13:13:16,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420187 states. [2019-09-08 13:13:18,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420187 states to 420187 states and 680963 transitions. [2019-09-08 13:13:18,065 INFO L78 Accepts]: Start accepts. Automaton has 420187 states and 680963 transitions. Word has length 143 [2019-09-08 13:13:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:13:18,065 INFO L475 AbstractCegarLoop]: Abstraction has 420187 states and 680963 transitions. [2019-09-08 13:13:18,065 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:13:18,065 INFO L276 IsEmpty]: Start isEmpty. Operand 420187 states and 680963 transitions. [2019-09-08 13:13:18,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 13:13:18,066 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:13:18,067 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:13:18,067 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:13:18,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:13:18,067 INFO L82 PathProgramCache]: Analyzing trace with hash 163824457, now seen corresponding path program 1 times [2019-09-08 13:13:18,068 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:13:18,068 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:13:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:18,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:13:18,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:13:18,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:13:18,228 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 13:13:18,229 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:13:18,229 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 13:13:18,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 13:13:18,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 13:13:18,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:13:18,230 INFO L87 Difference]: Start difference. First operand 420187 states and 680963 transitions. Second operand 5 states. [2019-09-08 13:14:01,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:14:01,763 INFO L93 Difference]: Finished difference Result 704203 states and 1136909 transitions. [2019-09-08 13:14:01,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:14:01,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 144 [2019-09-08 13:14:01,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:14:03,527 INFO L225 Difference]: With dead ends: 704203 [2019-09-08 13:14:03,528 INFO L226 Difference]: Without dead ends: 704201 [2019-09-08 13:14:03,641 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 13:14:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704201 states. [2019-09-08 13:14:44,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704201 to 426099. [2019-09-08 13:14:44,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426099 states. [2019-09-08 13:14:44,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426099 states to 426099 states and 686830 transitions. [2019-09-08 13:14:44,804 INFO L78 Accepts]: Start accepts. Automaton has 426099 states and 686830 transitions. Word has length 144 [2019-09-08 13:14:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:14:44,804 INFO L475 AbstractCegarLoop]: Abstraction has 426099 states and 686830 transitions. [2019-09-08 13:14:44,804 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 13:14:44,804 INFO L276 IsEmpty]: Start isEmpty. Operand 426099 states and 686830 transitions. [2019-09-08 13:14:44,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:14:44,813 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:14:44,814 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:14:44,814 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:14:44,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:14:44,814 INFO L82 PathProgramCache]: Analyzing trace with hash 537249617, now seen corresponding path program 1 times [2019-09-08 13:14:44,814 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:14:44,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:14:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:44,816 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:14:44,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:14:44,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:14:44,956 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 13:14:44,956 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:14:44,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 13:14:44,957 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 13:14:44,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 13:14:44,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 13:14:44,957 INFO L87 Difference]: Start difference. First operand 426099 states and 686830 transitions. Second operand 3 states. [2019-09-08 13:15:14,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:15:14,988 INFO L93 Difference]: Finished difference Result 783960 states and 1264481 transitions. [2019-09-08 13:15:14,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 13:15:14,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 13:15:14,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:15:15,838 INFO L225 Difference]: With dead ends: 783960 [2019-09-08 13:15:15,838 INFO L226 Difference]: Without dead ends: 358126 [2019-09-08 13:15:16,207 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 13:15:16,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358126 states. [2019-09-08 13:15:46,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358126 to 357295. [2019-09-08 13:15:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357295 states. [2019-09-08 13:15:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357295 states to 357295 states and 574614 transitions. [2019-09-08 13:15:46,746 INFO L78 Accepts]: Start accepts. Automaton has 357295 states and 574614 transitions. Word has length 178 [2019-09-08 13:15:46,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:15:46,746 INFO L475 AbstractCegarLoop]: Abstraction has 357295 states and 574614 transitions. [2019-09-08 13:15:46,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 13:15:46,747 INFO L276 IsEmpty]: Start isEmpty. Operand 357295 states and 574614 transitions. [2019-09-08 13:15:46,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 13:15:46,752 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:15:46,753 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:15:46,753 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:15:46,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:15:46,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1114295107, now seen corresponding path program 1 times [2019-09-08 13:15:46,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:15:46,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:15:46,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:46,755 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:15:46,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:15:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:15:47,032 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-09-08 13:15:47,032 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:15:47,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 13:15:47,033 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 13:15:47,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 13:15:47,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 13:15:47,033 INFO L87 Difference]: Start difference. First operand 357295 states and 574614 transitions. Second operand 4 states. [2019-09-08 13:16:36,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:16:36,171 INFO L93 Difference]: Finished difference Result 900329 states and 1446659 transitions. [2019-09-08 13:16:36,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 13:16:36,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 178 [2019-09-08 13:16:36,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:16:37,363 INFO L225 Difference]: With dead ends: 900329 [2019-09-08 13:16:37,364 INFO L226 Difference]: Without dead ends: 672275 [2019-09-08 13:16:37,606 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 13:16:38,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672275 states. [2019-09-08 13:17:26,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672275 to 578438. [2019-09-08 13:17:26,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578438 states. [2019-09-08 13:17:28,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578438 states to 578438 states and 929380 transitions. [2019-09-08 13:17:28,057 INFO L78 Accepts]: Start accepts. Automaton has 578438 states and 929380 transitions. Word has length 178 [2019-09-08 13:17:28,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:17:28,058 INFO L475 AbstractCegarLoop]: Abstraction has 578438 states and 929380 transitions. [2019-09-08 13:17:28,058 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 13:17:28,058 INFO L276 IsEmpty]: Start isEmpty. Operand 578438 states and 929380 transitions. [2019-09-08 13:17:28,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:17:28,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:17:28,063 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:17:28,063 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:17:28,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:17:28,063 INFO L82 PathProgramCache]: Analyzing trace with hash 549360595, now seen corresponding path program 1 times [2019-09-08 13:17:28,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:17:28,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:17:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:28,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:17:28,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:17:28,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:17:28,259 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 13:17:28,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:17:28,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:17:28,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:17:28,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:17:28,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:17:28,261 INFO L87 Difference]: Start difference. First operand 578438 states and 929380 transitions. Second operand 6 states. [2019-09-08 13:18:27,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:18:27,065 INFO L93 Difference]: Finished difference Result 930013 states and 1501283 transitions. [2019-09-08 13:18:27,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:18:27,066 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-08 13:18:27,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:18:28,291 INFO L225 Difference]: With dead ends: 930013 [2019-09-08 13:18:28,292 INFO L226 Difference]: Without dead ends: 787737 [2019-09-08 13:18:28,485 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 13:18:29,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787737 states. [2019-09-08 13:19:34,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787737 to 656046. [2019-09-08 13:19:34,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 656046 states. [2019-09-08 13:19:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 656046 states to 656046 states and 1054743 transitions. [2019-09-08 13:19:36,677 INFO L78 Accepts]: Start accepts. Automaton has 656046 states and 1054743 transitions. Word has length 179 [2019-09-08 13:19:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 13:19:36,677 INFO L475 AbstractCegarLoop]: Abstraction has 656046 states and 1054743 transitions. [2019-09-08 13:19:36,677 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 13:19:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 656046 states and 1054743 transitions. [2019-09-08 13:19:36,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 13:19:36,681 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 13:19:36,681 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 13:19:36,681 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 13:19:36,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 13:19:36,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1888394913, now seen corresponding path program 1 times [2019-09-08 13:19:36,681 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 13:19:36,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 13:19:36,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:36,683 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 13:19:36,683 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 13:19:36,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 13:19:36,879 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-09-08 13:19:36,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 13:19:36,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 13:19:36,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 13:19:36,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 13:19:36,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 13:19:36,881 INFO L87 Difference]: Start difference. First operand 656046 states and 1054743 transitions. Second operand 6 states. [2019-09-08 13:20:41,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 13:20:41,337 INFO L93 Difference]: Finished difference Result 1046026 states and 1686150 transitions. [2019-09-08 13:20:41,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 13:20:41,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 179 [2019-09-08 13:20:41,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 13:20:42,762 INFO L225 Difference]: With dead ends: 1046026 [2019-09-08 13:20:42,762 INFO L226 Difference]: Without dead ends: 796732 [2019-09-08 13:20:43,071 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 13:20:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796732 states.