java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:38:19,262 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:38:19,265 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:38:19,279 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:38:19,279 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:38:19,280 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:38:19,282 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:38:19,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:38:19,285 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:38:19,286 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:38:19,287 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:38:19,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:38:19,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:38:19,289 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:38:19,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:38:19,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:38:19,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:38:19,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:38:19,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:38:19,297 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:38:19,298 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:38:19,299 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:38:19,300 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:38:19,301 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:38:19,303 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:38:19,304 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:38:19,304 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:38:19,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:38:19,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:38:19,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:38:19,307 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:38:19,307 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:38:19,308 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:38:19,309 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:38:19,310 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:38:19,310 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:38:19,311 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:38:19,311 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:38:19,311 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:38:19,312 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:38:19,313 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:38:19,314 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 09:38:19,331 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:38:19,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:38:19,333 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:38:19,333 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:38:19,333 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:38:19,334 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:38:19,334 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:38:19,334 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:38:19,334 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:38:19,334 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:38:19,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:38:19,335 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:38:19,335 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:38:19,335 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:38:19,335 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:38:19,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:38:19,336 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:38:19,336 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:38:19,336 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:38:19,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:38:19,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:38:19,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:38:19,337 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:38:19,337 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:38:19,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:38:19,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:38:19,338 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:38:19,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:38:19,338 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:38:19,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:38:19,378 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:38:19,382 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:38:19,386 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:38:19,387 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:38:19,387 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 09:38:19,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8abd1d2/96a6dee80afe4cd68bc61c28c29e92de/FLAGe00099552 [2019-09-08 09:38:20,046 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:38:20,047 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 09:38:20,076 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8abd1d2/96a6dee80afe4cd68bc61c28c29e92de/FLAGe00099552 [2019-09-08 09:38:20,318 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a8abd1d2/96a6dee80afe4cd68bc61c28c29e92de [2019-09-08 09:38:20,326 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:38:20,328 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:38:20,329 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:38:20,330 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:38:20,333 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:38:20,336 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:38:20" (1/1) ... [2019-09-08 09:38:20,339 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5735c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:20, skipping insertion in model container [2019-09-08 09:38:20,339 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:38:20" (1/1) ... [2019-09-08 09:38:20,346 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:38:20,422 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:38:21,050 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:38:21,072 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:38:21,538 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:38:21,560 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:38:21,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21 WrapperNode [2019-09-08 09:38:21,560 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:38:21,561 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:38:21,562 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:38:21,562 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:38:21,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,655 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,683 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,698 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (1/1) ... [2019-09-08 09:38:21,718 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:38:21,718 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:38:21,719 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:38:21,719 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:38:21,720 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (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 09:38:21,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:38:21,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:38:21,782 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:38:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:38:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:38:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:38:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:38:21,783 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:38:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:38:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:38:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:38:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:38:21,784 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:38:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:38:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:38:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:38:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:38:21,785 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:38:23,549 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:38:23,550 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:38:23,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:38:23 BoogieIcfgContainer [2019-09-08 09:38:23,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:38:23,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:38:23,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:38:23,559 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:38:23,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:38:20" (1/3) ... [2019-09-08 09:38:23,560 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e9332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:38:23, skipping insertion in model container [2019-09-08 09:38:23,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:38:21" (2/3) ... [2019-09-08 09:38:23,562 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@521e9332 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:38:23, skipping insertion in model container [2019-09-08 09:38:23,562 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:38:23" (3/3) ... [2019-09-08 09:38:23,570 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-09-08 09:38:23,583 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:38:23,606 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-09-08 09:38:23,624 INFO L252 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-09-08 09:38:23,672 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:38:23,673 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:38:23,674 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:38:23,674 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:38:23,674 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:38:23,674 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:38:23,674 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:38:23,674 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:38:23,674 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:38:23,721 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states. [2019-09-08 09:38:23,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 09:38:23,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:23,757 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 09:38:23,759 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:23,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:23,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1367025055, now seen corresponding path program 1 times [2019-09-08 09:38:23,768 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:23,768 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:23,825 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:23,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:24,508 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 09:38:24,510 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:24,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:24,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:24,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:24,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:24,533 INFO L87 Difference]: Start difference. First operand 382 states. Second operand 3 states. [2019-09-08 09:38:24,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:24,824 INFO L93 Difference]: Finished difference Result 698 states and 1240 transitions. [2019-09-08 09:38:24,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:24,826 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-09-08 09:38:24,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:24,846 INFO L225 Difference]: With dead ends: 698 [2019-09-08 09:38:24,846 INFO L226 Difference]: Without dead ends: 572 [2019-09-08 09:38:24,850 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 09:38:24,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-09-08 09:38:24,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 570. [2019-09-08 09:38:24,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-09-08 09:38:24,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 838 transitions. [2019-09-08 09:38:24,957 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 838 transitions. Word has length 143 [2019-09-08 09:38:24,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:24,958 INFO L475 AbstractCegarLoop]: Abstraction has 570 states and 838 transitions. [2019-09-08 09:38:24,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 838 transitions. [2019-09-08 09:38:24,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-09-08 09:38:24,961 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:24,962 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 09:38:24,962 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:24,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:24,963 INFO L82 PathProgramCache]: Analyzing trace with hash 1366686431, now seen corresponding path program 1 times [2019-09-08 09:38:24,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:24,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:24,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:24,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:25,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:25,338 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 09:38:25,339 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:25,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:25,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:25,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:25,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:25,343 INFO L87 Difference]: Start difference. First operand 570 states and 838 transitions. Second operand 4 states. [2019-09-08 09:38:25,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:25,517 INFO L93 Difference]: Finished difference Result 1660 states and 2437 transitions. [2019-09-08 09:38:25,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:25,518 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 143 [2019-09-08 09:38:25,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:25,526 INFO L225 Difference]: With dead ends: 1660 [2019-09-08 09:38:25,527 INFO L226 Difference]: Without dead ends: 1103 [2019-09-08 09:38:25,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:38:25,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1103 states. [2019-09-08 09:38:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1103 to 1067. [2019-09-08 09:38:25,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1067 states. [2019-09-08 09:38:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1564 transitions. [2019-09-08 09:38:25,648 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1564 transitions. Word has length 143 [2019-09-08 09:38:25,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:25,648 INFO L475 AbstractCegarLoop]: Abstraction has 1067 states and 1564 transitions. [2019-09-08 09:38:25,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:25,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1564 transitions. [2019-09-08 09:38:25,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-09-08 09:38:25,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:25,652 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 09:38:25,653 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:25,653 INFO L82 PathProgramCache]: Analyzing trace with hash 280277689, now seen corresponding path program 1 times [2019-09-08 09:38:25,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:25,654 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:25,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:25,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:25,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:25,736 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 09:38:25,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:25,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:25,738 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:25,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:25,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:25,739 INFO L87 Difference]: Start difference. First operand 1067 states and 1564 transitions. Second operand 3 states. [2019-09-08 09:38:25,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:25,842 INFO L93 Difference]: Finished difference Result 3155 states and 4622 transitions. [2019-09-08 09:38:25,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:25,843 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 144 [2019-09-08 09:38:25,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:25,856 INFO L225 Difference]: With dead ends: 3155 [2019-09-08 09:38:25,857 INFO L226 Difference]: Without dead ends: 2120 [2019-09-08 09:38:25,860 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 09:38:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2120 states. [2019-09-08 09:38:25,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2120 to 1069. [2019-09-08 09:38:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-09-08 09:38:25,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1566 transitions. [2019-09-08 09:38:25,941 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1566 transitions. Word has length 144 [2019-09-08 09:38:25,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:25,941 INFO L475 AbstractCegarLoop]: Abstraction has 1069 states and 1566 transitions. [2019-09-08 09:38:25,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:25,942 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1566 transitions. [2019-09-08 09:38:25,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 09:38:25,945 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:25,946 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, 1] [2019-09-08 09:38:25,946 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:25,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:25,947 INFO L82 PathProgramCache]: Analyzing trace with hash 421615650, now seen corresponding path program 1 times [2019-09-08 09:38:25,947 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:25,947 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:25,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:25,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:26,083 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 09:38:26,084 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:26,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:26,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:26,086 INFO L87 Difference]: Start difference. First operand 1069 states and 1566 transitions. Second operand 3 states. [2019-09-08 09:38:26,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:26,307 INFO L93 Difference]: Finished difference Result 2957 states and 4347 transitions. [2019-09-08 09:38:26,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:26,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-09-08 09:38:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:26,324 INFO L225 Difference]: With dead ends: 2957 [2019-09-08 09:38:26,324 INFO L226 Difference]: Without dead ends: 2070 [2019-09-08 09:38:26,326 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 09:38:26,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2070 states. [2019-09-08 09:38:26,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2070 to 2034. [2019-09-08 09:38:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2034 states. [2019-09-08 09:38:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2034 states to 2034 states and 2962 transitions. [2019-09-08 09:38:26,440 INFO L78 Accepts]: Start accepts. Automaton has 2034 states and 2962 transitions. Word has length 145 [2019-09-08 09:38:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:26,440 INFO L475 AbstractCegarLoop]: Abstraction has 2034 states and 2962 transitions. [2019-09-08 09:38:26,441 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:26,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2034 states and 2962 transitions. [2019-09-08 09:38:26,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 09:38:26,446 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:26,446 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, 1] [2019-09-08 09:38:26,447 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:26,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:26,447 INFO L82 PathProgramCache]: Analyzing trace with hash 526087461, now seen corresponding path program 1 times [2019-09-08 09:38:26,447 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:26,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:26,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:26,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:26,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:26,653 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 09:38:26,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:26,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:26,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:26,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:26,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:26,655 INFO L87 Difference]: Start difference. First operand 2034 states and 2962 transitions. Second operand 4 states. [2019-09-08 09:38:26,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:26,764 INFO L93 Difference]: Finished difference Result 3424 states and 4997 transitions. [2019-09-08 09:38:26,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:26,764 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 145 [2019-09-08 09:38:26,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:26,772 INFO L225 Difference]: With dead ends: 3424 [2019-09-08 09:38:26,773 INFO L226 Difference]: Without dead ends: 1562 [2019-09-08 09:38:26,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:38:26,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-09-08 09:38:26,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1562. [2019-09-08 09:38:26,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1562 states. [2019-09-08 09:38:26,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2262 transitions. [2019-09-08 09:38:26,865 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2262 transitions. Word has length 145 [2019-09-08 09:38:26,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:26,866 INFO L475 AbstractCegarLoop]: Abstraction has 1562 states and 2262 transitions. [2019-09-08 09:38:26,866 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:26,866 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2262 transitions. [2019-09-08 09:38:26,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 09:38:26,870 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:26,871 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:26,871 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:26,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:26,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1901734011, now seen corresponding path program 1 times [2019-09-08 09:38:26,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:26,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:26,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:26,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:26,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:27,162 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 09:38:27,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:27,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:38:27,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:38:27,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:38:27,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:38:27,164 INFO L87 Difference]: Start difference. First operand 1562 states and 2262 transitions. Second operand 5 states. [2019-09-08 09:38:27,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:27,727 INFO L93 Difference]: Finished difference Result 3853 states and 5655 transitions. [2019-09-08 09:38:27,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:38:27,728 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 151 [2019-09-08 09:38:27,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:27,746 INFO L225 Difference]: With dead ends: 3853 [2019-09-08 09:38:27,747 INFO L226 Difference]: Without dead ends: 2462 [2019-09-08 09:38:27,755 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:38:27,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2462 states. [2019-09-08 09:38:27,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2462 to 2460. [2019-09-08 09:38:27,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2460 states. [2019-09-08 09:38:27,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2460 states to 2460 states and 3574 transitions. [2019-09-08 09:38:27,967 INFO L78 Accepts]: Start accepts. Automaton has 2460 states and 3574 transitions. Word has length 151 [2019-09-08 09:38:27,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:27,971 INFO L475 AbstractCegarLoop]: Abstraction has 2460 states and 3574 transitions. [2019-09-08 09:38:27,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:38:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2460 states and 3574 transitions. [2019-09-08 09:38:27,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 09:38:27,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:27,982 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:27,983 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:27,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:27,983 INFO L82 PathProgramCache]: Analyzing trace with hash 409413755, now seen corresponding path program 1 times [2019-09-08 09:38:27,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:27,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:27,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:27,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:27,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:28,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:28,263 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 09:38:28,264 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:28,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:28,264 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:28,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:28,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:28,266 INFO L87 Difference]: Start difference. First operand 2460 states and 3574 transitions. Second operand 4 states. [2019-09-08 09:38:28,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:28,715 INFO L93 Difference]: Finished difference Result 5282 states and 7907 transitions. [2019-09-08 09:38:28,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:28,715 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 09:38:28,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:28,737 INFO L225 Difference]: With dead ends: 5282 [2019-09-08 09:38:28,737 INFO L226 Difference]: Without dead ends: 4296 [2019-09-08 09:38:28,741 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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 09:38:28,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4296 states. [2019-09-08 09:38:29,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4296 to 4294. [2019-09-08 09:38:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4294 states. [2019-09-08 09:38:29,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4294 states to 4294 states and 6270 transitions. [2019-09-08 09:38:29,113 INFO L78 Accepts]: Start accepts. Automaton has 4294 states and 6270 transitions. Word has length 151 [2019-09-08 09:38:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:29,114 INFO L475 AbstractCegarLoop]: Abstraction has 4294 states and 6270 transitions. [2019-09-08 09:38:29,114 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:29,114 INFO L276 IsEmpty]: Start isEmpty. Operand 4294 states and 6270 transitions. [2019-09-08 09:38:29,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 09:38:29,126 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:29,126 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, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:29,127 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:29,128 INFO L82 PathProgramCache]: Analyzing trace with hash -1545001486, now seen corresponding path program 1 times [2019-09-08 09:38:29,128 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:29,128 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:29,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:29,130 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:29,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:29,373 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 09:38:29,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:29,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:29,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:29,376 INFO L87 Difference]: Start difference. First operand 4294 states and 6270 transitions. Second operand 4 states. [2019-09-08 09:38:29,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:29,955 INFO L93 Difference]: Finished difference Result 11175 states and 16293 transitions. [2019-09-08 09:38:29,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:29,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 151 [2019-09-08 09:38:29,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:29,993 INFO L225 Difference]: With dead ends: 11175 [2019-09-08 09:38:29,993 INFO L226 Difference]: Without dead ends: 6904 [2019-09-08 09:38:30,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:38:30,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6904 states. [2019-09-08 09:38:30,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6904 to 6874. [2019-09-08 09:38:30,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6874 states. [2019-09-08 09:38:30,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6874 states to 6874 states and 9916 transitions. [2019-09-08 09:38:30,480 INFO L78 Accepts]: Start accepts. Automaton has 6874 states and 9916 transitions. Word has length 151 [2019-09-08 09:38:30,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:30,480 INFO L475 AbstractCegarLoop]: Abstraction has 6874 states and 9916 transitions. [2019-09-08 09:38:30,480 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:30,480 INFO L276 IsEmpty]: Start isEmpty. Operand 6874 states and 9916 transitions. [2019-09-08 09:38:30,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:38:30,492 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:30,492 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:30,492 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:30,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:30,493 INFO L82 PathProgramCache]: Analyzing trace with hash 749367939, now seen corresponding path program 1 times [2019-09-08 09:38:30,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:30,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:30,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:30,494 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:30,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:30,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 09:38:30,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:30,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:30,617 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:30,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:30,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:30,618 INFO L87 Difference]: Start difference. First operand 6874 states and 9916 transitions. Second operand 3 states. [2019-09-08 09:38:31,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:31,185 INFO L93 Difference]: Finished difference Result 18278 states and 26303 transitions. [2019-09-08 09:38:31,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:31,185 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-09-08 09:38:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:31,245 INFO L225 Difference]: With dead ends: 18278 [2019-09-08 09:38:31,245 INFO L226 Difference]: Without dead ends: 11763 [2019-09-08 09:38:31,264 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 09:38:31,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11763 states. [2019-09-08 09:38:32,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11763 to 11737. [2019-09-08 09:38:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11737 states. [2019-09-08 09:38:32,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11737 states to 11737 states and 16643 transitions. [2019-09-08 09:38:32,040 INFO L78 Accepts]: Start accepts. Automaton has 11737 states and 16643 transitions. Word has length 153 [2019-09-08 09:38:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:32,040 INFO L475 AbstractCegarLoop]: Abstraction has 11737 states and 16643 transitions. [2019-09-08 09:38:32,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:32,040 INFO L276 IsEmpty]: Start isEmpty. Operand 11737 states and 16643 transitions. [2019-09-08 09:38:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 09:38:32,059 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:32,060 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:32,060 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash -758283962, now seen corresponding path program 1 times [2019-09-08 09:38:32,061 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:32,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:32,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:32,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:32,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:32,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:32,207 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 09:38:32,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:32,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:32,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:32,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:32,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:32,209 INFO L87 Difference]: Start difference. First operand 11737 states and 16643 transitions. Second operand 4 states. [2019-09-08 09:38:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:33,121 INFO L93 Difference]: Finished difference Result 19621 states and 27864 transitions. [2019-09-08 09:38:33,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:33,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 153 [2019-09-08 09:38:33,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:33,145 INFO L225 Difference]: With dead ends: 19621 [2019-09-08 09:38:33,145 INFO L226 Difference]: Without dead ends: 10715 [2019-09-08 09:38:33,163 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:38:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10715 states. [2019-09-08 09:38:33,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10715 to 10715. [2019-09-08 09:38:33,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10715 states. [2019-09-08 09:38:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10715 states to 10715 states and 15226 transitions. [2019-09-08 09:38:33,737 INFO L78 Accepts]: Start accepts. Automaton has 10715 states and 15226 transitions. Word has length 153 [2019-09-08 09:38:33,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:33,738 INFO L475 AbstractCegarLoop]: Abstraction has 10715 states and 15226 transitions. [2019-09-08 09:38:33,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:33,739 INFO L276 IsEmpty]: Start isEmpty. Operand 10715 states and 15226 transitions. [2019-09-08 09:38:33,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 09:38:33,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:33,756 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:33,757 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:33,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:33,757 INFO L82 PathProgramCache]: Analyzing trace with hash 806407937, now seen corresponding path program 1 times [2019-09-08 09:38:33,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:33,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:33,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:33,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:33,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:33,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:34,114 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 09:38:34,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:34,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:38:34,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:38:34,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:38:34,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:38:34,116 INFO L87 Difference]: Start difference. First operand 10715 states and 15226 transitions. Second operand 8 states. [2019-09-08 09:38:35,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:35,598 INFO L93 Difference]: Finished difference Result 22207 states and 33303 transitions. [2019-09-08 09:38:35,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 09:38:35,599 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-09-08 09:38:35,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:35,636 INFO L225 Difference]: With dead ends: 22207 [2019-09-08 09:38:35,637 INFO L226 Difference]: Without dead ends: 17569 [2019-09-08 09:38:35,650 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:38:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17569 states. [2019-09-08 09:38:36,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17569 to 16970. [2019-09-08 09:38:36,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16970 states. [2019-09-08 09:38:36,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16970 states to 16970 states and 24854 transitions. [2019-09-08 09:38:36,418 INFO L78 Accepts]: Start accepts. Automaton has 16970 states and 24854 transitions. Word has length 159 [2019-09-08 09:38:36,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:36,418 INFO L475 AbstractCegarLoop]: Abstraction has 16970 states and 24854 transitions. [2019-09-08 09:38:36,418 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:38:36,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16970 states and 24854 transitions. [2019-09-08 09:38:36,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 09:38:36,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:36,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:38:36,440 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:36,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:36,441 INFO L82 PathProgramCache]: Analyzing trace with hash -991704476, now seen corresponding path program 1 times [2019-09-08 09:38:36,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:36,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:36,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:36,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:36,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:36,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:36,695 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 09:38:36,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:36,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:36,696 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:36,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:36,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:36,698 INFO L87 Difference]: Start difference. First operand 16970 states and 24854 transitions. Second operand 4 states. [2019-09-08 09:38:38,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:38,607 INFO L93 Difference]: Finished difference Result 49667 states and 72598 transitions. [2019-09-08 09:38:38,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:38,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-09-08 09:38:38,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:38,667 INFO L225 Difference]: With dead ends: 49667 [2019-09-08 09:38:38,667 INFO L226 Difference]: Without dead ends: 32740 [2019-09-08 09:38:38,702 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:38:38,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32740 states. [2019-09-08 09:38:40,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32740 to 32684. [2019-09-08 09:38:40,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-09-08 09:38:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47291 transitions. [2019-09-08 09:38:40,155 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47291 transitions. Word has length 159 [2019-09-08 09:38:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:40,156 INFO L475 AbstractCegarLoop]: Abstraction has 32684 states and 47291 transitions. [2019-09-08 09:38:40,156 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47291 transitions. [2019-09-08 09:38:40,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-08 09:38:40,189 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:40,189 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:40,190 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:40,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:40,190 INFO L82 PathProgramCache]: Analyzing trace with hash 1237700668, now seen corresponding path program 1 times [2019-09-08 09:38:40,190 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:40,190 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:40,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:40,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:40,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:40,256 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 09:38:40,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:40,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:40,257 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:40,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:40,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:40,258 INFO L87 Difference]: Start difference. First operand 32684 states and 47291 transitions. Second operand 3 states. [2019-09-08 09:38:43,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:43,451 INFO L93 Difference]: Finished difference Result 97858 states and 141624 transitions. [2019-09-08 09:38:43,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:43,451 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 160 [2019-09-08 09:38:43,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:43,557 INFO L225 Difference]: With dead ends: 97858 [2019-09-08 09:38:43,557 INFO L226 Difference]: Without dead ends: 65280 [2019-09-08 09:38:43,612 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 09:38:43,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65280 states. [2019-09-08 09:38:45,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65280 to 32690. [2019-09-08 09:38:45,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32690 states. [2019-09-08 09:38:45,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32690 states to 32690 states and 47297 transitions. [2019-09-08 09:38:45,534 INFO L78 Accepts]: Start accepts. Automaton has 32690 states and 47297 transitions. Word has length 160 [2019-09-08 09:38:45,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:45,534 INFO L475 AbstractCegarLoop]: Abstraction has 32690 states and 47297 transitions. [2019-09-08 09:38:45,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 32690 states and 47297 transitions. [2019-09-08 09:38:45,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 09:38:45,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:45,559 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:45,560 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:45,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:45,560 INFO L82 PathProgramCache]: Analyzing trace with hash -1310746621, now seen corresponding path program 1 times [2019-09-08 09:38:45,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:45,560 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:45,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:45,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:45,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:45,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:45,695 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 09:38:45,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:45,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:45,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:45,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:45,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:45,697 INFO L87 Difference]: Start difference. First operand 32690 states and 47297 transitions. Second operand 4 states. [2019-09-08 09:38:47,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:47,193 INFO L93 Difference]: Finished difference Result 65338 states and 94538 transitions. [2019-09-08 09:38:47,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:47,193 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 161 [2019-09-08 09:38:47,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:47,245 INFO L225 Difference]: With dead ends: 65338 [2019-09-08 09:38:47,246 INFO L226 Difference]: Without dead ends: 32684 [2019-09-08 09:38:47,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:38:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32684 states. [2019-09-08 09:38:49,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32684 to 32684. [2019-09-08 09:38:49,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32684 states. [2019-09-08 09:38:49,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32684 states to 32684 states and 47285 transitions. [2019-09-08 09:38:49,722 INFO L78 Accepts]: Start accepts. Automaton has 32684 states and 47285 transitions. Word has length 161 [2019-09-08 09:38:49,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:49,722 INFO L475 AbstractCegarLoop]: Abstraction has 32684 states and 47285 transitions. [2019-09-08 09:38:49,722 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:38:49,722 INFO L276 IsEmpty]: Start isEmpty. Operand 32684 states and 47285 transitions. [2019-09-08 09:38:49,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-09-08 09:38:49,737 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:49,738 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:38:49,738 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:49,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:49,738 INFO L82 PathProgramCache]: Analyzing trace with hash 948664643, now seen corresponding path program 1 times [2019-09-08 09:38:49,738 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:49,739 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:49,740 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:49,740 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:49,832 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 09:38:49,833 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:49,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:38:49,833 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:38:49,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:38:49,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:38:49,834 INFO L87 Difference]: Start difference. First operand 32684 states and 47285 transitions. Second operand 3 states. [2019-09-08 09:38:51,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:51,928 INFO L93 Difference]: Finished difference Result 80670 states and 116554 transitions. [2019-09-08 09:38:51,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:38:51,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-09-08 09:38:51,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:51,979 INFO L225 Difference]: With dead ends: 80670 [2019-09-08 09:38:51,980 INFO L226 Difference]: Without dead ends: 48670 [2019-09-08 09:38:52,013 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 09:38:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48670 states. [2019-09-08 09:38:54,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48670 to 48614. [2019-09-08 09:38:54,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48614 states. [2019-09-08 09:38:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48614 states to 48614 states and 69220 transitions. [2019-09-08 09:38:54,296 INFO L78 Accepts]: Start accepts. Automaton has 48614 states and 69220 transitions. Word has length 161 [2019-09-08 09:38:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:54,296 INFO L475 AbstractCegarLoop]: Abstraction has 48614 states and 69220 transitions. [2019-09-08 09:38:54,296 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 48614 states and 69220 transitions. [2019-09-08 09:38:54,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:38:54,314 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:54,314 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, 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 09:38:54,314 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:54,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:54,315 INFO L82 PathProgramCache]: Analyzing trace with hash -168137185, now seen corresponding path program 1 times [2019-09-08 09:38:54,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:54,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:54,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:54,316 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:54,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:54,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:54,536 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 09:38:54,538 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:54,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 09:38:54,539 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:38:54,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:38:54,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:38:54,540 INFO L87 Difference]: Start difference. First operand 48614 states and 69220 transitions. Second operand 8 states. [2019-09-08 09:38:57,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:38:57,347 INFO L93 Difference]: Finished difference Result 70734 states and 103796 transitions. [2019-09-08 09:38:57,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:38:57,347 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2019-09-08 09:38:57,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:38:57,388 INFO L225 Difference]: With dead ends: 70734 [2019-09-08 09:38:57,388 INFO L226 Difference]: Without dead ends: 41845 [2019-09-08 09:38:57,414 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:38:57,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41845 states. [2019-09-08 09:38:59,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41845 to 41843. [2019-09-08 09:38:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41843 states. [2019-09-08 09:38:59,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41843 states to 41843 states and 58299 transitions. [2019-09-08 09:38:59,322 INFO L78 Accepts]: Start accepts. Automaton has 41843 states and 58299 transitions. Word has length 167 [2019-09-08 09:38:59,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:59,323 INFO L475 AbstractCegarLoop]: Abstraction has 41843 states and 58299 transitions. [2019-09-08 09:38:59,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:38:59,323 INFO L276 IsEmpty]: Start isEmpty. Operand 41843 states and 58299 transitions. [2019-09-08 09:38:59,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 09:38:59,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:59,343 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, 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 09:38:59,343 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:59,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:59,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1796903089, now seen corresponding path program 1 times [2019-09-08 09:38:59,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:59,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:59,345 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:59,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:59,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:59,518 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 09:38:59,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:38:59,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:38:59,519 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:38:59,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:38:59,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:38:59,520 INFO L87 Difference]: Start difference. First operand 41843 states and 58299 transitions. Second operand 4 states. [2019-09-08 09:39:01,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:01,303 INFO L93 Difference]: Finished difference Result 79133 states and 110183 transitions. [2019-09-08 09:39:01,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:01,304 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-08 09:39:01,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:01,353 INFO L225 Difference]: With dead ends: 79133 [2019-09-08 09:39:01,353 INFO L226 Difference]: Without dead ends: 37572 [2019-09-08 09:39:01,392 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:39:01,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37572 states. [2019-09-08 09:39:03,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37572 to 37509. [2019-09-08 09:39:03,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37509 states. [2019-09-08 09:39:03,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37509 states to 37509 states and 52140 transitions. [2019-09-08 09:39:03,378 INFO L78 Accepts]: Start accepts. Automaton has 37509 states and 52140 transitions. Word has length 167 [2019-09-08 09:39:03,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:03,378 INFO L475 AbstractCegarLoop]: Abstraction has 37509 states and 52140 transitions. [2019-09-08 09:39:03,378 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:03,378 INFO L276 IsEmpty]: Start isEmpty. Operand 37509 states and 52140 transitions. [2019-09-08 09:39:03,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:39:03,399 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:03,399 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, 1, 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 09:39:03,399 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:03,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:03,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1194193912, now seen corresponding path program 1 times [2019-09-08 09:39:03,400 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:03,400 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:03,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:03,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:03,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:03,476 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 09:39:03,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:03,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:03,477 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:03,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:03,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:03,477 INFO L87 Difference]: Start difference. First operand 37509 states and 52140 transitions. Second operand 3 states. [2019-09-08 09:39:07,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:07,607 INFO L93 Difference]: Finished difference Result 101426 states and 142645 transitions. [2019-09-08 09:39:07,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:07,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 169 [2019-09-08 09:39:07,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:07,690 INFO L225 Difference]: With dead ends: 101426 [2019-09-08 09:39:07,691 INFO L226 Difference]: Without dead ends: 70260 [2019-09-08 09:39:07,726 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 09:39:07,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70260 states. [2019-09-08 09:39:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70260 to 70204. [2019-09-08 09:39:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70204 states. [2019-09-08 09:39:12,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70204 states to 70204 states and 97422 transitions. [2019-09-08 09:39:12,342 INFO L78 Accepts]: Start accepts. Automaton has 70204 states and 97422 transitions. Word has length 169 [2019-09-08 09:39:12,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:12,342 INFO L475 AbstractCegarLoop]: Abstraction has 70204 states and 97422 transitions. [2019-09-08 09:39:12,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:12,343 INFO L276 IsEmpty]: Start isEmpty. Operand 70204 states and 97422 transitions. [2019-09-08 09:39:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:39:12,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:12,374 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, 1, 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 09:39:12,374 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:12,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:12,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1892232456, now seen corresponding path program 1 times [2019-09-08 09:39:12,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:12,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:12,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:12,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:12,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:12,673 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 09:39:12,674 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:12,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 09:39:12,675 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 09:39:12,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 09:39:12,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:39:12,676 INFO L87 Difference]: Start difference. First operand 70204 states and 97422 transitions. Second operand 9 states. [2019-09-08 09:39:16,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:16,440 INFO L93 Difference]: Finished difference Result 97277 states and 139010 transitions. [2019-09-08 09:39:16,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:16,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 169 [2019-09-08 09:39:16,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:16,502 INFO L225 Difference]: With dead ends: 97277 [2019-09-08 09:39:16,502 INFO L226 Difference]: Without dead ends: 60942 [2019-09-08 09:39:16,539 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:39:16,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60942 states. [2019-09-08 09:39:20,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60942 to 38753. [2019-09-08 09:39:20,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38753 states. [2019-09-08 09:39:20,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38753 states to 38753 states and 50778 transitions. [2019-09-08 09:39:20,351 INFO L78 Accepts]: Start accepts. Automaton has 38753 states and 50778 transitions. Word has length 169 [2019-09-08 09:39:20,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:20,352 INFO L475 AbstractCegarLoop]: Abstraction has 38753 states and 50778 transitions. [2019-09-08 09:39:20,352 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 09:39:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 38753 states and 50778 transitions. [2019-09-08 09:39:20,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2019-09-08 09:39:20,377 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:20,377 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, 1, 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 09:39:20,377 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:20,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:20,378 INFO L82 PathProgramCache]: Analyzing trace with hash 602422408, now seen corresponding path program 1 times [2019-09-08 09:39:20,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:20,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:20,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:20,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:20,553 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 09:39:20,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:20,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:20,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:20,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:20,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:20,554 INFO L87 Difference]: Start difference. First operand 38753 states and 50778 transitions. Second operand 4 states. [2019-09-08 09:39:22,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:22,904 INFO L93 Difference]: Finished difference Result 77604 states and 101672 transitions. [2019-09-08 09:39:22,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:22,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 169 [2019-09-08 09:39:22,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:22,937 INFO L225 Difference]: With dead ends: 77604 [2019-09-08 09:39:22,938 INFO L226 Difference]: Without dead ends: 39006 [2019-09-08 09:39:22,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:39:22,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39006 states. [2019-09-08 09:39:24,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39006 to 38866. [2019-09-08 09:39:24,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38866 states. [2019-09-08 09:39:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38866 states to 38866 states and 50895 transitions. [2019-09-08 09:39:24,822 INFO L78 Accepts]: Start accepts. Automaton has 38866 states and 50895 transitions. Word has length 169 [2019-09-08 09:39:24,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:24,822 INFO L475 AbstractCegarLoop]: Abstraction has 38866 states and 50895 transitions. [2019-09-08 09:39:24,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:24,822 INFO L276 IsEmpty]: Start isEmpty. Operand 38866 states and 50895 transitions. [2019-09-08 09:39:24,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 09:39:24,844 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:24,845 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, 1, 1, 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 09:39:24,845 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash 727382620, now seen corresponding path program 1 times [2019-09-08 09:39:24,845 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:24,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:24,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:24,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:24,847 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:24,904 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 09:39:24,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:24,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:24,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:24,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:24,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:24,906 INFO L87 Difference]: Start difference. First operand 38866 states and 50895 transitions. Second operand 3 states. [2019-09-08 09:39:28,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:28,803 INFO L93 Difference]: Finished difference Result 106727 states and 139837 transitions. [2019-09-08 09:39:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:28,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 09:39:28,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:28,889 INFO L225 Difference]: With dead ends: 106727 [2019-09-08 09:39:28,890 INFO L226 Difference]: Without dead ends: 77527 [2019-09-08 09:39:28,922 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 09:39:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77527 states. [2019-09-08 09:39:31,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77527 to 38876. [2019-09-08 09:39:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38876 states. [2019-09-08 09:39:31,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38876 states to 38876 states and 50905 transitions. [2019-09-08 09:39:31,505 INFO L78 Accepts]: Start accepts. Automaton has 38876 states and 50905 transitions. Word has length 170 [2019-09-08 09:39:31,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:31,506 INFO L475 AbstractCegarLoop]: Abstraction has 38876 states and 50905 transitions. [2019-09-08 09:39:31,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:31,506 INFO L276 IsEmpty]: Start isEmpty. Operand 38876 states and 50905 transitions. [2019-09-08 09:39:31,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 09:39:31,526 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:31,527 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, 1, 1, 1, 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 09:39:31,527 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:31,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:31,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1710954686, now seen corresponding path program 1 times [2019-09-08 09:39:31,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:31,528 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:31,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:31,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:31,630 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 09:39:31,630 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:31,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:39:31,631 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:39:31,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:39:31,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:39:31,631 INFO L87 Difference]: Start difference. First operand 38876 states and 50905 transitions. Second operand 3 states. [2019-09-08 09:39:35,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:35,537 INFO L93 Difference]: Finished difference Result 90028 states and 119109 transitions. [2019-09-08 09:39:35,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:39:35,539 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 171 [2019-09-08 09:39:35,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:35,603 INFO L225 Difference]: With dead ends: 90028 [2019-09-08 09:39:35,603 INFO L226 Difference]: Without dead ends: 66224 [2019-09-08 09:39:35,628 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 09:39:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66224 states. [2019-09-08 09:39:40,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66224 to 65248. [2019-09-08 09:39:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65248 states. [2019-09-08 09:39:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65248 states to 65248 states and 85179 transitions. [2019-09-08 09:39:40,575 INFO L78 Accepts]: Start accepts. Automaton has 65248 states and 85179 transitions. Word has length 171 [2019-09-08 09:39:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:40,575 INFO L475 AbstractCegarLoop]: Abstraction has 65248 states and 85179 transitions. [2019-09-08 09:39:40,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:39:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 65248 states and 85179 transitions. [2019-09-08 09:39:40,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 09:39:40,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:40,608 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, 1, 1, 1, 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 09:39:40,608 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:40,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1415908071, now seen corresponding path program 1 times [2019-09-08 09:39:40,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:40,609 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:40,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:40,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:40,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:40,719 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 09:39:40,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:40,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:39:40,720 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:39:40,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:39:40,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:39:40,721 INFO L87 Difference]: Start difference. First operand 65248 states and 85179 transitions. Second operand 5 states. [2019-09-08 09:39:43,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:43,890 INFO L93 Difference]: Finished difference Result 106571 states and 141040 transitions. [2019-09-08 09:39:43,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:39:43,890 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-09-08 09:39:43,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:43,956 INFO L225 Difference]: With dead ends: 106571 [2019-09-08 09:39:43,956 INFO L226 Difference]: Without dead ends: 45105 [2019-09-08 09:39:44,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:39:44,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45105 states. [2019-09-08 09:39:46,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45105 to 35358. [2019-09-08 09:39:46,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35358 states. [2019-09-08 09:39:46,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35358 states to 35358 states and 45666 transitions. [2019-09-08 09:39:46,940 INFO L78 Accepts]: Start accepts. Automaton has 35358 states and 45666 transitions. Word has length 171 [2019-09-08 09:39:46,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:46,941 INFO L475 AbstractCegarLoop]: Abstraction has 35358 states and 45666 transitions. [2019-09-08 09:39:46,941 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:39:46,941 INFO L276 IsEmpty]: Start isEmpty. Operand 35358 states and 45666 transitions. [2019-09-08 09:39:46,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 09:39:46,957 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:46,957 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, 1, 1, 1, 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 09:39:46,957 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:46,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:46,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1811002905, now seen corresponding path program 1 times [2019-09-08 09:39:46,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:46,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:46,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:46,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:46,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:47,112 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 09:39:47,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:47,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:47,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:47,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:47,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:47,114 INFO L87 Difference]: Start difference. First operand 35358 states and 45666 transitions. Second operand 4 states. [2019-09-08 09:39:49,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:49,424 INFO L93 Difference]: Finished difference Result 70845 states and 91463 transitions. [2019-09-08 09:39:49,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:49,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-08 09:39:49,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:49,467 INFO L225 Difference]: With dead ends: 70845 [2019-09-08 09:39:49,467 INFO L226 Difference]: Without dead ends: 35782 [2019-09-08 09:39:49,494 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 09:39:49,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35782 states. [2019-09-08 09:39:51,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35782 to 35590. [2019-09-08 09:39:51,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35590 states. [2019-09-08 09:39:51,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35590 states to 35590 states and 45900 transitions. [2019-09-08 09:39:51,858 INFO L78 Accepts]: Start accepts. Automaton has 35590 states and 45900 transitions. Word has length 171 [2019-09-08 09:39:51,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:51,858 INFO L475 AbstractCegarLoop]: Abstraction has 35590 states and 45900 transitions. [2019-09-08 09:39:51,858 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:51,858 INFO L276 IsEmpty]: Start isEmpty. Operand 35590 states and 45900 transitions. [2019-09-08 09:39:51,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-09-08 09:39:51,876 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:51,877 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, 1, 1, 1, 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 09:39:51,877 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:51,877 INFO L82 PathProgramCache]: Analyzing trace with hash 537625127, now seen corresponding path program 1 times [2019-09-08 09:39:51,877 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:51,877 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:51,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:51,878 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:51,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:51,996 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 09:39:51,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:51,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:39:51,997 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:39:51,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:39:51,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:39:51,998 INFO L87 Difference]: Start difference. First operand 35590 states and 45900 transitions. Second operand 4 states. [2019-09-08 09:39:53,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:39:53,801 INFO L93 Difference]: Finished difference Result 51709 states and 66731 transitions. [2019-09-08 09:39:53,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:39:53,801 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 171 [2019-09-08 09:39:53,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:39:53,831 INFO L225 Difference]: With dead ends: 51709 [2019-09-08 09:39:53,832 INFO L226 Difference]: Without dead ends: 32689 [2019-09-08 09:39:53,850 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 09:39:53,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32689 states. [2019-09-08 09:39:55,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32689 to 32686. [2019-09-08 09:39:55,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32686 states. [2019-09-08 09:39:55,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32686 states to 32686 states and 42146 transitions. [2019-09-08 09:39:55,932 INFO L78 Accepts]: Start accepts. Automaton has 32686 states and 42146 transitions. Word has length 171 [2019-09-08 09:39:55,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:39:55,933 INFO L475 AbstractCegarLoop]: Abstraction has 32686 states and 42146 transitions. [2019-09-08 09:39:55,933 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:39:55,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32686 states and 42146 transitions. [2019-09-08 09:39:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:39:55,948 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:39:55,949 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, 1, 1, 1, 1, 1, 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 09:39:55,949 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:39:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:39:55,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1047066544, now seen corresponding path program 1 times [2019-09-08 09:39:55,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:39:55,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:39:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:55,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:39:55,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:39:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:39:57,560 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 09:39:57,560 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:39:57,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-09-08 09:39:57,561 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-09-08 09:39:57,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-09-08 09:39:57,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=638, Unknown=0, NotChecked=0, Total=702 [2019-09-08 09:39:57,562 INFO L87 Difference]: Start difference. First operand 32686 states and 42146 transitions. Second operand 27 states. [2019-09-08 09:39:58,437 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-09-08 09:39:58,823 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 47 [2019-09-08 09:39:59,007 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:39:59,385 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 09:39:59,697 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-09-08 09:39:59,899 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 39 [2019-09-08 09:40:00,979 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-08 09:40:01,520 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 09:40:01,794 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2019-09-08 09:40:02,312 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 09:40:02,705 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-09-08 09:40:03,023 WARN L188 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 09:40:03,241 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 09:40:03,771 WARN L188 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2019-09-08 09:40:04,078 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 09:40:04,509 WARN L188 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 09:40:04,716 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2019-09-08 09:40:05,110 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 09:40:05,319 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 50 [2019-09-08 09:40:05,489 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-09-08 09:40:05,671 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2019-09-08 09:40:06,461 WARN L188 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 09:40:06,664 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 53 [2019-09-08 09:40:06,939 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2019-09-08 09:40:07,512 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 09:40:07,841 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-09-08 09:40:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:10,164 INFO L93 Difference]: Finished difference Result 38989 states and 49599 transitions. [2019-09-08 09:40:10,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 09:40:10,164 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 173 [2019-09-08 09:40:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:10,200 INFO L225 Difference]: With dead ends: 38989 [2019-09-08 09:40:10,200 INFO L226 Difference]: Without dead ends: 38983 [2019-09-08 09:40:10,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 755 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=981, Invalid=3441, Unknown=0, NotChecked=0, Total=4422 [2019-09-08 09:40:10,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38983 states. [2019-09-08 09:40:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38983 to 34639. [2019-09-08 09:40:12,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34639 states. [2019-09-08 09:40:12,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34639 states to 34639 states and 44444 transitions. [2019-09-08 09:40:12,605 INFO L78 Accepts]: Start accepts. Automaton has 34639 states and 44444 transitions. Word has length 173 [2019-09-08 09:40:12,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:12,606 INFO L475 AbstractCegarLoop]: Abstraction has 34639 states and 44444 transitions. [2019-09-08 09:40:12,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-09-08 09:40:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 34639 states and 44444 transitions. [2019-09-08 09:40:12,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:40:12,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:12,625 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, 1, 1, 1, 1, 1, 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 09:40:12,626 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:12,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:12,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1447149304, now seen corresponding path program 1 times [2019-09-08 09:40:12,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:12,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:12,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:12,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:12,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:12,902 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 09:40:12,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:12,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 09:40:12,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 09:40:12,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 09:40:12,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:40:12,904 INFO L87 Difference]: Start difference. First operand 34639 states and 44444 transitions. Second operand 11 states. [2019-09-08 09:40:15,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:15,108 INFO L93 Difference]: Finished difference Result 54810 states and 71411 transitions. [2019-09-08 09:40:15,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:40:15,109 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 173 [2019-09-08 09:40:15,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:15,132 INFO L225 Difference]: With dead ends: 54810 [2019-09-08 09:40:15,133 INFO L226 Difference]: Without dead ends: 24152 [2019-09-08 09:40:15,151 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:40:15,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24152 states. [2019-09-08 09:40:16,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24152 to 20012. [2019-09-08 09:40:16,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20012 states. [2019-09-08 09:40:16,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 25297 transitions. [2019-09-08 09:40:16,456 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 25297 transitions. Word has length 173 [2019-09-08 09:40:16,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:16,456 INFO L475 AbstractCegarLoop]: Abstraction has 20012 states and 25297 transitions. [2019-09-08 09:40:16,457 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 09:40:16,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 25297 transitions. [2019-09-08 09:40:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:40:16,467 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:16,467 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, 1, 1, 1, 1, 1, 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 09:40:16,468 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:16,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:16,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1679713453, now seen corresponding path program 1 times [2019-09-08 09:40:16,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:16,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:16,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:18,251 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 09:40:18,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:18,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:40:18,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:40:18,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:40:18,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:40:18,253 INFO L87 Difference]: Start difference. First operand 20012 states and 25297 transitions. Second operand 26 states. [2019-09-08 09:40:18,530 WARN L188 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-09-08 09:40:18,795 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-09-08 09:40:19,567 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-09-08 09:40:19,770 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 47 [2019-09-08 09:40:19,948 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2019-09-08 09:40:20,195 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 09:40:20,424 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-09-08 09:40:20,601 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-09-08 09:40:21,008 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-09-08 09:40:21,218 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-08 09:40:21,377 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 36 [2019-09-08 09:40:21,659 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 09:40:22,128 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:40:22,414 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-09-08 09:40:23,313 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2019-09-08 09:40:23,513 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 09:40:23,849 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2019-09-08 09:40:24,193 WARN L188 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 64 [2019-09-08 09:40:24,550 WARN L188 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-09-08 09:40:24,987 WARN L188 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 09:40:25,303 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 52 [2019-09-08 09:40:25,513 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 09:40:25,688 WARN L188 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 45 [2019-09-08 09:40:25,916 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 53 [2019-09-08 09:40:26,196 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 09:40:26,398 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 32 [2019-09-08 09:40:26,932 WARN L188 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 09:40:27,329 WARN L188 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-09-08 09:40:27,700 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 42 [2019-09-08 09:40:28,038 WARN L188 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 09:40:28,233 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 39 [2019-09-08 09:40:29,043 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 38 [2019-09-08 09:40:29,485 WARN L188 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:40:29,676 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 43 [2019-09-08 09:40:30,433 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 30 [2019-09-08 09:40:30,822 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 42 [2019-09-08 09:40:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:32,960 INFO L93 Difference]: Finished difference Result 36455 states and 48401 transitions. [2019-09-08 09:40:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-09-08 09:40:32,961 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 173 [2019-09-08 09:40:32,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:32,992 INFO L225 Difference]: With dead ends: 36455 [2019-09-08 09:40:32,992 INFO L226 Difference]: Without dead ends: 33539 [2019-09-08 09:40:33,003 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1340 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=847, Invalid=4409, Unknown=0, NotChecked=0, Total=5256 [2019-09-08 09:40:33,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33539 states. [2019-09-08 09:40:34,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33539 to 21685. [2019-09-08 09:40:34,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21685 states. [2019-09-08 09:40:34,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21685 states to 21685 states and 27229 transitions. [2019-09-08 09:40:34,854 INFO L78 Accepts]: Start accepts. Automaton has 21685 states and 27229 transitions. Word has length 173 [2019-09-08 09:40:34,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:34,854 INFO L475 AbstractCegarLoop]: Abstraction has 21685 states and 27229 transitions. [2019-09-08 09:40:34,855 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:40:34,855 INFO L276 IsEmpty]: Start isEmpty. Operand 21685 states and 27229 transitions. [2019-09-08 09:40:34,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:40:34,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:34,866 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, 1, 1, 1, 1, 1, 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 09:40:34,866 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:34,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:34,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1593773061, now seen corresponding path program 1 times [2019-09-08 09:40:34,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:34,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:34,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:34,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:34,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:34,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:36,052 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 09:40:36,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:36,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 09:40:36,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 09:40:36,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 09:40:36,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2019-09-08 09:40:36,054 INFO L87 Difference]: Start difference. First operand 21685 states and 27229 transitions. Second operand 24 states. [2019-09-08 09:40:37,789 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 09:40:38,401 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-08 09:40:38,633 WARN L188 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 60 [2019-09-08 09:40:39,175 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-09-08 09:40:44,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:44,001 INFO L93 Difference]: Finished difference Result 30326 states and 39432 transitions. [2019-09-08 09:40:44,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 09:40:44,002 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 173 [2019-09-08 09:40:44,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:44,028 INFO L225 Difference]: With dead ends: 30326 [2019-09-08 09:40:44,028 INFO L226 Difference]: Without dead ends: 28966 [2019-09-08 09:40:44,036 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=316, Invalid=1166, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 09:40:44,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28966 states. [2019-09-08 09:40:45,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28966 to 22912. [2019-09-08 09:40:45,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22912 states. [2019-09-08 09:40:45,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22912 states to 22912 states and 28672 transitions. [2019-09-08 09:40:45,993 INFO L78 Accepts]: Start accepts. Automaton has 22912 states and 28672 transitions. Word has length 173 [2019-09-08 09:40:45,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:45,993 INFO L475 AbstractCegarLoop]: Abstraction has 22912 states and 28672 transitions. [2019-09-08 09:40:45,993 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 09:40:45,993 INFO L276 IsEmpty]: Start isEmpty. Operand 22912 states and 28672 transitions. [2019-09-08 09:40:46,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:40:46,008 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:46,008 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, 1, 1, 1, 1, 1, 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 09:40:46,008 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:46,008 INFO L82 PathProgramCache]: Analyzing trace with hash 735237155, now seen corresponding path program 1 times [2019-09-08 09:40:46,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:46,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:46,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:46,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:46,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:46,561 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 09:40:46,561 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:46,561 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:40:46,562 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:40:46,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:40:46,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:40:46,562 INFO L87 Difference]: Start difference. First operand 22912 states and 28672 transitions. Second operand 16 states. [2019-09-08 09:40:47,560 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 30 [2019-09-08 09:40:55,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:40:55,229 INFO L93 Difference]: Finished difference Result 52345 states and 69525 transitions. [2019-09-08 09:40:55,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-08 09:40:55,229 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-09-08 09:40:55,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:40:55,273 INFO L225 Difference]: With dead ends: 52345 [2019-09-08 09:40:55,273 INFO L226 Difference]: Without dead ends: 47149 [2019-09-08 09:40:55,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 697 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=519, Invalid=2031, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 09:40:55,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47149 states. [2019-09-08 09:40:57,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47149 to 29156. [2019-09-08 09:40:57,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29156 states. [2019-09-08 09:40:57,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29156 states to 29156 states and 35975 transitions. [2019-09-08 09:40:57,982 INFO L78 Accepts]: Start accepts. Automaton has 29156 states and 35975 transitions. Word has length 173 [2019-09-08 09:40:57,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:40:57,982 INFO L475 AbstractCegarLoop]: Abstraction has 29156 states and 35975 transitions. [2019-09-08 09:40:57,983 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:40:57,983 INFO L276 IsEmpty]: Start isEmpty. Operand 29156 states and 35975 transitions. [2019-09-08 09:40:58,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:40:58,001 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:40:58,001 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, 1, 1, 1, 1, 1, 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 09:40:58,002 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:40:58,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:40:58,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1330854134, now seen corresponding path program 1 times [2019-09-08 09:40:58,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:40:58,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:40:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:58,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:40:58,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:40:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:40:58,526 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 09:40:58,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:40:58,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 09:40:58,527 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 09:40:58,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 09:40:58,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-08 09:40:58,527 INFO L87 Difference]: Start difference. First operand 29156 states and 35975 transitions. Second operand 14 states. [2019-09-08 09:41:05,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:05,193 INFO L93 Difference]: Finished difference Result 54046 states and 67944 transitions. [2019-09-08 09:41:05,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 09:41:05,194 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 173 [2019-09-08 09:41:05,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:05,244 INFO L225 Difference]: With dead ends: 54046 [2019-09-08 09:41:05,244 INFO L226 Difference]: Without dead ends: 49988 [2019-09-08 09:41:05,262 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=591, Unknown=0, NotChecked=0, Total=812 [2019-09-08 09:41:05,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49988 states. [2019-09-08 09:41:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49988 to 38200. [2019-09-08 09:41:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38200 states. [2019-09-08 09:41:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38200 states to 38200 states and 46264 transitions. [2019-09-08 09:41:09,167 INFO L78 Accepts]: Start accepts. Automaton has 38200 states and 46264 transitions. Word has length 173 [2019-09-08 09:41:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:09,167 INFO L475 AbstractCegarLoop]: Abstraction has 38200 states and 46264 transitions. [2019-09-08 09:41:09,167 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 09:41:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 38200 states and 46264 transitions. [2019-09-08 09:41:09,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:41:09,194 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:09,194 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, 1, 1, 1, 1, 1, 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 09:41:09,194 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:09,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:09,195 INFO L82 PathProgramCache]: Analyzing trace with hash -850431912, now seen corresponding path program 1 times [2019-09-08 09:41:09,195 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:09,195 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:09,196 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:09,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:09,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:09,393 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 09:41:09,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:09,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 09:41:09,394 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 09:41:09,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 09:41:09,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-09-08 09:41:09,394 INFO L87 Difference]: Start difference. First operand 38200 states and 46264 transitions. Second operand 10 states. [2019-09-08 09:41:13,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:13,242 INFO L93 Difference]: Finished difference Result 48280 states and 59563 transitions. [2019-09-08 09:41:13,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:41:13,243 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2019-09-08 09:41:13,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:13,278 INFO L225 Difference]: With dead ends: 48280 [2019-09-08 09:41:13,278 INFO L226 Difference]: Without dead ends: 38200 [2019-09-08 09:41:13,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-09-08 09:41:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38200 states. [2019-09-08 09:41:17,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38200 to 38200. [2019-09-08 09:41:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38200 states. [2019-09-08 09:41:17,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38200 states to 38200 states and 46046 transitions. [2019-09-08 09:41:17,254 INFO L78 Accepts]: Start accepts. Automaton has 38200 states and 46046 transitions. Word has length 173 [2019-09-08 09:41:17,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:17,254 INFO L475 AbstractCegarLoop]: Abstraction has 38200 states and 46046 transitions. [2019-09-08 09:41:17,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 09:41:17,255 INFO L276 IsEmpty]: Start isEmpty. Operand 38200 states and 46046 transitions. [2019-09-08 09:41:17,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:41:17,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:17,281 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, 1, 1, 1, 1, 1, 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 09:41:17,281 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:17,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:17,281 INFO L82 PathProgramCache]: Analyzing trace with hash -276349507, now seen corresponding path program 1 times [2019-09-08 09:41:17,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:17,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:17,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:17,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:17,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:18,295 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 09:41:18,295 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:18,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-09-08 09:41:18,296 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-09-08 09:41:18,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-09-08 09:41:18,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=417, Unknown=0, NotChecked=0, Total=462 [2019-09-08 09:41:18,297 INFO L87 Difference]: Start difference. First operand 38200 states and 46046 transitions. Second operand 22 states. [2019-09-08 09:41:19,245 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 43 [2019-09-08 09:41:19,415 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-08 09:41:19,673 WARN L188 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 49 [2019-09-08 09:41:19,911 WARN L188 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2019-09-08 09:41:20,207 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 09:41:20,508 WARN L188 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 09:41:20,727 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 52 [2019-09-08 09:41:21,375 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2019-09-08 09:41:21,662 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 09:41:22,108 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-09-08 09:41:22,367 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 09:41:24,102 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 09:41:24,374 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 09:41:24,688 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 09:41:24,963 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 09:41:25,784 WARN L188 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 09:41:26,012 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 09:41:26,258 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 57 [2019-09-08 09:41:26,562 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 09:41:26,768 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 47 [2019-09-08 09:41:26,987 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 49 [2019-09-08 09:41:27,245 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 09:41:27,685 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-09-08 09:41:28,041 WARN L188 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 61 [2019-09-08 09:41:28,276 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 60 [2019-09-08 09:41:32,213 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-08 09:41:32,643 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 35 [2019-09-08 09:41:33,500 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 09:41:33,741 WARN L188 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 09:41:33,999 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 39 [2019-09-08 09:41:35,373 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 37 [2019-09-08 09:41:37,297 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 35 [2019-09-08 09:41:37,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:37,601 INFO L93 Difference]: Finished difference Result 58999 states and 75457 transitions. [2019-09-08 09:41:37,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-09-08 09:41:37,601 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 173 [2019-09-08 09:41:37,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:37,657 INFO L225 Difference]: With dead ends: 58999 [2019-09-08 09:41:37,657 INFO L226 Difference]: Without dead ends: 57197 [2019-09-08 09:41:37,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1047, Invalid=4355, Unknown=0, NotChecked=0, Total=5402 [2019-09-08 09:41:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57197 states. [2019-09-08 09:41:42,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57197 to 39160. [2019-09-08 09:41:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39160 states. [2019-09-08 09:41:42,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39160 states to 39160 states and 47149 transitions. [2019-09-08 09:41:42,073 INFO L78 Accepts]: Start accepts. Automaton has 39160 states and 47149 transitions. Word has length 173 [2019-09-08 09:41:42,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:42,073 INFO L475 AbstractCegarLoop]: Abstraction has 39160 states and 47149 transitions. [2019-09-08 09:41:42,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-09-08 09:41:42,074 INFO L276 IsEmpty]: Start isEmpty. Operand 39160 states and 47149 transitions. [2019-09-08 09:41:42,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:41:42,103 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:42,103 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, 1, 1, 1, 1, 1, 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 09:41:42,103 INFO L418 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:42,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:42,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1603629849, now seen corresponding path program 1 times [2019-09-08 09:41:42,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:42,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:42,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:42,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:42,434 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 09:41:42,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:42,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-09-08 09:41:42,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-08 09:41:42,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-08 09:41:42,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-09-08 09:41:42,436 INFO L87 Difference]: Start difference. First operand 39160 states and 47149 transitions. Second operand 13 states. [2019-09-08 09:41:49,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:49,716 INFO L93 Difference]: Finished difference Result 60585 states and 73985 transitions. [2019-09-08 09:41:49,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-08 09:41:49,716 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 173 [2019-09-08 09:41:49,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:49,769 INFO L225 Difference]: With dead ends: 60585 [2019-09-08 09:41:49,769 INFO L226 Difference]: Without dead ends: 57193 [2019-09-08 09:41:49,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=648, Unknown=0, NotChecked=0, Total=870 [2019-09-08 09:41:49,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57193 states. [2019-09-08 09:41:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57193 to 43366. [2019-09-08 09:41:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43366 states. [2019-09-08 09:41:54,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43366 states to 43366 states and 52068 transitions. [2019-09-08 09:41:54,523 INFO L78 Accepts]: Start accepts. Automaton has 43366 states and 52068 transitions. Word has length 173 [2019-09-08 09:41:54,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:41:54,523 INFO L475 AbstractCegarLoop]: Abstraction has 43366 states and 52068 transitions. [2019-09-08 09:41:54,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-08 09:41:54,524 INFO L276 IsEmpty]: Start isEmpty. Operand 43366 states and 52068 transitions. [2019-09-08 09:41:54,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:41:54,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:41:54,554 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, 1, 1, 1, 1, 1, 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 09:41:54,554 INFO L418 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:41:54,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:41:54,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1204149033, now seen corresponding path program 1 times [2019-09-08 09:41:54,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:41:54,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:41:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:54,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:41:54,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:41:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:41:55,860 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 09:41:55,860 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:41:55,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 09:41:55,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 09:41:55,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 09:41:55,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=455, Unknown=0, NotChecked=0, Total=506 [2019-09-08 09:41:55,861 INFO L87 Difference]: Start difference. First operand 43366 states and 52068 transitions. Second operand 23 states. [2019-09-08 09:41:57,279 WARN L188 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 42 [2019-09-08 09:41:58,629 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 36 [2019-09-08 09:42:08,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:08,946 INFO L93 Difference]: Finished difference Result 60273 states and 72572 transitions. [2019-09-08 09:42:08,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-09-08 09:42:08,947 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 173 [2019-09-08 09:42:08,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:08,993 INFO L225 Difference]: With dead ends: 60273 [2019-09-08 09:42:08,993 INFO L226 Difference]: Without dead ends: 58220 [2019-09-08 09:42:09,006 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 437 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=541, Invalid=2215, Unknown=0, NotChecked=0, Total=2756 [2019-09-08 09:42:09,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58220 states. [2019-09-08 09:42:14,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58220 to 46536. [2019-09-08 09:42:14,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46536 states. [2019-09-08 09:42:14,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46536 states to 46536 states and 55698 transitions. [2019-09-08 09:42:14,206 INFO L78 Accepts]: Start accepts. Automaton has 46536 states and 55698 transitions. Word has length 173 [2019-09-08 09:42:14,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:14,206 INFO L475 AbstractCegarLoop]: Abstraction has 46536 states and 55698 transitions. [2019-09-08 09:42:14,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 09:42:14,206 INFO L276 IsEmpty]: Start isEmpty. Operand 46536 states and 55698 transitions. [2019-09-08 09:42:14,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:42:14,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:14,239 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, 1, 1, 1, 1, 1, 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 09:42:14,239 INFO L418 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:14,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:14,239 INFO L82 PathProgramCache]: Analyzing trace with hash 1861921895, now seen corresponding path program 1 times [2019-09-08 09:42:14,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:14,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:14,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:14,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:14,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:14,653 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 09:42:14,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:14,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:42:14,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:42:14,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:42:14,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:42:14,655 INFO L87 Difference]: Start difference. First operand 46536 states and 55698 transitions. Second operand 16 states. [2019-09-08 09:42:28,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:28,938 INFO L93 Difference]: Finished difference Result 97750 states and 121228 transitions. [2019-09-08 09:42:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 09:42:28,938 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 173 [2019-09-08 09:42:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:29,013 INFO L225 Difference]: With dead ends: 97750 [2019-09-08 09:42:29,013 INFO L226 Difference]: Without dead ends: 93221 [2019-09-08 09:42:29,029 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=363, Invalid=969, Unknown=0, NotChecked=0, Total=1332 [2019-09-08 09:42:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93221 states. [2019-09-08 09:42:36,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93221 to 60995. [2019-09-08 09:42:36,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60995 states. [2019-09-08 09:42:36,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60995 states to 60995 states and 72151 transitions. [2019-09-08 09:42:36,716 INFO L78 Accepts]: Start accepts. Automaton has 60995 states and 72151 transitions. Word has length 173 [2019-09-08 09:42:36,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:42:36,716 INFO L475 AbstractCegarLoop]: Abstraction has 60995 states and 72151 transitions. [2019-09-08 09:42:36,716 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:42:36,716 INFO L276 IsEmpty]: Start isEmpty. Operand 60995 states and 72151 transitions. [2019-09-08 09:42:36,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:42:36,760 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:42:36,760 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, 1, 1, 1, 1, 1, 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 09:42:36,760 INFO L418 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:42:36,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:42:36,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1389461213, now seen corresponding path program 1 times [2019-09-08 09:42:36,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:42:36,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:42:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:36,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:42:36,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:42:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:42:37,815 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 09:42:37,816 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:42:37,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 09:42:37,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 09:42:37,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 09:42:37,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=367, Unknown=0, NotChecked=0, Total=420 [2019-09-08 09:42:37,819 INFO L87 Difference]: Start difference. First operand 60995 states and 72151 transitions. Second operand 21 states. [2019-09-08 09:42:38,074 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 84 [2019-09-08 09:42:38,326 WARN L188 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-09-08 09:42:40,556 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 44 [2019-09-08 09:42:42,418 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-09-08 09:42:42,573 WARN L188 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:42:42,834 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 09:42:43,010 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-09-08 09:42:46,042 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 63 [2019-09-08 09:42:46,265 WARN L188 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 09:42:46,614 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-09-08 09:42:46,853 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 68 [2019-09-08 09:42:47,159 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-08 09:42:47,351 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 56 [2019-09-08 09:42:50,496 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 47 [2019-09-08 09:42:50,669 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 57 [2019-09-08 09:42:51,642 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-08 09:42:51,822 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:42:56,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:42:56,251 INFO L93 Difference]: Finished difference Result 79470 states and 94049 transitions. [2019-09-08 09:42:56,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-09-08 09:42:56,252 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2019-09-08 09:42:56,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:42:56,314 INFO L225 Difference]: With dead ends: 79470 [2019-09-08 09:42:56,315 INFO L226 Difference]: Without dead ends: 77313 [2019-09-08 09:42:56,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=764, Invalid=3396, Unknown=0, NotChecked=0, Total=4160 [2019-09-08 09:42:56,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77313 states. [2019-09-08 09:43:04,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77313 to 66172. [2019-09-08 09:43:04,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66172 states. [2019-09-08 09:43:04,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66172 states to 66172 states and 78103 transitions. [2019-09-08 09:43:04,730 INFO L78 Accepts]: Start accepts. Automaton has 66172 states and 78103 transitions. Word has length 173 [2019-09-08 09:43:04,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:04,730 INFO L475 AbstractCegarLoop]: Abstraction has 66172 states and 78103 transitions. [2019-09-08 09:43:04,730 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 09:43:04,731 INFO L276 IsEmpty]: Start isEmpty. Operand 66172 states and 78103 transitions. [2019-09-08 09:43:04,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:43:04,781 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:04,781 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, 1, 1, 1, 1, 1, 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 09:43:04,782 INFO L418 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:04,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:04,782 INFO L82 PathProgramCache]: Analyzing trace with hash 356207466, now seen corresponding path program 1 times [2019-09-08 09:43:04,782 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:04,782 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:04,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:04,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:05,298 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 09:43:05,298 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:05,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:43:05,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:43:05,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:43:05,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:43:05,300 INFO L87 Difference]: Start difference. First operand 66172 states and 78103 transitions. Second operand 17 states. [2019-09-08 09:43:22,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:22,250 INFO L93 Difference]: Finished difference Result 119794 states and 141809 transitions. [2019-09-08 09:43:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:43:22,251 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 173 [2019-09-08 09:43:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:22,351 INFO L225 Difference]: With dead ends: 119794 [2019-09-08 09:43:22,351 INFO L226 Difference]: Without dead ends: 116055 [2019-09-08 09:43:22,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 09:43:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116055 states. [2019-09-08 09:43:35,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116055 to 91955. [2019-09-08 09:43:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91955 states. [2019-09-08 09:43:35,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91955 states to 91955 states and 107585 transitions. [2019-09-08 09:43:35,944 INFO L78 Accepts]: Start accepts. Automaton has 91955 states and 107585 transitions. Word has length 173 [2019-09-08 09:43:35,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:43:35,944 INFO L475 AbstractCegarLoop]: Abstraction has 91955 states and 107585 transitions. [2019-09-08 09:43:35,944 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:43:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 91955 states and 107585 transitions. [2019-09-08 09:43:36,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:43:36,009 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:43:36,009 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, 1, 1, 1, 1, 1, 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 09:43:36,009 INFO L418 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:43:36,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:43:36,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1911185901, now seen corresponding path program 1 times [2019-09-08 09:43:36,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:43:36,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:43:36,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,010 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:43:36,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:43:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:43:37,358 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 26 [2019-09-08 09:43:38,020 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 09:43:38,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:43:38,021 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:43:38,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:43:38,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:43:38,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:43:38,021 INFO L87 Difference]: Start difference. First operand 91955 states and 107585 transitions. Second operand 26 states. [2019-09-08 09:43:38,770 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 50 [2019-09-08 09:43:38,969 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2019-09-08 09:43:39,598 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-09-08 09:43:39,873 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 09:43:40,829 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 09:43:56,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:43:56,426 INFO L93 Difference]: Finished difference Result 108428 states and 127406 transitions. [2019-09-08 09:43:56,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 09:43:56,427 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 173 [2019-09-08 09:43:56,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:43:56,511 INFO L225 Difference]: With dead ends: 108428 [2019-09-08 09:43:56,511 INFO L226 Difference]: Without dead ends: 101947 [2019-09-08 09:43:56,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 243 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=411, Invalid=1481, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 09:43:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101947 states. [2019-09-08 09:44:09,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101947 to 91023. [2019-09-08 09:44:09,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91023 states. [2019-09-08 09:44:10,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91023 states to 91023 states and 106430 transitions. [2019-09-08 09:44:10,049 INFO L78 Accepts]: Start accepts. Automaton has 91023 states and 106430 transitions. Word has length 173 [2019-09-08 09:44:10,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:10,049 INFO L475 AbstractCegarLoop]: Abstraction has 91023 states and 106430 transitions. [2019-09-08 09:44:10,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:44:10,049 INFO L276 IsEmpty]: Start isEmpty. Operand 91023 states and 106430 transitions. [2019-09-08 09:44:10,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:44:10,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:10,111 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, 1, 1, 1, 1, 1, 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 09:44:10,111 INFO L418 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:10,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:10,112 INFO L82 PathProgramCache]: Analyzing trace with hash -1827630506, now seen corresponding path program 1 times [2019-09-08 09:44:10,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:10,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:10,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:10,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:10,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:10,869 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-09-08 09:44:11,599 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 09:44:11,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:11,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:44:11,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:44:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:44:11,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=573, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:44:11,601 INFO L87 Difference]: Start difference. First operand 91023 states and 106430 transitions. Second operand 26 states. [2019-09-08 09:44:12,326 WARN L188 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-09-08 09:44:12,601 WARN L188 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-09-08 09:44:13,302 WARN L188 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-09-08 09:44:13,839 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 09:44:16,715 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 09:44:18,079 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 44 [2019-09-08 09:44:19,995 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 36 [2019-09-08 09:44:22,252 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2019-09-08 09:44:22,685 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 46 [2019-09-08 09:44:23,139 WARN L188 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 53 [2019-09-08 09:44:26,695 WARN L188 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 52 [2019-09-08 09:44:29,039 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 51 [2019-09-08 09:44:33,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:44:33,360 INFO L93 Difference]: Finished difference Result 107886 states and 128257 transitions. [2019-09-08 09:44:33,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-09-08 09:44:33,360 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 173 [2019-09-08 09:44:33,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:44:33,446 INFO L225 Difference]: With dead ends: 107886 [2019-09-08 09:44:33,447 INFO L226 Difference]: Without dead ends: 106407 [2019-09-08 09:44:33,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=470, Invalid=1980, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 09:44:33,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106407 states. [2019-09-08 09:44:45,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106407 to 93367. [2019-09-08 09:44:45,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93367 states. [2019-09-08 09:44:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93367 states to 93367 states and 109109 transitions. [2019-09-08 09:44:45,646 INFO L78 Accepts]: Start accepts. Automaton has 93367 states and 109109 transitions. Word has length 173 [2019-09-08 09:44:45,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:44:45,646 INFO L475 AbstractCegarLoop]: Abstraction has 93367 states and 109109 transitions. [2019-09-08 09:44:45,646 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:44:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 93367 states and 109109 transitions. [2019-09-08 09:44:45,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2019-09-08 09:44:45,722 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:44:45,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:44:45,723 INFO L418 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:44:45,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:44:45,723 INFO L82 PathProgramCache]: Analyzing trace with hash -895749768, now seen corresponding path program 1 times [2019-09-08 09:44:45,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:44:45,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:44:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:45,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:44:45,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:44:45,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:44:46,715 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 09:44:46,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:44:46,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 09:44:46,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 09:44:46,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 09:44:46,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2019-09-08 09:44:46,717 INFO L87 Difference]: Start difference. First operand 93367 states and 109109 transitions. Second operand 21 states. [2019-09-08 09:44:55,105 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 39 [2019-09-08 09:44:57,465 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 41 [2019-09-08 09:44:57,868 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 47 [2019-09-08 09:44:58,265 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 44 [2019-09-08 09:45:06,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:06,737 INFO L93 Difference]: Finished difference Result 106446 states and 124386 transitions. [2019-09-08 09:45:06,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-09-08 09:45:06,737 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 173 [2019-09-08 09:45:06,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:06,839 INFO L225 Difference]: With dead ends: 106446 [2019-09-08 09:45:06,839 INFO L226 Difference]: Without dead ends: 105792 [2019-09-08 09:45:06,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=609, Invalid=1841, Unknown=0, NotChecked=0, Total=2450 [2019-09-08 09:45:06,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105792 states. [2019-09-08 09:45:18,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105792 to 94911. [2019-09-08 09:45:18,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94911 states. [2019-09-08 09:45:18,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94911 states to 94911 states and 110900 transitions. [2019-09-08 09:45:18,781 INFO L78 Accepts]: Start accepts. Automaton has 94911 states and 110900 transitions. Word has length 173 [2019-09-08 09:45:18,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:18,782 INFO L475 AbstractCegarLoop]: Abstraction has 94911 states and 110900 transitions. [2019-09-08 09:45:18,782 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 09:45:18,782 INFO L276 IsEmpty]: Start isEmpty. Operand 94911 states and 110900 transitions. [2019-09-08 09:45:18,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:45:18,852 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:18,852 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, 1, 1, 1, 1, 1, 1, 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 09:45:18,852 INFO L418 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:18,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:18,853 INFO L82 PathProgramCache]: Analyzing trace with hash -907941184, now seen corresponding path program 1 times [2019-09-08 09:45:18,853 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:18,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:18,854 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:18,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:18,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:18,924 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 09:45:18,925 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:18,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:45:18,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:45:18,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:45:18,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:18,926 INFO L87 Difference]: Start difference. First operand 94911 states and 110900 transitions. Second operand 3 states. [2019-09-08 09:45:31,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:31,302 INFO L93 Difference]: Finished difference Result 126974 states and 149021 transitions. [2019-09-08 09:45:31,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:45:31,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:45:31,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:31,370 INFO L225 Difference]: With dead ends: 126974 [2019-09-08 09:45:31,370 INFO L226 Difference]: Without dead ends: 81638 [2019-09-08 09:45:31,396 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 09:45:31,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81638 states. [2019-09-08 09:45:40,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81638 to 80513. [2019-09-08 09:45:40,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80513 states. [2019-09-08 09:45:40,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80513 states to 80513 states and 93424 transitions. [2019-09-08 09:45:40,957 INFO L78 Accepts]: Start accepts. Automaton has 80513 states and 93424 transitions. Word has length 174 [2019-09-08 09:45:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:40,957 INFO L475 AbstractCegarLoop]: Abstraction has 80513 states and 93424 transitions. [2019-09-08 09:45:40,957 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:45:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 80513 states and 93424 transitions. [2019-09-08 09:45:41,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:45:41,015 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:41,015 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, 1, 1, 1, 1, 1, 1, 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 09:45:41,016 INFO L418 AbstractCegarLoop]: === Iteration 43 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:41,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:41,016 INFO L82 PathProgramCache]: Analyzing trace with hash 917558432, now seen corresponding path program 1 times [2019-09-08 09:45:41,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:41,016 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:41,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:41,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:41,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:41,093 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 09:45:41,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:41,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:45:41,095 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:45:41,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:45:41,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:41,096 INFO L87 Difference]: Start difference. First operand 80513 states and 93424 transitions. Second operand 3 states. [2019-09-08 09:45:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:45:50,040 INFO L93 Difference]: Finished difference Result 119719 states and 139463 transitions. [2019-09-08 09:45:50,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:45:50,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:45:50,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:45:50,104 INFO L225 Difference]: With dead ends: 119719 [2019-09-08 09:45:50,104 INFO L226 Difference]: Without dead ends: 73672 [2019-09-08 09:45:50,134 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 09:45:50,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73672 states. [2019-09-08 09:45:58,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73672 to 73568. [2019-09-08 09:45:58,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73568 states. [2019-09-08 09:45:58,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73568 states to 73568 states and 84978 transitions. [2019-09-08 09:45:58,949 INFO L78 Accepts]: Start accepts. Automaton has 73568 states and 84978 transitions. Word has length 174 [2019-09-08 09:45:58,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:45:58,949 INFO L475 AbstractCegarLoop]: Abstraction has 73568 states and 84978 transitions. [2019-09-08 09:45:58,949 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:45:58,949 INFO L276 IsEmpty]: Start isEmpty. Operand 73568 states and 84978 transitions. [2019-09-08 09:45:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:45:59,003 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:45:59,003 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, 1, 1, 1, 1, 1, 1, 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 09:45:59,003 INFO L418 AbstractCegarLoop]: === Iteration 44 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:45:59,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:45:59,003 INFO L82 PathProgramCache]: Analyzing trace with hash -2117960819, now seen corresponding path program 1 times [2019-09-08 09:45:59,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:45:59,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:45:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:59,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:45:59,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:45:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:45:59,065 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 09:45:59,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:45:59,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:45:59,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:45:59,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:45:59,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:45:59,066 INFO L87 Difference]: Start difference. First operand 73568 states and 84978 transitions. Second operand 3 states. [2019-09-08 09:46:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:08,266 INFO L93 Difference]: Finished difference Result 100976 states and 117934 transitions. [2019-09-08 09:46:08,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:08,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:46:08,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:08,333 INFO L225 Difference]: With dead ends: 100976 [2019-09-08 09:46:08,333 INFO L226 Difference]: Without dead ends: 64741 [2019-09-08 09:46:08,365 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 09:46:08,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64741 states. [2019-09-08 09:46:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64741 to 62740. [2019-09-08 09:46:15,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62740 states. [2019-09-08 09:46:15,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62740 states to 62740 states and 72220 transitions. [2019-09-08 09:46:15,822 INFO L78 Accepts]: Start accepts. Automaton has 62740 states and 72220 transitions. Word has length 174 [2019-09-08 09:46:15,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:15,822 INFO L475 AbstractCegarLoop]: Abstraction has 62740 states and 72220 transitions. [2019-09-08 09:46:15,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:15,822 INFO L276 IsEmpty]: Start isEmpty. Operand 62740 states and 72220 transitions. [2019-09-08 09:46:15,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:46:15,866 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:15,866 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, 1, 1, 1, 1, 1, 1, 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 09:46:15,866 INFO L418 AbstractCegarLoop]: === Iteration 45 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:15,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:15,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1751435957, now seen corresponding path program 1 times [2019-09-08 09:46:15,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:15,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:15,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:15,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:15,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:15,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:15,963 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 09:46:15,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:15,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:15,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:15,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:15,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:15,965 INFO L87 Difference]: Start difference. First operand 62740 states and 72220 transitions. Second operand 3 states. [2019-09-08 09:46:23,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:23,380 INFO L93 Difference]: Finished difference Result 72288 states and 83270 transitions. [2019-09-08 09:46:23,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:23,381 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:46:23,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:23,438 INFO L225 Difference]: With dead ends: 72288 [2019-09-08 09:46:23,439 INFO L226 Difference]: Without dead ends: 62654 [2019-09-08 09:46:23,455 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 09:46:23,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62654 states. [2019-09-08 09:46:30,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62654 to 62464. [2019-09-08 09:46:30,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62464 states. [2019-09-08 09:46:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62464 states to 62464 states and 71722 transitions. [2019-09-08 09:46:30,827 INFO L78 Accepts]: Start accepts. Automaton has 62464 states and 71722 transitions. Word has length 174 [2019-09-08 09:46:30,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:30,827 INFO L475 AbstractCegarLoop]: Abstraction has 62464 states and 71722 transitions. [2019-09-08 09:46:30,827 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 62464 states and 71722 transitions. [2019-09-08 09:46:30,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:46:30,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:30,869 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, 1, 1, 1, 1, 1, 1, 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 09:46:30,870 INFO L418 AbstractCegarLoop]: === Iteration 46 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:30,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:30,870 INFO L82 PathProgramCache]: Analyzing trace with hash 805067023, now seen corresponding path program 1 times [2019-09-08 09:46:30,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:30,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:30,871 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:30,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:30,934 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 09:46:30,934 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:30,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:30,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:30,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:30,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:30,936 INFO L87 Difference]: Start difference. First operand 62464 states and 71722 transitions. Second operand 3 states. [2019-09-08 09:46:38,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:38,126 INFO L93 Difference]: Finished difference Result 85686 states and 99592 transitions. [2019-09-08 09:46:38,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:38,126 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:46:38,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:38,168 INFO L225 Difference]: With dead ends: 85686 [2019-09-08 09:46:38,169 INFO L226 Difference]: Without dead ends: 48561 [2019-09-08 09:46:38,195 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 09:46:38,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-09-08 09:46:43,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 47575. [2019-09-08 09:46:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47575 states. [2019-09-08 09:46:43,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47575 states to 47575 states and 54568 transitions. [2019-09-08 09:46:43,685 INFO L78 Accepts]: Start accepts. Automaton has 47575 states and 54568 transitions. Word has length 174 [2019-09-08 09:46:43,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:43,685 INFO L475 AbstractCegarLoop]: Abstraction has 47575 states and 54568 transitions. [2019-09-08 09:46:43,685 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 47575 states and 54568 transitions. [2019-09-08 09:46:43,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:46:43,717 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:43,718 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, 1, 1, 1, 1, 1, 1, 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 09:46:43,718 INFO L418 AbstractCegarLoop]: === Iteration 47 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:43,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:43,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1327640188, now seen corresponding path program 1 times [2019-09-08 09:46:43,718 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:43,718 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:43,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:43,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:43,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:43,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:43,945 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 09:46:43,945 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:43,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:43,946 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:43,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:43,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:43,946 INFO L87 Difference]: Start difference. First operand 47575 states and 54568 transitions. Second operand 3 states. [2019-09-08 09:46:48,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:48,909 INFO L93 Difference]: Finished difference Result 71172 states and 81924 transitions. [2019-09-08 09:46:48,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:48,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:46:48,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:48,953 INFO L225 Difference]: With dead ends: 71172 [2019-09-08 09:46:48,953 INFO L226 Difference]: Without dead ends: 41950 [2019-09-08 09:46:48,978 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 09:46:49,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41950 states. [2019-09-08 09:46:53,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41950 to 41846. [2019-09-08 09:46:53,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41846 states. [2019-09-08 09:46:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41846 states to 41846 states and 47645 transitions. [2019-09-08 09:46:53,888 INFO L78 Accepts]: Start accepts. Automaton has 41846 states and 47645 transitions. Word has length 174 [2019-09-08 09:46:53,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:46:53,888 INFO L475 AbstractCegarLoop]: Abstraction has 41846 states and 47645 transitions. [2019-09-08 09:46:53,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:46:53,888 INFO L276 IsEmpty]: Start isEmpty. Operand 41846 states and 47645 transitions. [2019-09-08 09:46:53,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 09:46:53,916 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:46:53,916 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, 1, 1, 1, 1, 1, 1, 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 09:46:53,917 INFO L418 AbstractCegarLoop]: === Iteration 48 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:46:53,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:46:53,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1070119604, now seen corresponding path program 1 times [2019-09-08 09:46:53,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:46:53,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:46:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:53,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:46:53,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:46:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:46:53,970 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 09:46:53,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:46:53,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:46:53,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:46:53,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:46:53,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:46:53,971 INFO L87 Difference]: Start difference. First operand 41846 states and 47645 transitions. Second operand 3 states. [2019-09-08 09:46:57,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:46:57,783 INFO L93 Difference]: Finished difference Result 54617 states and 63629 transitions. [2019-09-08 09:46:57,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:46:57,783 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 09:46:57,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:46:57,812 INFO L225 Difference]: With dead ends: 54617 [2019-09-08 09:46:57,812 INFO L226 Difference]: Without dead ends: 29558 [2019-09-08 09:46:57,833 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 09:46:57,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29558 states. [2019-09-08 09:47:01,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29558 to 27808. [2019-09-08 09:47:01,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27808 states. [2019-09-08 09:47:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27808 states to 27808 states and 32088 transitions. [2019-09-08 09:47:01,137 INFO L78 Accepts]: Start accepts. Automaton has 27808 states and 32088 transitions. Word has length 174 [2019-09-08 09:47:01,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:01,137 INFO L475 AbstractCegarLoop]: Abstraction has 27808 states and 32088 transitions. [2019-09-08 09:47:01,137 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:01,137 INFO L276 IsEmpty]: Start isEmpty. Operand 27808 states and 32088 transitions. [2019-09-08 09:47:01,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:47:01,152 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:01,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:01,153 INFO L418 AbstractCegarLoop]: === Iteration 49 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:01,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:01,153 INFO L82 PathProgramCache]: Analyzing trace with hash 919617869, now seen corresponding path program 1 times [2019-09-08 09:47:01,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:01,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:01,223 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 09:47:01,224 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:01,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:01,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:01,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:01,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:01,225 INFO L87 Difference]: Start difference. First operand 27808 states and 32088 transitions. Second operand 3 states. [2019-09-08 09:47:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:04,816 INFO L93 Difference]: Finished difference Result 32517 states and 37728 transitions. [2019-09-08 09:47:04,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:04,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:47:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:04,839 INFO L225 Difference]: With dead ends: 32517 [2019-09-08 09:47:04,839 INFO L226 Difference]: Without dead ends: 25647 [2019-09-08 09:47:04,847 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 09:47:04,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25647 states. [2019-09-08 09:47:07,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25647 to 25523. [2019-09-08 09:47:07,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25523 states. [2019-09-08 09:47:07,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25523 states to 25523 states and 29482 transitions. [2019-09-08 09:47:07,650 INFO L78 Accepts]: Start accepts. Automaton has 25523 states and 29482 transitions. Word has length 178 [2019-09-08 09:47:07,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:07,650 INFO L475 AbstractCegarLoop]: Abstraction has 25523 states and 29482 transitions. [2019-09-08 09:47:07,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:07,651 INFO L276 IsEmpty]: Start isEmpty. Operand 25523 states and 29482 transitions. [2019-09-08 09:47:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:47:07,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:07,665 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:07,665 INFO L418 AbstractCegarLoop]: === Iteration 50 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:07,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:07,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1506331714, now seen corresponding path program 1 times [2019-09-08 09:47:07,665 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:07,665 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:07,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:07,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:07,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:07,733 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 09:47:07,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:07,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:07,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:07,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:07,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:07,735 INFO L87 Difference]: Start difference. First operand 25523 states and 29482 transitions. Second operand 3 states. [2019-09-08 09:47:10,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:10,676 INFO L93 Difference]: Finished difference Result 31102 states and 35923 transitions. [2019-09-08 09:47:10,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:10,677 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:47:10,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:10,703 INFO L225 Difference]: With dead ends: 31102 [2019-09-08 09:47:10,703 INFO L226 Difference]: Without dead ends: 25116 [2019-09-08 09:47:10,711 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 09:47:10,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25116 states. [2019-09-08 09:47:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25116 to 24979. [2019-09-08 09:47:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24979 states. [2019-09-08 09:47:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24979 states to 24979 states and 28715 transitions. [2019-09-08 09:47:13,546 INFO L78 Accepts]: Start accepts. Automaton has 24979 states and 28715 transitions. Word has length 178 [2019-09-08 09:47:13,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:13,546 INFO L475 AbstractCegarLoop]: Abstraction has 24979 states and 28715 transitions. [2019-09-08 09:47:13,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:13,546 INFO L276 IsEmpty]: Start isEmpty. Operand 24979 states and 28715 transitions. [2019-09-08 09:47:13,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:47:13,559 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:13,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:13,560 INFO L418 AbstractCegarLoop]: === Iteration 51 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:13,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:13,560 INFO L82 PathProgramCache]: Analyzing trace with hash 1596162818, now seen corresponding path program 1 times [2019-09-08 09:47:13,560 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:13,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:13,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:13,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:13,612 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 09:47:13,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:13,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:13,613 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:13,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:13,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:13,613 INFO L87 Difference]: Start difference. First operand 24979 states and 28715 transitions. Second operand 3 states. [2019-09-08 09:47:16,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:16,222 INFO L93 Difference]: Finished difference Result 29573 states and 34240 transitions. [2019-09-08 09:47:16,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:16,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:47:16,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:16,241 INFO L225 Difference]: With dead ends: 29573 [2019-09-08 09:47:16,241 INFO L226 Difference]: Without dead ends: 22606 [2019-09-08 09:47:16,248 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 09:47:16,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22606 states. [2019-09-08 09:47:18,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22606 to 22484. [2019-09-08 09:47:18,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22484 states. [2019-09-08 09:47:18,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22484 states to 22484 states and 25863 transitions. [2019-09-08 09:47:18,841 INFO L78 Accepts]: Start accepts. Automaton has 22484 states and 25863 transitions. Word has length 178 [2019-09-08 09:47:18,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:18,841 INFO L475 AbstractCegarLoop]: Abstraction has 22484 states and 25863 transitions. [2019-09-08 09:47:18,841 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:18,841 INFO L276 IsEmpty]: Start isEmpty. Operand 22484 states and 25863 transitions. [2019-09-08 09:47:18,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:47:18,855 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:18,855 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:18,855 INFO L418 AbstractCegarLoop]: === Iteration 52 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:18,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:18,856 INFO L82 PathProgramCache]: Analyzing trace with hash 1113812116, now seen corresponding path program 1 times [2019-09-08 09:47:18,856 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:18,856 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:18,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:18,857 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:18,857 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:18,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:18,907 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 09:47:18,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:18,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:18,907 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:18,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:18,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:18,908 INFO L87 Difference]: Start difference. First operand 22484 states and 25863 transitions. Second operand 3 states. [2019-09-08 09:47:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:21,404 INFO L93 Difference]: Finished difference Result 27140 states and 31331 transitions. [2019-09-08 09:47:21,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:21,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:47:21,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:21,421 INFO L225 Difference]: With dead ends: 27140 [2019-09-08 09:47:21,421 INFO L226 Difference]: Without dead ends: 21457 [2019-09-08 09:47:21,426 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 09:47:21,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-09-08 09:47:23,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 21410. [2019-09-08 09:47:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-09-08 09:47:23,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 24578 transitions. [2019-09-08 09:47:23,909 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 24578 transitions. Word has length 178 [2019-09-08 09:47:23,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:23,909 INFO L475 AbstractCegarLoop]: Abstraction has 21410 states and 24578 transitions. [2019-09-08 09:47:23,909 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:23,909 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 24578 transitions. [2019-09-08 09:47:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2019-09-08 09:47:23,919 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:23,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:23,920 INFO L418 AbstractCegarLoop]: === Iteration 53 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:23,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash -1213512267, now seen corresponding path program 1 times [2019-09-08 09:47:23,921 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:23,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:23,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:23,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:23,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:23,983 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 09:47:23,983 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:23,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:47:23,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:47:23,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:47:23,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:47:23,984 INFO L87 Difference]: Start difference. First operand 21410 states and 24578 transitions. Second operand 3 states. [2019-09-08 09:47:26,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:26,463 INFO L93 Difference]: Finished difference Result 27009 states and 31025 transitions. [2019-09-08 09:47:26,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:47:26,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 178 [2019-09-08 09:47:26,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:26,479 INFO L225 Difference]: With dead ends: 27009 [2019-09-08 09:47:26,480 INFO L226 Difference]: Without dead ends: 20963 [2019-09-08 09:47:26,484 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 09:47:26,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20963 states. [2019-09-08 09:47:28,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20963 to 20904. [2019-09-08 09:47:28,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20904 states. [2019-09-08 09:47:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20904 states to 20904 states and 23876 transitions. [2019-09-08 09:47:28,953 INFO L78 Accepts]: Start accepts. Automaton has 20904 states and 23876 transitions. Word has length 178 [2019-09-08 09:47:28,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:28,953 INFO L475 AbstractCegarLoop]: Abstraction has 20904 states and 23876 transitions. [2019-09-08 09:47:28,953 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:47:28,953 INFO L276 IsEmpty]: Start isEmpty. Operand 20904 states and 23876 transitions. [2019-09-08 09:47:28,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:47:28,964 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:28,964 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:28,964 INFO L418 AbstractCegarLoop]: === Iteration 54 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:28,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:28,965 INFO L82 PathProgramCache]: Analyzing trace with hash -898697782, now seen corresponding path program 1 times [2019-09-08 09:47:28,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:28,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:28,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:28,969 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:28,970 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:29,636 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 09:47:29,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:29,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-09-08 09:47:29,637 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-08 09:47:29,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-08 09:47:29,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=372, Unknown=0, NotChecked=0, Total=420 [2019-09-08 09:47:29,638 INFO L87 Difference]: Start difference. First operand 20904 states and 23876 transitions. Second operand 21 states. [2019-09-08 09:47:29,858 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 68 [2019-09-08 09:47:30,734 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 09:47:30,929 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-09-08 09:47:31,126 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 60 [2019-09-08 09:47:31,393 WARN L188 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 62 [2019-09-08 09:47:31,693 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 69 [2019-09-08 09:47:38,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:38,085 INFO L93 Difference]: Finished difference Result 23213 states and 26741 transitions. [2019-09-08 09:47:38,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 09:47:38,085 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 179 [2019-09-08 09:47:38,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:38,101 INFO L225 Difference]: With dead ends: 23213 [2019-09-08 09:47:38,102 INFO L226 Difference]: Without dead ends: 22004 [2019-09-08 09:47:38,105 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=355, Invalid=1625, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 09:47:38,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22004 states. [2019-09-08 09:47:40,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22004 to 20926. [2019-09-08 09:47:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20926 states. [2019-09-08 09:47:40,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20926 states to 20926 states and 23900 transitions. [2019-09-08 09:47:40,575 INFO L78 Accepts]: Start accepts. Automaton has 20926 states and 23900 transitions. Word has length 179 [2019-09-08 09:47:40,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:40,575 INFO L475 AbstractCegarLoop]: Abstraction has 20926 states and 23900 transitions. [2019-09-08 09:47:40,575 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-08 09:47:40,575 INFO L276 IsEmpty]: Start isEmpty. Operand 20926 states and 23900 transitions. [2019-09-08 09:47:40,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:47:40,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:40,585 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:40,585 INFO L418 AbstractCegarLoop]: === Iteration 55 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:40,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:40,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1797481385, now seen corresponding path program 1 times [2019-09-08 09:47:40,585 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:40,585 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:40,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:40,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:40,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:41,452 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 09:47:41,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:41,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2019-09-08 09:47:41,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-08 09:47:41,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-08 09:47:41,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2019-09-08 09:47:41,453 INFO L87 Difference]: Start difference. First operand 20926 states and 23900 transitions. Second operand 24 states. [2019-09-08 09:47:50,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:47:50,139 INFO L93 Difference]: Finished difference Result 27184 states and 32713 transitions. [2019-09-08 09:47:50,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 09:47:50,140 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 179 [2019-09-08 09:47:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:47:50,166 INFO L225 Difference]: With dead ends: 27184 [2019-09-08 09:47:50,166 INFO L226 Difference]: Without dead ends: 26700 [2019-09-08 09:47:50,172 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2019-09-08 09:47:50,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26700 states. [2019-09-08 09:47:52,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26700 to 20886. [2019-09-08 09:47:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-09-08 09:47:52,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 23854 transitions. [2019-09-08 09:47:52,719 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 23854 transitions. Word has length 179 [2019-09-08 09:47:52,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:47:52,720 INFO L475 AbstractCegarLoop]: Abstraction has 20886 states and 23854 transitions. [2019-09-08 09:47:52,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-08 09:47:52,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 23854 transitions. [2019-09-08 09:47:52,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:47:52,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:47:52,731 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:47:52,731 INFO L418 AbstractCegarLoop]: === Iteration 56 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:47:52,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:47:52,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1629966298, now seen corresponding path program 1 times [2019-09-08 09:47:52,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:47:52,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:47:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:52,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:47:52,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:47:52,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:47:54,302 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 09:47:54,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:47:54,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:47:54,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:47:54,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:47:54,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=593, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:47:54,304 INFO L87 Difference]: Start difference. First operand 20886 states and 23854 transitions. Second operand 26 states. [2019-09-08 09:47:55,517 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2019-09-08 09:47:55,821 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 69 [2019-09-08 09:47:56,112 WARN L188 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2019-09-08 09:47:56,543 WARN L188 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 09:47:56,731 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-09-08 09:47:56,996 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 48 [2019-09-08 09:47:57,147 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 09:47:57,924 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 09:47:58,161 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2019-09-08 09:47:58,631 WARN L188 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 48 [2019-09-08 09:47:58,876 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 53 [2019-09-08 09:47:59,963 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2019-09-08 09:48:00,230 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2019-09-08 09:48:00,534 WARN L188 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 09:48:01,207 WARN L188 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-09-08 09:48:01,456 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 09:48:01,935 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-09-08 09:48:02,976 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 45 [2019-09-08 09:48:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:05,924 INFO L93 Difference]: Finished difference Result 25016 states and 29637 transitions. [2019-09-08 09:48:05,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 09:48:05,924 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-08 09:48:05,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:05,943 INFO L225 Difference]: With dead ends: 25016 [2019-09-08 09:48:05,943 INFO L226 Difference]: Without dead ends: 24421 [2019-09-08 09:48:05,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2019-09-08 09:48:05,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24421 states. [2019-09-08 09:48:08,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24421 to 20886. [2019-09-08 09:48:08,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20886 states. [2019-09-08 09:48:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20886 states to 20886 states and 23854 transitions. [2019-09-08 09:48:08,566 INFO L78 Accepts]: Start accepts. Automaton has 20886 states and 23854 transitions. Word has length 179 [2019-09-08 09:48:08,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:08,567 INFO L475 AbstractCegarLoop]: Abstraction has 20886 states and 23854 transitions. [2019-09-08 09:48:08,567 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:48:08,567 INFO L276 IsEmpty]: Start isEmpty. Operand 20886 states and 23854 transitions. [2019-09-08 09:48:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:48:08,577 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:08,577 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:08,577 INFO L418 AbstractCegarLoop]: === Iteration 57 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:08,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:08,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1266926593, now seen corresponding path program 1 times [2019-09-08 09:48:08,578 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:08,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:08,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:08,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:08,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:08,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:09,297 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 09:48:09,297 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:09,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 09:48:09,298 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 09:48:09,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 09:48:09,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-09-08 09:48:09,299 INFO L87 Difference]: Start difference. First operand 20886 states and 23854 transitions. Second operand 16 states. [2019-09-08 09:48:14,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:14,649 INFO L93 Difference]: Finished difference Result 25635 states and 29840 transitions. [2019-09-08 09:48:14,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 09:48:14,650 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 179 [2019-09-08 09:48:14,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:14,669 INFO L225 Difference]: With dead ends: 25635 [2019-09-08 09:48:14,669 INFO L226 Difference]: Without dead ends: 23577 [2019-09-08 09:48:14,675 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=314, Invalid=876, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 09:48:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23577 states. [2019-09-08 09:48:17,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23577 to 21851. [2019-09-08 09:48:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21851 states. [2019-09-08 09:48:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21851 states to 21851 states and 24844 transitions. [2019-09-08 09:48:17,353 INFO L78 Accepts]: Start accepts. Automaton has 21851 states and 24844 transitions. Word has length 179 [2019-09-08 09:48:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:17,353 INFO L475 AbstractCegarLoop]: Abstraction has 21851 states and 24844 transitions. [2019-09-08 09:48:17,353 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 09:48:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 21851 states and 24844 transitions. [2019-09-08 09:48:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:48:17,364 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:17,364 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:17,365 INFO L418 AbstractCegarLoop]: === Iteration 58 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:17,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:17,365 INFO L82 PathProgramCache]: Analyzing trace with hash 2052486042, now seen corresponding path program 1 times [2019-09-08 09:48:17,365 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:17,365 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:17,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:17,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:17,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:17,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:18,020 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 09:48:18,020 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:18,020 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-09-08 09:48:18,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-09-08 09:48:18,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-09-08 09:48:18,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2019-09-08 09:48:18,021 INFO L87 Difference]: Start difference. First operand 21851 states and 24844 transitions. Second operand 18 states. [2019-09-08 09:48:24,395 WARN L188 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 35 [2019-09-08 09:48:24,929 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2019-09-08 09:48:25,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:25,037 INFO L93 Difference]: Finished difference Result 25087 states and 28754 transitions. [2019-09-08 09:48:25,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 09:48:25,037 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 179 [2019-09-08 09:48:25,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:25,057 INFO L225 Difference]: With dead ends: 25087 [2019-09-08 09:48:25,057 INFO L226 Difference]: Without dead ends: 24029 [2019-09-08 09:48:25,060 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=496, Invalid=1396, Unknown=0, NotChecked=0, Total=1892 [2019-09-08 09:48:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24029 states. [2019-09-08 09:48:27,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24029 to 22155. [2019-09-08 09:48:27,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22155 states. [2019-09-08 09:48:27,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22155 states to 22155 states and 25154 transitions. [2019-09-08 09:48:27,846 INFO L78 Accepts]: Start accepts. Automaton has 22155 states and 25154 transitions. Word has length 179 [2019-09-08 09:48:27,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:27,846 INFO L475 AbstractCegarLoop]: Abstraction has 22155 states and 25154 transitions. [2019-09-08 09:48:27,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-09-08 09:48:27,847 INFO L276 IsEmpty]: Start isEmpty. Operand 22155 states and 25154 transitions. [2019-09-08 09:48:27,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:48:27,857 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:27,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:27,858 INFO L418 AbstractCegarLoop]: === Iteration 59 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:27,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:27,858 INFO L82 PathProgramCache]: Analyzing trace with hash 823461012, now seen corresponding path program 1 times [2019-09-08 09:48:27,858 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:27,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:27,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:27,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:27,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:28,457 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 09:48:28,457 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:28,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:48:28,458 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:48:28,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:48:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:48:28,458 INFO L87 Difference]: Start difference. First operand 22155 states and 25154 transitions. Second operand 17 states. [2019-09-08 09:48:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:35,388 INFO L93 Difference]: Finished difference Result 29935 states and 35572 transitions. [2019-09-08 09:48:35,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-09-08 09:48:35,388 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-08 09:48:35,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:35,411 INFO L225 Difference]: With dead ends: 29935 [2019-09-08 09:48:35,411 INFO L226 Difference]: Without dead ends: 28076 [2019-09-08 09:48:35,417 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 207 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=385, Invalid=1021, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:48:35,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28076 states. [2019-09-08 09:48:38,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28076 to 21265. [2019-09-08 09:48:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21265 states. [2019-09-08 09:48:38,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21265 states to 21265 states and 24204 transitions. [2019-09-08 09:48:38,278 INFO L78 Accepts]: Start accepts. Automaton has 21265 states and 24204 transitions. Word has length 179 [2019-09-08 09:48:38,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:38,278 INFO L475 AbstractCegarLoop]: Abstraction has 21265 states and 24204 transitions. [2019-09-08 09:48:38,278 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:48:38,278 INFO L276 IsEmpty]: Start isEmpty. Operand 21265 states and 24204 transitions. [2019-09-08 09:48:38,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:48:38,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:38,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:38,289 INFO L418 AbstractCegarLoop]: === Iteration 60 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:38,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 423980196, now seen corresponding path program 1 times [2019-09-08 09:48:38,289 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:38,289 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:38,290 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:38,290 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:38,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:39,793 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 09:48:39,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:39,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2019-09-08 09:48:39,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-09-08 09:48:39,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-09-08 09:48:39,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=444, Unknown=0, NotChecked=0, Total=506 [2019-09-08 09:48:39,794 INFO L87 Difference]: Start difference. First operand 21265 states and 24204 transitions. Second operand 23 states. [2019-09-08 09:48:40,369 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 55 [2019-09-08 09:48:41,003 WARN L188 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-09-08 09:48:41,244 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-09-08 09:48:41,401 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-09-08 09:48:41,776 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-09-08 09:48:41,949 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 56 [2019-09-08 09:48:42,131 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-09-08 09:48:42,335 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 41 [2019-09-08 09:48:43,049 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 43 [2019-09-08 09:48:43,663 WARN L188 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 46 [2019-09-08 09:48:43,949 WARN L188 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 48 [2019-09-08 09:48:44,695 WARN L188 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-09-08 09:48:44,924 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 43 [2019-09-08 09:48:45,679 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 09:48:46,805 WARN L188 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 46 [2019-09-08 09:48:50,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:48:50,538 INFO L93 Difference]: Finished difference Result 27940 states and 33222 transitions. [2019-09-08 09:48:50,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-09-08 09:48:50,539 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 179 [2019-09-08 09:48:50,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:48:50,561 INFO L225 Difference]: With dead ends: 27940 [2019-09-08 09:48:50,561 INFO L226 Difference]: Without dead ends: 27052 [2019-09-08 09:48:50,566 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 226 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=442, Invalid=1364, Unknown=0, NotChecked=0, Total=1806 [2019-09-08 09:48:50,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27052 states. [2019-09-08 09:48:54,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27052 to 21426. [2019-09-08 09:48:54,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21426 states. [2019-09-08 09:48:54,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21426 states to 21426 states and 24368 transitions. [2019-09-08 09:48:54,339 INFO L78 Accepts]: Start accepts. Automaton has 21426 states and 24368 transitions. Word has length 179 [2019-09-08 09:48:54,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:48:54,340 INFO L475 AbstractCegarLoop]: Abstraction has 21426 states and 24368 transitions. [2019-09-08 09:48:54,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-09-08 09:48:54,340 INFO L276 IsEmpty]: Start isEmpty. Operand 21426 states and 24368 transitions. [2019-09-08 09:48:54,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:48:54,350 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:48:54,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:48:54,351 INFO L418 AbstractCegarLoop]: === Iteration 61 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:48:54,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:48:54,351 INFO L82 PathProgramCache]: Analyzing trace with hash 453697913, now seen corresponding path program 1 times [2019-09-08 09:48:54,351 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:48:54,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:48:54,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:54,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:48:54,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:48:54,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:48:55,364 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 17 [2019-09-08 09:48:55,944 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 09:48:55,944 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:48:55,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:48:55,945 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:48:55,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:48:55,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=579, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:48:55,945 INFO L87 Difference]: Start difference. First operand 21426 states and 24368 transitions. Second operand 26 states. [2019-09-08 09:48:56,128 WARN L188 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2019-09-08 09:48:59,788 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 48 [2019-09-08 09:49:00,168 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2019-09-08 09:49:06,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:06,924 INFO L93 Difference]: Finished difference Result 26841 states and 31741 transitions. [2019-09-08 09:49:06,925 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 09:49:06,925 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-08 09:49:06,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:06,946 INFO L225 Difference]: With dead ends: 26841 [2019-09-08 09:49:06,946 INFO L226 Difference]: Without dead ends: 25687 [2019-09-08 09:49:06,952 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 621 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=547, Invalid=2759, Unknown=0, NotChecked=0, Total=3306 [2019-09-08 09:49:06,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25687 states. [2019-09-08 09:49:09,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25687 to 21338. [2019-09-08 09:49:09,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21338 states. [2019-09-08 09:49:09,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21338 states to 21338 states and 24273 transitions. [2019-09-08 09:49:09,967 INFO L78 Accepts]: Start accepts. Automaton has 21338 states and 24273 transitions. Word has length 179 [2019-09-08 09:49:09,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:09,968 INFO L475 AbstractCegarLoop]: Abstraction has 21338 states and 24273 transitions. [2019-09-08 09:49:09,968 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:49:09,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21338 states and 24273 transitions. [2019-09-08 09:49:09,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:49:09,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:09,977 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:09,978 INFO L418 AbstractCegarLoop]: === Iteration 62 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:09,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:09,978 INFO L82 PathProgramCache]: Analyzing trace with hash -617746241, now seen corresponding path program 1 times [2019-09-08 09:49:09,978 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:09,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:09,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:09,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:10,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:11,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:49:11,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:11,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:49:11,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:49:11,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:49:11,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=518, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:49:11,338 INFO L87 Difference]: Start difference. First operand 21338 states and 24273 transitions. Second operand 25 states. [2019-09-08 09:49:12,197 WARN L188 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-09-08 09:49:12,519 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 71 [2019-09-08 09:49:12,764 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 68 [2019-09-08 09:49:13,202 WARN L188 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 70 [2019-09-08 09:49:13,406 WARN L188 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2019-09-08 09:49:13,704 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 73 [2019-09-08 09:49:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:21,218 INFO L93 Difference]: Finished difference Result 25486 states and 30097 transitions. [2019-09-08 09:49:21,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 09:49:21,218 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2019-09-08 09:49:21,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:21,239 INFO L225 Difference]: With dead ends: 25486 [2019-09-08 09:49:21,240 INFO L226 Difference]: Without dead ends: 24379 [2019-09-08 09:49:21,245 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 394 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=463, Invalid=1793, Unknown=0, NotChecked=0, Total=2256 [2019-09-08 09:49:21,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24379 states. [2019-09-08 09:49:24,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24379 to 20895. [2019-09-08 09:49:24,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20895 states. [2019-09-08 09:49:24,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20895 states to 20895 states and 23816 transitions. [2019-09-08 09:49:24,227 INFO L78 Accepts]: Start accepts. Automaton has 20895 states and 23816 transitions. Word has length 179 [2019-09-08 09:49:24,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:24,228 INFO L475 AbstractCegarLoop]: Abstraction has 20895 states and 23816 transitions. [2019-09-08 09:49:24,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:49:24,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20895 states and 23816 transitions. [2019-09-08 09:49:24,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:49:24,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:24,239 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:24,239 INFO L418 AbstractCegarLoop]: === Iteration 63 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:24,239 INFO L82 PathProgramCache]: Analyzing trace with hash -775327117, now seen corresponding path program 1 times [2019-09-08 09:49:24,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:24,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:24,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:24,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:24,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:24,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:26,588 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 09:49:26,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:26,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-09-08 09:49:26,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-09-08 09:49:26,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-09-08 09:49:26,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2019-09-08 09:49:26,591 INFO L87 Difference]: Start difference. First operand 20895 states and 23816 transitions. Second operand 26 states. [2019-09-08 09:49:27,815 WARN L188 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 151 DAG size of output: 129 [2019-09-08 09:49:29,370 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-09-08 09:49:29,547 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-09-08 09:49:30,669 WARN L188 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 56 [2019-09-08 09:49:30,849 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 51 [2019-09-08 09:49:31,115 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 74 [2019-09-08 09:49:31,498 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 09:49:31,882 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-09-08 09:49:32,112 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2019-09-08 09:49:32,370 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 09:49:32,890 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2019-09-08 09:49:33,188 WARN L188 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 80 [2019-09-08 09:49:33,434 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-09-08 09:49:33,861 WARN L188 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 66 [2019-09-08 09:49:35,193 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 72 [2019-09-08 09:49:35,341 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-09-08 09:49:36,164 WARN L188 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 89 [2019-09-08 09:49:36,786 WARN L188 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 97 [2019-09-08 09:49:38,991 WARN L188 SmtUtils]: Spent 336.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 [2019-09-08 09:49:39,631 WARN L188 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 103 [2019-09-08 09:49:41,208 WARN L188 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 79 [2019-09-08 09:49:41,559 WARN L188 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-09-08 09:49:41,874 WARN L188 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 76 [2019-09-08 09:49:43,216 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-09-08 09:49:48,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:48,733 INFO L93 Difference]: Finished difference Result 27019 states and 32432 transitions. [2019-09-08 09:49:48,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2019-09-08 09:49:48,734 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 179 [2019-09-08 09:49:48,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:48,761 INFO L225 Difference]: With dead ends: 27019 [2019-09-08 09:49:48,761 INFO L226 Difference]: Without dead ends: 27007 [2019-09-08 09:49:48,767 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1081, Invalid=4469, Unknown=0, NotChecked=0, Total=5550 [2019-09-08 09:49:48,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27007 states. [2019-09-08 09:49:51,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27007 to 20889. [2019-09-08 09:49:51,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20889 states. [2019-09-08 09:49:51,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20889 states to 20889 states and 23809 transitions. [2019-09-08 09:49:51,649 INFO L78 Accepts]: Start accepts. Automaton has 20889 states and 23809 transitions. Word has length 179 [2019-09-08 09:49:51,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:51,649 INFO L475 AbstractCegarLoop]: Abstraction has 20889 states and 23809 transitions. [2019-09-08 09:49:51,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-09-08 09:49:51,649 INFO L276 IsEmpty]: Start isEmpty. Operand 20889 states and 23809 transitions. [2019-09-08 09:49:51,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:49:51,659 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:51,659 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:51,659 INFO L418 AbstractCegarLoop]: === Iteration 64 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:51,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:51,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1814547479, now seen corresponding path program 1 times [2019-09-08 09:49:51,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:51,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:51,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:51,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:49:52,491 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 09:49:52,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:49:52,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-09-08 09:49:52,492 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-08 09:49:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-08 09:49:52,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=223, Unknown=0, NotChecked=0, Total=272 [2019-09-08 09:49:52,493 INFO L87 Difference]: Start difference. First operand 20889 states and 23809 transitions. Second operand 17 states. [2019-09-08 09:49:56,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:49:56,888 INFO L93 Difference]: Finished difference Result 22214 states and 25599 transitions. [2019-09-08 09:49:56,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 09:49:56,888 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 179 [2019-09-08 09:49:56,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:49:56,902 INFO L225 Difference]: With dead ends: 22214 [2019-09-08 09:49:56,902 INFO L226 Difference]: Without dead ends: 20079 [2019-09-08 09:49:56,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=146, Invalid=454, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:49:56,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20079 states. [2019-09-08 09:49:59,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20079 to 20064. [2019-09-08 09:49:59,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20064 states. [2019-09-08 09:49:59,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20064 states to 20064 states and 22964 transitions. [2019-09-08 09:49:59,720 INFO L78 Accepts]: Start accepts. Automaton has 20064 states and 22964 transitions. Word has length 179 [2019-09-08 09:49:59,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:49:59,720 INFO L475 AbstractCegarLoop]: Abstraction has 20064 states and 22964 transitions. [2019-09-08 09:49:59,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-09-08 09:49:59,720 INFO L276 IsEmpty]: Start isEmpty. Operand 20064 states and 22964 transitions. [2019-09-08 09:49:59,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:49:59,730 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:49:59,730 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:49:59,730 INFO L418 AbstractCegarLoop]: === Iteration 65 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:49:59,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:49:59,731 INFO L82 PathProgramCache]: Analyzing trace with hash 682165715, now seen corresponding path program 1 times [2019-09-08 09:49:59,731 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:49:59,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:49:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:59,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:49:59,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:49:59,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:01,599 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 09:50:01,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:01,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2019-09-08 09:50:01,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-09-08 09:50:01,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-09-08 09:50:01,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=794, Unknown=0, NotChecked=0, Total=870 [2019-09-08 09:50:01,600 INFO L87 Difference]: Start difference. First operand 20064 states and 22964 transitions. Second operand 30 states. [2019-09-08 09:50:02,210 WARN L188 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-09-08 09:50:02,625 WARN L188 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-09-08 09:50:03,508 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 37 [2019-09-08 09:50:03,668 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 39 [2019-09-08 09:50:03,996 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 52 [2019-09-08 09:50:04,304 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 64 [2019-09-08 09:50:04,766 WARN L188 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 83 [2019-09-08 09:50:05,212 WARN L188 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 92 [2019-09-08 09:50:05,969 WARN L188 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 94 [2019-09-08 09:50:06,586 WARN L188 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 99 [2019-09-08 09:50:06,822 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:50:07,032 WARN L188 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 50 [2019-09-08 09:50:07,216 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 47 [2019-09-08 09:50:07,523 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-09-08 09:50:07,721 WARN L188 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 09:50:08,118 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-09-08 09:50:08,503 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 41 [2019-09-08 09:50:21,109 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-09-08 09:50:21,350 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 44 [2019-09-08 09:50:21,574 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 09:50:24,803 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2019-09-08 09:50:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:30,193 INFO L93 Difference]: Finished difference Result 22005 states and 25321 transitions. [2019-09-08 09:50:30,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-09-08 09:50:30,194 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 179 [2019-09-08 09:50:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:30,210 INFO L225 Difference]: With dead ends: 22005 [2019-09-08 09:50:30,211 INFO L226 Difference]: Without dead ends: 21836 [2019-09-08 09:50:30,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 633 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=596, Invalid=3186, Unknown=0, NotChecked=0, Total=3782 [2019-09-08 09:50:30,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21836 states. [2019-09-08 09:50:33,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21836 to 20055. [2019-09-08 09:50:33,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20055 states. [2019-09-08 09:50:33,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20055 states to 20055 states and 22953 transitions. [2019-09-08 09:50:33,196 INFO L78 Accepts]: Start accepts. Automaton has 20055 states and 22953 transitions. Word has length 179 [2019-09-08 09:50:33,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:33,197 INFO L475 AbstractCegarLoop]: Abstraction has 20055 states and 22953 transitions. [2019-09-08 09:50:33,197 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-09-08 09:50:33,197 INFO L276 IsEmpty]: Start isEmpty. Operand 20055 states and 22953 transitions. [2019-09-08 09:50:33,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:50:33,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:33,207 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:33,207 INFO L418 AbstractCegarLoop]: === Iteration 66 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:33,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:33,207 INFO L82 PathProgramCache]: Analyzing trace with hash -539359104, now seen corresponding path program 1 times [2019-09-08 09:50:33,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:33,208 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:33,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:33,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:33,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:34,707 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 09:50:34,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:34,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-09-08 09:50:34,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-09-08 09:50:34,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-09-08 09:50:34,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2019-09-08 09:50:34,708 INFO L87 Difference]: Start difference. First operand 20055 states and 22953 transitions. Second operand 25 states. [2019-09-08 09:50:35,191 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2019-09-08 09:50:35,448 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-09-08 09:50:35,694 WARN L188 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-09-08 09:50:36,106 WARN L188 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 70 [2019-09-08 09:50:36,418 WARN L188 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 74 [2019-09-08 09:50:36,832 WARN L188 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-09-08 09:50:37,207 WARN L188 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 79 [2019-09-08 09:50:37,515 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 09:50:37,789 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-09-08 09:50:37,949 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 09:50:38,213 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-09-08 09:50:38,389 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 09:50:38,699 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 50 [2019-09-08 09:50:44,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:44,871 INFO L93 Difference]: Finished difference Result 26167 states and 31570 transitions. [2019-09-08 09:50:44,871 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 09:50:44,871 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 179 [2019-09-08 09:50:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:44,895 INFO L225 Difference]: With dead ends: 26167 [2019-09-08 09:50:44,896 INFO L226 Difference]: Without dead ends: 24563 [2019-09-08 09:50:44,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=299, Invalid=1261, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 09:50:44,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24563 states. [2019-09-08 09:50:48,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24563 to 22225. [2019-09-08 09:50:48,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22225 states. [2019-09-08 09:50:48,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22225 states to 22225 states and 26084 transitions. [2019-09-08 09:50:48,539 INFO L78 Accepts]: Start accepts. Automaton has 22225 states and 26084 transitions. Word has length 179 [2019-09-08 09:50:48,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:48,539 INFO L475 AbstractCegarLoop]: Abstraction has 22225 states and 26084 transitions. [2019-09-08 09:50:48,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-09-08 09:50:48,539 INFO L276 IsEmpty]: Start isEmpty. Operand 22225 states and 26084 transitions. [2019-09-08 09:50:48,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:50:48,549 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:48,549 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:48,549 INFO L418 AbstractCegarLoop]: === Iteration 67 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:48,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:48,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1276520594, now seen corresponding path program 1 times [2019-09-08 09:50:48,550 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:48,550 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:48,550 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:48,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:48,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:48,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:50:49,555 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 09:50:49,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:50:49,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-09-08 09:50:49,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-09-08 09:50:49,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-09-08 09:50:49,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-09-08 09:50:49,556 INFO L87 Difference]: Start difference. First operand 22225 states and 26084 transitions. Second operand 20 states. [2019-09-08 09:50:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:50:56,070 INFO L93 Difference]: Finished difference Result 26106 states and 31226 transitions. [2019-09-08 09:50:56,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 09:50:56,070 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 179 [2019-09-08 09:50:56,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:50:56,091 INFO L225 Difference]: With dead ends: 26106 [2019-09-08 09:50:56,092 INFO L226 Difference]: Without dead ends: 25261 [2019-09-08 09:50:56,096 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2019-09-08 09:50:56,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25261 states. [2019-09-08 09:50:59,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25261 to 22133. [2019-09-08 09:50:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22133 states. [2019-09-08 09:50:59,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22133 states to 22133 states and 25984 transitions. [2019-09-08 09:50:59,643 INFO L78 Accepts]: Start accepts. Automaton has 22133 states and 25984 transitions. Word has length 179 [2019-09-08 09:50:59,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:50:59,643 INFO L475 AbstractCegarLoop]: Abstraction has 22133 states and 25984 transitions. [2019-09-08 09:50:59,643 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-09-08 09:50:59,643 INFO L276 IsEmpty]: Start isEmpty. Operand 22133 states and 25984 transitions. [2019-09-08 09:50:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:50:59,652 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:50:59,652 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:50:59,653 INFO L418 AbstractCegarLoop]: === Iteration 68 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:50:59,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:50:59,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1174552155, now seen corresponding path program 1 times [2019-09-08 09:50:59,653 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:50:59,653 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:50:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:59,654 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:50:59,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:50:59,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:00,114 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 09:51:00,114 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:00,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2019-09-08 09:51:00,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-08 09:51:00,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-08 09:51:00,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=303, Unknown=0, NotChecked=0, Total=342 [2019-09-08 09:51:00,115 INFO L87 Difference]: Start difference. First operand 22133 states and 25984 transitions. Second operand 19 states. [2019-09-08 09:51:03,787 WARN L188 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 25 [2019-09-08 09:51:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:51:07,629 INFO L93 Difference]: Finished difference Result 27361 states and 32738 transitions. [2019-09-08 09:51:07,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 09:51:07,630 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 179 [2019-09-08 09:51:07,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:51:07,647 INFO L225 Difference]: With dead ends: 27361 [2019-09-08 09:51:07,648 INFO L226 Difference]: Without dead ends: 25420 [2019-09-08 09:51:07,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=300, Invalid=1106, Unknown=0, NotChecked=0, Total=1406 [2019-09-08 09:51:07,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25420 states. [2019-09-08 09:51:11,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25420 to 22768. [2019-09-08 09:51:11,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22768 states. [2019-09-08 09:51:11,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22768 states to 22768 states and 26640 transitions. [2019-09-08 09:51:11,319 INFO L78 Accepts]: Start accepts. Automaton has 22768 states and 26640 transitions. Word has length 179 [2019-09-08 09:51:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:51:11,319 INFO L475 AbstractCegarLoop]: Abstraction has 22768 states and 26640 transitions. [2019-09-08 09:51:11,320 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-08 09:51:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 22768 states and 26640 transitions. [2019-09-08 09:51:11,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 09:51:11,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:51:11,332 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:51:11,332 INFO L418 AbstractCegarLoop]: === Iteration 69 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:51:11,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:51:11,333 INFO L82 PathProgramCache]: Analyzing trace with hash 820495760, now seen corresponding path program 1 times [2019-09-08 09:51:11,333 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:51:11,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:51:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:11,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:51:11,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:51:11,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:51:11,749 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 41 [2019-09-08 09:51:12,759 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 09:51:12,759 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:51:12,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2019-09-08 09:51:12,760 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-09-08 09:51:12,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-09-08 09:51:12,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=747, Unknown=0, NotChecked=0, Total=812 [2019-09-08 09:51:12,760 INFO L87 Difference]: Start difference. First operand 22768 states and 26640 transitions. Second operand 29 states. [2019-09-08 09:51:13,749 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2019-09-08 09:51:13,970 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 61 [2019-09-08 09:51:14,445 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 09:51:14,603 WARN L188 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 44 [2019-09-08 09:51:14,795 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 49 [2019-09-08 09:51:15,844 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 41