java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 12:28:47,303 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 12:28:47,306 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 12:28:47,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 12:28:47,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 12:28:47,324 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 12:28:47,326 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 12:28:47,338 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 12:28:47,339 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 12:28:47,340 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 12:28:47,341 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 12:28:47,342 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 12:28:47,342 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 12:28:47,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 12:28:47,344 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 12:28:47,345 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 12:28:47,346 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 12:28:47,347 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 12:28:47,348 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 12:28:47,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 12:28:47,351 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 12:28:47,352 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 12:28:47,353 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 12:28:47,354 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 12:28:47,356 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 12:28:47,356 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 12:28:47,356 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 12:28:47,357 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 12:28:47,357 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 12:28:47,358 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 12:28:47,358 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 12:28:47,360 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 12:28:47,361 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 12:28:47,362 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 12:28:47,363 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 12:28:47,363 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 12:28:47,366 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 12:28:47,366 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 12:28:47,366 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 12:28:47,367 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 12:28:47,367 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 12:28:47,368 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 12:28:47,382 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 12:28:47,382 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 12:28:47,383 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 12:28:47,383 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 12:28:47,384 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 12:28:47,384 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 12:28:47,385 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 12:28:47,385 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 12:28:47,385 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 12:28:47,385 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 12:28:47,385 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 12:28:47,386 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 12:28:47,386 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 12:28:47,386 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 12:28:47,386 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 12:28:47,386 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 12:28:47,386 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 12:28:47,387 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 12:28:47,387 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 12:28:47,387 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 12:28:47,387 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 12:28:47,387 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 12:28:47,388 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 12:28:47,388 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 12:28:47,389 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 12:28:47,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 12:28:47,390 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 12:28:47,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 12:28:47,390 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 12:28:47,424 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 12:28:47,436 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 12:28:47,439 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 12:28:47,441 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 12:28:47,441 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 12:28:47,442 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:28:47,506 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8aa3fcb6/d23080136bcc481bbd091ebc4f106380/FLAGed79aa315 [2019-09-08 12:28:48,059 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 12:28:48,060 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:28:48,073 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8aa3fcb6/d23080136bcc481bbd091ebc4f106380/FLAGed79aa315 [2019-09-08 12:28:48,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8aa3fcb6/d23080136bcc481bbd091ebc4f106380 [2019-09-08 12:28:48,355 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 12:28:48,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 12:28:48,357 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 12:28:48,357 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 12:28:48,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 12:28:48,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:28:48" (1/1) ... [2019-09-08 12:28:48,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f830ac0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:48, skipping insertion in model container [2019-09-08 12:28:48,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 12:28:48" (1/1) ... [2019-09-08 12:28:48,372 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 12:28:48,443 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 12:28:48,940 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:28:48,972 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 12:28:49,297 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 12:28:49,335 INFO L192 MainTranslator]: Completed translation [2019-09-08 12:28:49,336 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49 WrapperNode [2019-09-08 12:28:49,336 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 12:28:49,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 12:28:49,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 12:28:49,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 12:28:49,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,393 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,393 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,433 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,466 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (1/1) ... [2019-09-08 12:28:49,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 12:28:49,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 12:28:49,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 12:28:49,477 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 12:28:49,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (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 12:28:49,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 12:28:49,539 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 12:28:49,539 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 12:28:49,539 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 12:28:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 12:28:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 12:28:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 12:28:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 12:28:49,540 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 12:28:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 12:28:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 12:28:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 12:28:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 12:28:49,541 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 12:28:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 12:28:49,542 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-08 12:28:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-08 12:28:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 12:28:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 12:28:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 12:28:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 12:28:49,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 12:28:50,930 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 12:28:50,931 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 12:28:50,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:28:50 BoogieIcfgContainer [2019-09-08 12:28:50,932 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 12:28:50,933 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 12:28:50,933 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 12:28:50,936 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 12:28:50,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 12:28:48" (1/3) ... [2019-09-08 12:28:50,937 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d33412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:28:50, skipping insertion in model container [2019-09-08 12:28:50,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 12:28:49" (2/3) ... [2019-09-08 12:28:50,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21d33412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 12:28:50, skipping insertion in model container [2019-09-08 12:28:50,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 12:28:50" (3/3) ... [2019-09-08 12:28:50,940 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c.p+lhb-reducer.c [2019-09-08 12:28:50,948 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 12:28:50,956 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 12:28:50,972 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 12:28:51,004 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 12:28:51,005 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 12:28:51,005 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 12:28:51,005 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 12:28:51,005 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 12:28:51,006 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 12:28:51,006 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 12:28:51,006 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 12:28:51,006 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 12:28:51,038 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states. [2019-09-08 12:28:51,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-08 12:28:51,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:51,057 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] [2019-09-08 12:28:51,059 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:51,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:51,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1558548154, now seen corresponding path program 1 times [2019-09-08 12:28:51,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:51,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:51,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:51,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:51,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:51,465 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 12:28:51,467 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:51,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 12:28:51,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 12:28:51,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 12:28:51,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 12:28:51,490 INFO L87 Difference]: Start difference. First operand 331 states. Second operand 4 states. [2019-09-08 12:28:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:51,682 INFO L93 Difference]: Finished difference Result 618 states and 1002 transitions. [2019-09-08 12:28:51,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:51,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 123 [2019-09-08 12:28:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:51,709 INFO L225 Difference]: With dead ends: 618 [2019-09-08 12:28:51,709 INFO L226 Difference]: Without dead ends: 327 [2019-09-08 12:28:51,720 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 12:28:51,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2019-09-08 12:28:51,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2019-09-08 12:28:51,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2019-09-08 12:28:51,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 495 transitions. [2019-09-08 12:28:51,821 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 495 transitions. Word has length 123 [2019-09-08 12:28:51,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:51,822 INFO L475 AbstractCegarLoop]: Abstraction has 327 states and 495 transitions. [2019-09-08 12:28:51,822 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 12:28:51,822 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 495 transitions. [2019-09-08 12:28:51,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-09-08 12:28:51,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:51,827 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] [2019-09-08 12:28:51,828 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:51,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash 991072982, now seen corresponding path program 1 times [2019-09-08 12:28:51,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:51,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:51,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:51,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:51,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,157 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 12:28:52,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:52,163 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:52,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:52,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:52,165 INFO L87 Difference]: Start difference. First operand 327 states and 495 transitions. Second operand 3 states. [2019-09-08 12:28:52,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,255 INFO L93 Difference]: Finished difference Result 758 states and 1184 transitions. [2019-09-08 12:28:52,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:52,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 162 [2019-09-08 12:28:52,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,261 INFO L225 Difference]: With dead ends: 758 [2019-09-08 12:28:52,261 INFO L226 Difference]: Without dead ends: 496 [2019-09-08 12:28:52,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 12:28:52,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2019-09-08 12:28:52,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 494. [2019-09-08 12:28:52,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 494 states. [2019-09-08 12:28:52,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 760 transitions. [2019-09-08 12:28:52,306 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 760 transitions. Word has length 162 [2019-09-08 12:28:52,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:52,308 INFO L475 AbstractCegarLoop]: Abstraction has 494 states and 760 transitions. [2019-09-08 12:28:52,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:52,308 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 760 transitions. [2019-09-08 12:28:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-09-08 12:28:52,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:52,313 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] [2019-09-08 12:28:52,314 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:52,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:52,315 INFO L82 PathProgramCache]: Analyzing trace with hash 573716544, now seen corresponding path program 1 times [2019-09-08 12:28:52,315 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:52,315 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:52,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,542 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 12:28:52,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:52,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:52,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:52,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:52,545 INFO L87 Difference]: Start difference. First operand 494 states and 760 transitions. Second operand 3 states. [2019-09-08 12:28:52,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,618 INFO L93 Difference]: Finished difference Result 1221 states and 1921 transitions. [2019-09-08 12:28:52,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:52,620 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-09-08 12:28:52,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,625 INFO L225 Difference]: With dead ends: 1221 [2019-09-08 12:28:52,626 INFO L226 Difference]: Without dead ends: 798 [2019-09-08 12:28:52,627 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 12:28:52,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 798 states. [2019-09-08 12:28:52,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 798 to 796. [2019-09-08 12:28:52,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 796 states. [2019-09-08 12:28:52,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 796 states to 796 states and 1238 transitions. [2019-09-08 12:28:52,664 INFO L78 Accepts]: Start accepts. Automaton has 796 states and 1238 transitions. Word has length 164 [2019-09-08 12:28:52,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:52,665 INFO L475 AbstractCegarLoop]: Abstraction has 796 states and 1238 transitions. [2019-09-08 12:28:52,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:52,665 INFO L276 IsEmpty]: Start isEmpty. Operand 796 states and 1238 transitions. [2019-09-08 12:28:52,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2019-09-08 12:28:52,668 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:52,668 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] [2019-09-08 12:28:52,668 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:52,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:52,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1866061684, now seen corresponding path program 1 times [2019-09-08 12:28:52,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:52,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:52,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:52,813 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 12:28:52,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:52,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:52,814 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:52,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:52,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:52,815 INFO L87 Difference]: Start difference. First operand 796 states and 1238 transitions. Second operand 3 states. [2019-09-08 12:28:52,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:52,912 INFO L93 Difference]: Finished difference Result 2053 states and 3239 transitions. [2019-09-08 12:28:52,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:52,913 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 166 [2019-09-08 12:28:52,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:52,921 INFO L225 Difference]: With dead ends: 2053 [2019-09-08 12:28:52,921 INFO L226 Difference]: Without dead ends: 1334 [2019-09-08 12:28:52,924 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 12:28:52,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1334 states. [2019-09-08 12:28:52,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1334 to 1332. [2019-09-08 12:28:52,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1332 states. [2019-09-08 12:28:52,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1332 states to 1332 states and 2082 transitions. [2019-09-08 12:28:52,991 INFO L78 Accepts]: Start accepts. Automaton has 1332 states and 2082 transitions. Word has length 166 [2019-09-08 12:28:52,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:52,992 INFO L475 AbstractCegarLoop]: Abstraction has 1332 states and 2082 transitions. [2019-09-08 12:28:52,992 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:52,992 INFO L276 IsEmpty]: Start isEmpty. Operand 1332 states and 2082 transitions. [2019-09-08 12:28:52,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-08 12:28:52,997 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:52,997 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] [2019-09-08 12:28:52,997 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:52,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:52,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1665945972, now seen corresponding path program 1 times [2019-09-08 12:28:52,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:52,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:52,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:53,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,135 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 12:28:53,135 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:53,136 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:53,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:53,137 INFO L87 Difference]: Start difference. First operand 1332 states and 2082 transitions. Second operand 3 states. [2019-09-08 12:28:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:53,315 INFO L93 Difference]: Finished difference Result 3515 states and 5539 transitions. [2019-09-08 12:28:53,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:53,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 168 [2019-09-08 12:28:53,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:53,327 INFO L225 Difference]: With dead ends: 3515 [2019-09-08 12:28:53,328 INFO L226 Difference]: Without dead ends: 2266 [2019-09-08 12:28:53,330 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 12:28:53,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-09-08 12:28:53,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2264. [2019-09-08 12:28:53,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2264 states. [2019-09-08 12:28:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2264 states to 2264 states and 3538 transitions. [2019-09-08 12:28:53,434 INFO L78 Accepts]: Start accepts. Automaton has 2264 states and 3538 transitions. Word has length 168 [2019-09-08 12:28:53,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:53,434 INFO L475 AbstractCegarLoop]: Abstraction has 2264 states and 3538 transitions. [2019-09-08 12:28:53,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 2264 states and 3538 transitions. [2019-09-08 12:28:53,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-08 12:28:53,441 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:53,441 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 12:28:53,441 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:53,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:53,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1995764882, now seen corresponding path program 1 times [2019-09-08 12:28:53,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:53,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:53,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,444 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:53,444 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:53,542 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 12:28:53,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:53,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:53,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:53,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:53,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:53,543 INFO L87 Difference]: Start difference. First operand 2264 states and 3538 transitions. Second operand 3 states. [2019-09-08 12:28:53,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:53,741 INFO L93 Difference]: Finished difference Result 6021 states and 9443 transitions. [2019-09-08 12:28:53,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:53,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 170 [2019-09-08 12:28:53,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:53,761 INFO L225 Difference]: With dead ends: 6021 [2019-09-08 12:28:53,761 INFO L226 Difference]: Without dead ends: 3846 [2019-09-08 12:28:53,767 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 12:28:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3846 states. [2019-09-08 12:28:54,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3846 to 3844. [2019-09-08 12:28:54,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3844 states. [2019-09-08 12:28:54,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3844 states to 3844 states and 5978 transitions. [2019-09-08 12:28:54,023 INFO L78 Accepts]: Start accepts. Automaton has 3844 states and 5978 transitions. Word has length 170 [2019-09-08 12:28:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:54,023 INFO L475 AbstractCegarLoop]: Abstraction has 3844 states and 5978 transitions. [2019-09-08 12:28:54,023 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 3844 states and 5978 transitions. [2019-09-08 12:28:54,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:28:54,034 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:54,034 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] [2019-09-08 12:28:54,035 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1327606792, now seen corresponding path program 1 times [2019-09-08 12:28:54,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:54,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:54,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:54,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:54,143 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 12:28:54,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:54,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:28:54,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:28:54,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:28:54,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:28:54,145 INFO L87 Difference]: Start difference. First operand 3844 states and 5978 transitions. Second operand 3 states. [2019-09-08 12:28:54,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:54,950 INFO L93 Difference]: Finished difference Result 11304 states and 17605 transitions. [2019-09-08 12:28:54,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:28:54,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 12:28:54,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:54,986 INFO L225 Difference]: With dead ends: 11304 [2019-09-08 12:28:54,987 INFO L226 Difference]: Without dead ends: 7566 [2019-09-08 12:28:54,997 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 12:28:55,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7566 states. [2019-09-08 12:28:55,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7566 to 7564. [2019-09-08 12:28:55,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-08 12:28:55,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11696 transitions. [2019-09-08 12:28:55,371 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11696 transitions. Word has length 172 [2019-09-08 12:28:55,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:55,372 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11696 transitions. [2019-09-08 12:28:55,372 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:28:55,372 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11696 transitions. [2019-09-08 12:28:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:28:55,398 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:55,398 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] [2019-09-08 12:28:55,398 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:55,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1061687790, now seen corresponding path program 1 times [2019-09-08 12:28:55,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:55,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:55,401 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:55,401 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:55,604 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 12:28:55,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:55,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:55,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:55,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:55,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:55,607 INFO L87 Difference]: Start difference. First operand 7564 states and 11696 transitions. Second operand 5 states. [2019-09-08 12:28:56,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:56,306 INFO L93 Difference]: Finished difference Result 15059 states and 23312 transitions. [2019-09-08 12:28:56,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:56,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-08 12:28:56,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:56,341 INFO L225 Difference]: With dead ends: 15059 [2019-09-08 12:28:56,342 INFO L226 Difference]: Without dead ends: 7564 [2019-09-08 12:28:56,355 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 12:28:56,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-08 12:28:56,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-08 12:28:56,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-08 12:28:56,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11628 transitions. [2019-09-08 12:28:56,682 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11628 transitions. Word has length 172 [2019-09-08 12:28:56,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:56,683 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11628 transitions. [2019-09-08 12:28:56,683 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:56,683 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11628 transitions. [2019-09-08 12:28:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:28:56,703 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:56,703 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] [2019-09-08 12:28:56,703 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:56,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:56,704 INFO L82 PathProgramCache]: Analyzing trace with hash 738416626, now seen corresponding path program 1 times [2019-09-08 12:28:56,704 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:56,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:56,706 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:56,706 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:56,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 12:28:56,904 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:56,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:56,905 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:56,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:56,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:56,906 INFO L87 Difference]: Start difference. First operand 7564 states and 11628 transitions. Second operand 5 states. [2019-09-08 12:28:57,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:57,545 INFO L93 Difference]: Finished difference Result 15035 states and 23146 transitions. [2019-09-08 12:28:57,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:57,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-08 12:28:57,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:57,580 INFO L225 Difference]: With dead ends: 15035 [2019-09-08 12:28:57,581 INFO L226 Difference]: Without dead ends: 7564 [2019-09-08 12:28:57,596 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 12:28:57,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-08 12:28:57,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-08 12:28:57,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-08 12:28:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11554 transitions. [2019-09-08 12:28:58,023 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11554 transitions. Word has length 172 [2019-09-08 12:28:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:58,024 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11554 transitions. [2019-09-08 12:28:58,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11554 transitions. [2019-09-08 12:28:58,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:28:58,044 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:58,044 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] [2019-09-08 12:28:58,045 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:58,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:58,045 INFO L82 PathProgramCache]: Analyzing trace with hash -858809902, now seen corresponding path program 1 times [2019-09-08 12:28:58,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:58,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:58,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:58,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:58,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:58,213 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 12:28:58,214 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:58,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:58,215 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:58,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:58,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:58,215 INFO L87 Difference]: Start difference. First operand 7564 states and 11554 transitions. Second operand 5 states. [2019-09-08 12:28:58,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:28:58,823 INFO L93 Difference]: Finished difference Result 15023 states and 22984 transitions. [2019-09-08 12:28:58,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:28:58,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-08 12:28:58,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:28:58,842 INFO L225 Difference]: With dead ends: 15023 [2019-09-08 12:28:58,843 INFO L226 Difference]: Without dead ends: 7564 [2019-09-08 12:28:58,857 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 12:28:58,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-08 12:28:59,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-08 12:28:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-08 12:28:59,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11472 transitions. [2019-09-08 12:28:59,272 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11472 transitions. Word has length 172 [2019-09-08 12:28:59,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:28:59,273 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11472 transitions. [2019-09-08 12:28:59,273 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:28:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11472 transitions. [2019-09-08 12:28:59,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:28:59,290 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:28:59,291 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] [2019-09-08 12:28:59,291 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:28:59,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:28:59,291 INFO L82 PathProgramCache]: Analyzing trace with hash -1743148046, now seen corresponding path program 1 times [2019-09-08 12:28:59,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:28:59,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:28:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:59,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:28:59,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:28:59,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:28:59,407 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 12:28:59,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:28:59,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:28:59,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:28:59,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:28:59,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:28:59,409 INFO L87 Difference]: Start difference. First operand 7564 states and 11472 transitions. Second operand 5 states. [2019-09-08 12:29:00,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:00,110 INFO L93 Difference]: Finished difference Result 15047 states and 22850 transitions. [2019-09-08 12:29:00,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:29:00,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 172 [2019-09-08 12:29:00,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:00,126 INFO L225 Difference]: With dead ends: 15047 [2019-09-08 12:29:00,127 INFO L226 Difference]: Without dead ends: 7564 [2019-09-08 12:29:00,137 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 12:29:00,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7564 states. [2019-09-08 12:29:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7564 to 7564. [2019-09-08 12:29:00,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7564 states. [2019-09-08 12:29:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7564 states to 7564 states and 11402 transitions. [2019-09-08 12:29:00,523 INFO L78 Accepts]: Start accepts. Automaton has 7564 states and 11402 transitions. Word has length 172 [2019-09-08 12:29:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:00,523 INFO L475 AbstractCegarLoop]: Abstraction has 7564 states and 11402 transitions. [2019-09-08 12:29:00,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:29:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 7564 states and 11402 transitions. [2019-09-08 12:29:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-09-08 12:29:00,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:00,540 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:29:00,541 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:00,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:00,541 INFO L82 PathProgramCache]: Analyzing trace with hash 759314, now seen corresponding path program 1 times [2019-09-08 12:29:00,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:00,542 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:00,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:00,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:00,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:00,654 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 12:29:00,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:00,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:00,655 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:00,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:00,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:00,656 INFO L87 Difference]: Start difference. First operand 7564 states and 11402 transitions. Second operand 3 states. [2019-09-08 12:29:01,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:01,174 INFO L93 Difference]: Finished difference Result 21979 states and 33301 transitions. [2019-09-08 12:29:01,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:01,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 172 [2019-09-08 12:29:01,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:01,210 INFO L225 Difference]: With dead ends: 21979 [2019-09-08 12:29:01,210 INFO L226 Difference]: Without dead ends: 14566 [2019-09-08 12:29:01,224 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 12:29:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14566 states. [2019-09-08 12:29:01,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14566 to 13790. [2019-09-08 12:29:01,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13790 states. [2019-09-08 12:29:01,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13790 states to 13790 states and 20668 transitions. [2019-09-08 12:29:01,920 INFO L78 Accepts]: Start accepts. Automaton has 13790 states and 20668 transitions. Word has length 172 [2019-09-08 12:29:01,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:01,920 INFO L475 AbstractCegarLoop]: Abstraction has 13790 states and 20668 transitions. [2019-09-08 12:29:01,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:01,920 INFO L276 IsEmpty]: Start isEmpty. Operand 13790 states and 20668 transitions. [2019-09-08 12:29:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 12:29:01,956 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:01,956 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 12:29:01,957 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:01,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:01,957 INFO L82 PathProgramCache]: Analyzing trace with hash 961881910, now seen corresponding path program 1 times [2019-09-08 12:29:01,957 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:01,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,959 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:01,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:01,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:02,493 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 12:29:02,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:02,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:02,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:02,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:02,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:02,495 INFO L87 Difference]: Start difference. First operand 13790 states and 20668 transitions. Second operand 3 states. [2019-09-08 12:29:02,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:02,955 INFO L93 Difference]: Finished difference Result 22750 states and 34025 transitions. [2019-09-08 12:29:02,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:02,955 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-09-08 12:29:02,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:02,977 INFO L225 Difference]: With dead ends: 22750 [2019-09-08 12:29:02,977 INFO L226 Difference]: Without dead ends: 9729 [2019-09-08 12:29:02,997 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 12:29:03,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9729 states. [2019-09-08 12:29:03,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9729 to 9727. [2019-09-08 12:29:03,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9727 states. [2019-09-08 12:29:03,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9727 states to 9727 states and 14388 transitions. [2019-09-08 12:29:03,389 INFO L78 Accepts]: Start accepts. Automaton has 9727 states and 14388 transitions. Word has length 174 [2019-09-08 12:29:03,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:03,389 INFO L475 AbstractCegarLoop]: Abstraction has 9727 states and 14388 transitions. [2019-09-08 12:29:03,389 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:03,389 INFO L276 IsEmpty]: Start isEmpty. Operand 9727 states and 14388 transitions. [2019-09-08 12:29:03,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-09-08 12:29:03,401 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:03,402 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 12:29:03,402 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:03,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:03,402 INFO L82 PathProgramCache]: Analyzing trace with hash -697279744, now seen corresponding path program 1 times [2019-09-08 12:29:03,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:03,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:03,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:03,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:03,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:03,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:03,726 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 12:29:03,726 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:03,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:29:03,727 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:29:03,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:29:03,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:29:03,727 INFO L87 Difference]: Start difference. First operand 9727 states and 14388 transitions. Second operand 10 states. [2019-09-08 12:29:08,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:08,711 INFO L93 Difference]: Finished difference Result 80745 states and 119003 transitions. [2019-09-08 12:29:08,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 12:29:08,711 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 174 [2019-09-08 12:29:08,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:08,804 INFO L225 Difference]: With dead ends: 80745 [2019-09-08 12:29:08,804 INFO L226 Difference]: Without dead ends: 71129 [2019-09-08 12:29:08,831 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=266, Invalid=790, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 12:29:08,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71129 states. [2019-09-08 12:29:11,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71129 to 17417. [2019-09-08 12:29:11,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17417 states. [2019-09-08 12:29:11,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17417 states to 17417 states and 25608 transitions. [2019-09-08 12:29:11,201 INFO L78 Accepts]: Start accepts. Automaton has 17417 states and 25608 transitions. Word has length 174 [2019-09-08 12:29:11,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:11,202 INFO L475 AbstractCegarLoop]: Abstraction has 17417 states and 25608 transitions. [2019-09-08 12:29:11,202 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 12:29:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 17417 states and 25608 transitions. [2019-09-08 12:29:11,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 12:29:11,212 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:11,212 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] [2019-09-08 12:29:11,212 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 475227480, now seen corresponding path program 1 times [2019-09-08 12:29:11,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:11,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:11,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:11,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:11,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:11,702 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 12:29:11,703 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:11,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:29:11,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:29:11,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:29:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:29:11,704 INFO L87 Difference]: Start difference. First operand 17417 states and 25608 transitions. Second operand 14 states. [2019-09-08 12:29:19,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:19,364 INFO L93 Difference]: Finished difference Result 94683 states and 138366 transitions. [2019-09-08 12:29:19,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:29:19,364 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 175 [2019-09-08 12:29:19,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:19,435 INFO L225 Difference]: With dead ends: 94683 [2019-09-08 12:29:19,435 INFO L226 Difference]: Without dead ends: 83225 [2019-09-08 12:29:19,463 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:29:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83225 states. [2019-09-08 12:29:22,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83225 to 20549. [2019-09-08 12:29:22,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20549 states. [2019-09-08 12:29:22,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20549 states to 20549 states and 30092 transitions. [2019-09-08 12:29:22,187 INFO L78 Accepts]: Start accepts. Automaton has 20549 states and 30092 transitions. Word has length 175 [2019-09-08 12:29:22,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:22,187 INFO L475 AbstractCegarLoop]: Abstraction has 20549 states and 30092 transitions. [2019-09-08 12:29:22,187 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:29:22,187 INFO L276 IsEmpty]: Start isEmpty. Operand 20549 states and 30092 transitions. [2019-09-08 12:29:22,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-09-08 12:29:22,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:22,200 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] [2019-09-08 12:29:22,200 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1432076387, now seen corresponding path program 1 times [2019-09-08 12:29:22,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:22,201 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:22,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:22,423 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 12:29:22,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:22,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:29:22,427 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:29:22,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:29:22,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:29:22,428 INFO L87 Difference]: Start difference. First operand 20549 states and 30092 transitions. Second operand 8 states. [2019-09-08 12:29:36,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:36,445 INFO L93 Difference]: Finished difference Result 195145 states and 285532 transitions. [2019-09-08 12:29:36,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 12:29:36,445 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 176 [2019-09-08 12:29:36,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:36,607 INFO L225 Difference]: With dead ends: 195145 [2019-09-08 12:29:36,607 INFO L226 Difference]: Without dead ends: 174737 [2019-09-08 12:29:36,655 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-08 12:29:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174737 states. [2019-09-08 12:29:42,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174737 to 60651. [2019-09-08 12:29:42,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60651 states. [2019-09-08 12:29:42,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60651 states to 60651 states and 87744 transitions. [2019-09-08 12:29:42,329 INFO L78 Accepts]: Start accepts. Automaton has 60651 states and 87744 transitions. Word has length 176 [2019-09-08 12:29:42,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:42,329 INFO L475 AbstractCegarLoop]: Abstraction has 60651 states and 87744 transitions. [2019-09-08 12:29:42,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:29:42,329 INFO L276 IsEmpty]: Start isEmpty. Operand 60651 states and 87744 transitions. [2019-09-08 12:29:42,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:29:42,373 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:42,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 12:29:42,374 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:42,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:42,374 INFO L82 PathProgramCache]: Analyzing trace with hash -416737294, now seen corresponding path program 1 times [2019-09-08 12:29:42,374 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:42,374 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:42,376 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:42,376 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:42,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:42,475 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 12:29:42,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:42,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:42,476 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:42,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:42,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:42,477 INFO L87 Difference]: Start difference. First operand 60651 states and 87744 transitions. Second operand 3 states. [2019-09-08 12:29:48,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:48,036 INFO L93 Difference]: Finished difference Result 121165 states and 175331 transitions. [2019-09-08 12:29:48,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:48,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 12:29:48,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:48,094 INFO L225 Difference]: With dead ends: 121165 [2019-09-08 12:29:48,095 INFO L226 Difference]: Without dead ends: 60647 [2019-09-08 12:29:48,143 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:48,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60647 states. [2019-09-08 12:29:52,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60647 to 60647. [2019-09-08 12:29:52,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60647 states. [2019-09-08 12:29:52,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60647 states to 60647 states and 87728 transitions. [2019-09-08 12:29:52,927 INFO L78 Accepts]: Start accepts. Automaton has 60647 states and 87728 transitions. Word has length 179 [2019-09-08 12:29:52,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:52,928 INFO L475 AbstractCegarLoop]: Abstraction has 60647 states and 87728 transitions. [2019-09-08 12:29:52,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:52,928 INFO L276 IsEmpty]: Start isEmpty. Operand 60647 states and 87728 transitions. [2019-09-08 12:29:52,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:29:52,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:52,963 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 12:29:52,963 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:52,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:52,963 INFO L82 PathProgramCache]: Analyzing trace with hash -229509453, now seen corresponding path program 1 times [2019-09-08 12:29:52,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:52,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:52,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:52,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:29:53,085 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 12:29:53,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:29:53,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:29:53,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:29:53,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:29:53,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:29:53,087 INFO L87 Difference]: Start difference. First operand 60647 states and 87728 transitions. Second operand 3 states. [2019-09-08 12:29:55,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:29:55,820 INFO L93 Difference]: Finished difference Result 86547 states and 125334 transitions. [2019-09-08 12:29:55,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:29:55,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 179 [2019-09-08 12:29:55,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:29:55,855 INFO L225 Difference]: With dead ends: 86547 [2019-09-08 12:29:55,855 INFO L226 Difference]: Without dead ends: 33181 [2019-09-08 12:29:55,893 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 12:29:55,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33181 states. [2019-09-08 12:29:59,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33181 to 33179. [2019-09-08 12:29:59,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33179 states. [2019-09-08 12:29:59,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33179 states to 33179 states and 47332 transitions. [2019-09-08 12:29:59,908 INFO L78 Accepts]: Start accepts. Automaton has 33179 states and 47332 transitions. Word has length 179 [2019-09-08 12:29:59,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:29:59,908 INFO L475 AbstractCegarLoop]: Abstraction has 33179 states and 47332 transitions. [2019-09-08 12:29:59,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:29:59,908 INFO L276 IsEmpty]: Start isEmpty. Operand 33179 states and 47332 transitions. [2019-09-08 12:29:59,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-09-08 12:29:59,928 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:29:59,928 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 12:29:59,928 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:29:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:29:59,929 INFO L82 PathProgramCache]: Analyzing trace with hash 389779707, now seen corresponding path program 1 times [2019-09-08 12:29:59,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:29:59,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:29:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:59,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:29:59,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:29:59,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:00,271 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 12:30:00,271 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:00,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:30:00,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:30:00,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:30:00,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:30:00,273 INFO L87 Difference]: Start difference. First operand 33179 states and 47332 transitions. Second operand 14 states. [2019-09-08 12:30:12,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:12,619 INFO L93 Difference]: Finished difference Result 140651 states and 199682 transitions. [2019-09-08 12:30:12,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:30:12,620 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 179 [2019-09-08 12:30:12,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:12,727 INFO L225 Difference]: With dead ends: 140651 [2019-09-08 12:30:12,727 INFO L226 Difference]: Without dead ends: 119178 [2019-09-08 12:30:12,757 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=971, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 12:30:12,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119178 states. [2019-09-08 12:30:16,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119178 to 33463. [2019-09-08 12:30:16,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33463 states. [2019-09-08 12:30:16,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33463 states to 33463 states and 47718 transitions. [2019-09-08 12:30:16,375 INFO L78 Accepts]: Start accepts. Automaton has 33463 states and 47718 transitions. Word has length 179 [2019-09-08 12:30:16,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:16,376 INFO L475 AbstractCegarLoop]: Abstraction has 33463 states and 47718 transitions. [2019-09-08 12:30:16,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:30:16,376 INFO L276 IsEmpty]: Start isEmpty. Operand 33463 states and 47718 transitions. [2019-09-08 12:30:16,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:30:16,396 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:16,397 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, 1] [2019-09-08 12:30:16,397 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:16,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:16,397 INFO L82 PathProgramCache]: Analyzing trace with hash -866630752, now seen corresponding path program 1 times [2019-09-08 12:30:16,398 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:16,398 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:16,398 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:16,399 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:16,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:16,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:30:16,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:16,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:30:16,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:30:16,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:30:16,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:30:16,591 INFO L87 Difference]: Start difference. First operand 33463 states and 47718 transitions. Second operand 8 states. [2019-09-08 12:30:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:30:30,383 INFO L93 Difference]: Finished difference Result 152881 states and 218085 transitions. [2019-09-08 12:30:30,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:30:30,383 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 180 [2019-09-08 12:30:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:30:30,514 INFO L225 Difference]: With dead ends: 152881 [2019-09-08 12:30:30,514 INFO L226 Difference]: Without dead ends: 142795 [2019-09-08 12:30:30,540 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:30:30,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142795 states. [2019-09-08 12:30:36,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142795 to 54705. [2019-09-08 12:30:36,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54705 states. [2019-09-08 12:30:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54705 states to 54705 states and 77514 transitions. [2019-09-08 12:30:36,517 INFO L78 Accepts]: Start accepts. Automaton has 54705 states and 77514 transitions. Word has length 180 [2019-09-08 12:30:36,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:30:36,518 INFO L475 AbstractCegarLoop]: Abstraction has 54705 states and 77514 transitions. [2019-09-08 12:30:36,518 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:30:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 54705 states and 77514 transitions. [2019-09-08 12:30:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:30:36,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:30:36,551 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, 1] [2019-09-08 12:30:36,551 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:30:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:30:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash -2045152957, now seen corresponding path program 1 times [2019-09-08 12:30:36,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:30:36,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:30:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:30:36,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:30:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:30:36,979 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 12:30:36,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:30:36,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 12:30:36,980 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 12:30:36,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 12:30:36,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:30:36,980 INFO L87 Difference]: Start difference. First operand 54705 states and 77514 transitions. Second operand 12 states. [2019-09-08 12:31:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:03,423 INFO L93 Difference]: Finished difference Result 218106 states and 309248 transitions. [2019-09-08 12:31:03,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 12:31:03,424 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2019-09-08 12:31:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:03,594 INFO L225 Difference]: With dead ends: 218106 [2019-09-08 12:31:03,594 INFO L226 Difference]: Without dead ends: 180478 [2019-09-08 12:31:03,638 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=322, Invalid=868, Unknown=0, NotChecked=0, Total=1190 [2019-09-08 12:31:03,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180478 states. [2019-09-08 12:31:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180478 to 61303. [2019-09-08 12:31:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61303 states. [2019-09-08 12:31:11,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61303 states to 61303 states and 86629 transitions. [2019-09-08 12:31:11,970 INFO L78 Accepts]: Start accepts. Automaton has 61303 states and 86629 transitions. Word has length 180 [2019-09-08 12:31:11,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:11,971 INFO L475 AbstractCegarLoop]: Abstraction has 61303 states and 86629 transitions. [2019-09-08 12:31:11,971 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 12:31:11,971 INFO L276 IsEmpty]: Start isEmpty. Operand 61303 states and 86629 transitions. [2019-09-08 12:31:12,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2019-09-08 12:31:12,007 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:12,007 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, 1] [2019-09-08 12:31:12,007 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:12,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:12,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1194243097, now seen corresponding path program 1 times [2019-09-08 12:31:12,008 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:12,008 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:12,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:12,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:12,079 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 12:31:12,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:12,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:31:12,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:31:12,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:31:12,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:31:12,080 INFO L87 Difference]: Start difference. First operand 61303 states and 86629 transitions. Second operand 3 states. [2019-09-08 12:31:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:21,291 INFO L93 Difference]: Finished difference Result 121943 states and 172567 transitions. [2019-09-08 12:31:21,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:31:21,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 180 [2019-09-08 12:31:21,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:21,345 INFO L225 Difference]: With dead ends: 121943 [2019-09-08 12:31:21,346 INFO L226 Difference]: Without dead ends: 60821 [2019-09-08 12:31:21,373 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 12:31:21,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60821 states. [2019-09-08 12:31:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60821 to 60821. [2019-09-08 12:31:28,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60821 states. [2019-09-08 12:31:28,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 85401 transitions. [2019-09-08 12:31:28,464 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 85401 transitions. Word has length 180 [2019-09-08 12:31:28,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:28,465 INFO L475 AbstractCegarLoop]: Abstraction has 60821 states and 85401 transitions. [2019-09-08 12:31:28,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:31:28,465 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 85401 transitions. [2019-09-08 12:31:28,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2019-09-08 12:31:28,504 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:28,504 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, 1, 1] [2019-09-08 12:31:28,505 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:28,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:28,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1601690686, now seen corresponding path program 1 times [2019-09-08 12:31:28,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:28,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:28,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:28,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:28,967 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 12:31:28,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:28,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:31:28,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:31:28,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:31:28,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:31:28,968 INFO L87 Difference]: Start difference. First operand 60821 states and 85401 transitions. Second operand 8 states. [2019-09-08 12:31:37,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:31:37,817 INFO L93 Difference]: Finished difference Result 131657 states and 185136 transitions. [2019-09-08 12:31:37,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:31:37,818 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 181 [2019-09-08 12:31:37,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:31:37,881 INFO L225 Difference]: With dead ends: 131657 [2019-09-08 12:31:37,882 INFO L226 Difference]: Without dead ends: 70993 [2019-09-08 12:31:37,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=41, Invalid=49, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:31:37,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70993 states. [2019-09-08 12:31:45,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70993 to 60821. [2019-09-08 12:31:45,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60821 states. [2019-09-08 12:31:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60821 states to 60821 states and 84793 transitions. [2019-09-08 12:31:45,669 INFO L78 Accepts]: Start accepts. Automaton has 60821 states and 84793 transitions. Word has length 181 [2019-09-08 12:31:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:31:45,670 INFO L475 AbstractCegarLoop]: Abstraction has 60821 states and 84793 transitions. [2019-09-08 12:31:45,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:31:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 60821 states and 84793 transitions. [2019-09-08 12:31:45,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 12:31:45,708 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:31:45,708 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 12:31:45,708 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:31:45,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:31:45,709 INFO L82 PathProgramCache]: Analyzing trace with hash -419666744, now seen corresponding path program 1 times [2019-09-08 12:31:45,709 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:31:45,709 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:31:45,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:45,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:31:45,710 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:31:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:31:45,931 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 12:31:45,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:31:45,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 12:31:45,934 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 12:31:45,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 12:31:45,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-08 12:31:45,937 INFO L87 Difference]: Start difference. First operand 60821 states and 84793 transitions. Second operand 8 states. [2019-09-08 12:32:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:32:07,498 INFO L93 Difference]: Finished difference Result 176628 states and 248150 transitions. [2019-09-08 12:32:07,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 12:32:07,498 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 182 [2019-09-08 12:32:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:32:07,646 INFO L225 Difference]: With dead ends: 176628 [2019-09-08 12:32:07,646 INFO L226 Difference]: Without dead ends: 166994 [2019-09-08 12:32:07,679 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2019-09-08 12:32:07,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166994 states. [2019-09-08 12:32:17,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166994 to 72292. [2019-09-08 12:32:17,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72292 states. [2019-09-08 12:32:17,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72292 states to 72292 states and 100837 transitions. [2019-09-08 12:32:17,775 INFO L78 Accepts]: Start accepts. Automaton has 72292 states and 100837 transitions. Word has length 182 [2019-09-08 12:32:17,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:32:17,775 INFO L475 AbstractCegarLoop]: Abstraction has 72292 states and 100837 transitions. [2019-09-08 12:32:17,775 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 12:32:17,775 INFO L276 IsEmpty]: Start isEmpty. Operand 72292 states and 100837 transitions. [2019-09-08 12:32:17,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-09-08 12:32:17,822 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:32:17,822 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, 1, 1, 1] [2019-09-08 12:32:17,822 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:32:17,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:32:17,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1522190874, now seen corresponding path program 1 times [2019-09-08 12:32:17,823 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:32:17,823 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:32:17,823 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:17,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:32:17,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:32:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:32:18,304 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 12:32:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:32:18,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:32:18,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:32:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:32:18,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:32:18,306 INFO L87 Difference]: Start difference. First operand 72292 states and 100837 transitions. Second operand 14 states. [2019-09-08 12:33:02,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:02,293 INFO L93 Difference]: Finished difference Result 320064 states and 448897 transitions. [2019-09-08 12:33:02,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-09-08 12:33:02,293 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 182 [2019-09-08 12:33:02,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:02,580 INFO L225 Difference]: With dead ends: 320064 [2019-09-08 12:33:02,580 INFO L226 Difference]: Without dead ends: 285886 [2019-09-08 12:33:02,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=339, Invalid=1143, Unknown=0, NotChecked=0, Total=1482 [2019-09-08 12:33:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285886 states. [2019-09-08 12:33:19,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285886 to 90556. [2019-09-08 12:33:19,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90556 states. [2019-09-08 12:33:19,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90556 states to 90556 states and 125524 transitions. [2019-09-08 12:33:19,987 INFO L78 Accepts]: Start accepts. Automaton has 90556 states and 125524 transitions. Word has length 182 [2019-09-08 12:33:19,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:33:19,988 INFO L475 AbstractCegarLoop]: Abstraction has 90556 states and 125524 transitions. [2019-09-08 12:33:19,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:33:19,988 INFO L276 IsEmpty]: Start isEmpty. Operand 90556 states and 125524 transitions. [2019-09-08 12:33:20,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:33:20,049 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:33:20,049 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, 1, 1, 1, 1] [2019-09-08 12:33:20,049 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:33:20,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:33:20,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1284939698, now seen corresponding path program 1 times [2019-09-08 12:33:20,050 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:33:20,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:33:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:20,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:33:20,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:33:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:33:20,165 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 12:33:20,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:33:20,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:33:20,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:33:20,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:33:20,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:33:20,167 INFO L87 Difference]: Start difference. First operand 90556 states and 125524 transitions. Second operand 5 states. [2019-09-08 12:33:42,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:33:42,665 INFO L93 Difference]: Finished difference Result 195215 states and 271942 transitions. [2019-09-08 12:33:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:33:42,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-08 12:33:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:33:42,813 INFO L225 Difference]: With dead ends: 195215 [2019-09-08 12:33:42,813 INFO L226 Difference]: Without dead ends: 163156 [2019-09-08 12:33:42,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:33:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163156 states. [2019-09-08 12:34:07,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163156 to 149846. [2019-09-08 12:34:07,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149846 states. [2019-09-08 12:34:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149846 states to 149846 states and 208610 transitions. [2019-09-08 12:34:08,002 INFO L78 Accepts]: Start accepts. Automaton has 149846 states and 208610 transitions. Word has length 183 [2019-09-08 12:34:08,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:34:08,003 INFO L475 AbstractCegarLoop]: Abstraction has 149846 states and 208610 transitions. [2019-09-08 12:34:08,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:34:08,003 INFO L276 IsEmpty]: Start isEmpty. Operand 149846 states and 208610 transitions. [2019-09-08 12:34:08,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:34:08,114 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:34:08,114 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, 1, 1, 1, 1] [2019-09-08 12:34:08,114 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:34:08,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:34:08,115 INFO L82 PathProgramCache]: Analyzing trace with hash -657180844, now seen corresponding path program 1 times [2019-09-08 12:34:08,115 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:34:08,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:34:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:08,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:34:08,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:34:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:34:08,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 12:34:08,506 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:34:08,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:34:08,507 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:34:08,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:34:08,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:34:08,507 INFO L87 Difference]: Start difference. First operand 149846 states and 208610 transitions. Second operand 5 states. [2019-09-08 12:34:37,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:34:37,861 INFO L93 Difference]: Finished difference Result 227213 states and 318627 transitions. [2019-09-08 12:34:38,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:34:38,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-08 12:34:38,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:34:38,164 INFO L225 Difference]: With dead ends: 227213 [2019-09-08 12:34:38,164 INFO L226 Difference]: Without dead ends: 186568 [2019-09-08 12:34:38,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:34:38,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186568 states. [2019-09-08 12:35:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186568 to 171788. [2019-09-08 12:35:07,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171788 states. [2019-09-08 12:35:07,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171788 states to 171788 states and 239755 transitions. [2019-09-08 12:35:07,882 INFO L78 Accepts]: Start accepts. Automaton has 171788 states and 239755 transitions. Word has length 183 [2019-09-08 12:35:07,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:35:07,883 INFO L475 AbstractCegarLoop]: Abstraction has 171788 states and 239755 transitions. [2019-09-08 12:35:07,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:35:07,883 INFO L276 IsEmpty]: Start isEmpty. Operand 171788 states and 239755 transitions. [2019-09-08 12:35:07,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:35:07,986 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:35:07,986 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, 1, 1, 1, 1] [2019-09-08 12:35:07,986 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:35:07,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:35:07,986 INFO L82 PathProgramCache]: Analyzing trace with hash 703430059, now seen corresponding path program 1 times [2019-09-08 12:35:07,986 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:35:07,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:35:07,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:07,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:35:07,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:35:08,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:35:08,103 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 12:35:08,104 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:35:08,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:35:08,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:35:08,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:35:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:35:08,105 INFO L87 Difference]: Start difference. First operand 171788 states and 239755 transitions. Second operand 5 states. [2019-09-08 12:35:39,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:35:39,441 INFO L93 Difference]: Finished difference Result 271179 states and 380884 transitions. [2019-09-08 12:35:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:35:39,441 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-08 12:35:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:35:39,648 INFO L225 Difference]: With dead ends: 271179 [2019-09-08 12:35:39,648 INFO L226 Difference]: Without dead ends: 208614 [2019-09-08 12:35:39,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:35:39,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208614 states. [2019-09-08 12:36:13,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208614 to 191668. [2019-09-08 12:36:13,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191668 states. [2019-09-08 12:36:14,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191668 states to 191668 states and 267786 transitions. [2019-09-08 12:36:14,065 INFO L78 Accepts]: Start accepts. Automaton has 191668 states and 267786 transitions. Word has length 183 [2019-09-08 12:36:14,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:36:14,066 INFO L475 AbstractCegarLoop]: Abstraction has 191668 states and 267786 transitions. [2019-09-08 12:36:14,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:36:14,066 INFO L276 IsEmpty]: Start isEmpty. Operand 191668 states and 267786 transitions. [2019-09-08 12:36:14,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:36:14,193 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:36:14,193 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, 1, 1, 1, 1] [2019-09-08 12:36:14,193 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:36:14,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:36:14,194 INFO L82 PathProgramCache]: Analyzing trace with hash -2105194156, now seen corresponding path program 1 times [2019-09-08 12:36:14,194 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:36:14,194 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:36:14,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:14,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:36:14,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:36:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:36:14,554 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 12:36:14,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:36:14,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-09-08 12:36:14,554 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-09-08 12:36:14,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-09-08 12:36:14,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-09-08 12:36:14,555 INFO L87 Difference]: Start difference. First operand 191668 states and 267786 transitions. Second operand 14 states. [2019-09-08 12:38:01,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:38:01,903 INFO L93 Difference]: Finished difference Result 755543 states and 1059722 transitions. [2019-09-08 12:38:01,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 12:38:01,904 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 183 [2019-09-08 12:38:01,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:38:02,564 INFO L225 Difference]: With dead ends: 755543 [2019-09-08 12:38:02,564 INFO L226 Difference]: Without dead ends: 569977 [2019-09-08 12:38:02,726 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=278, Invalid=844, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 12:38:03,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569977 states. [2019-09-08 12:38:39,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569977 to 159204. [2019-09-08 12:38:39,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159204 states. [2019-09-08 12:38:39,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159204 states to 159204 states and 222871 transitions. [2019-09-08 12:38:39,856 INFO L78 Accepts]: Start accepts. Automaton has 159204 states and 222871 transitions. Word has length 183 [2019-09-08 12:38:39,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:38:39,857 INFO L475 AbstractCegarLoop]: Abstraction has 159204 states and 222871 transitions. [2019-09-08 12:38:39,857 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-09-08 12:38:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 159204 states and 222871 transitions. [2019-09-08 12:38:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-09-08 12:38:39,958 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:38:39,958 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, 1, 1, 1, 1] [2019-09-08 12:38:39,959 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:38:39,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:38:39,959 INFO L82 PathProgramCache]: Analyzing trace with hash -257360994, now seen corresponding path program 1 times [2019-09-08 12:38:39,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:38:39,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:38:39,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:39,960 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:38:39,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:38:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:38:40,085 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 12:38:40,085 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:38:40,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 12:38:40,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 12:38:40,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 12:38:40,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 12:38:40,087 INFO L87 Difference]: Start difference. First operand 159204 states and 222871 transitions. Second operand 5 states. [2019-09-08 12:39:14,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:39:14,612 INFO L93 Difference]: Finished difference Result 265867 states and 374327 transitions. [2019-09-08 12:39:14,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 12:39:14,613 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 183 [2019-09-08 12:39:14,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:39:14,801 INFO L225 Difference]: With dead ends: 265867 [2019-09-08 12:39:14,802 INFO L226 Difference]: Without dead ends: 193268 [2019-09-08 12:39:14,871 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 12:39:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193268 states. [2019-09-08 12:39:52,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193268 to 177538. [2019-09-08 12:39:52,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177538 states. [2019-09-08 12:39:52,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177538 states to 177538 states and 248576 transitions. [2019-09-08 12:39:52,599 INFO L78 Accepts]: Start accepts. Automaton has 177538 states and 248576 transitions. Word has length 183 [2019-09-08 12:39:52,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:39:52,599 INFO L475 AbstractCegarLoop]: Abstraction has 177538 states and 248576 transitions. [2019-09-08 12:39:52,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 12:39:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 177538 states and 248576 transitions. [2019-09-08 12:39:53,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:39:53,116 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:39:53,117 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, 1, 1, 1, 1, 1] [2019-09-08 12:39:53,117 INFO L418 AbstractCegarLoop]: === Iteration 31 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:39:53,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:39:53,117 INFO L82 PathProgramCache]: Analyzing trace with hash 483817445, now seen corresponding path program 1 times [2019-09-08 12:39:53,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:39:53,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:39:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:53,119 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:39:53,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:39:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:39:53,208 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 12:39:53,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:39:53,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:39:53,208 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:39:53,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:39:53,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:39:53,209 INFO L87 Difference]: Start difference. First operand 177538 states and 248576 transitions. Second operand 3 states. [2019-09-08 12:40:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:11,343 INFO L93 Difference]: Finished difference Result 264743 states and 371139 transitions. [2019-09-08 12:40:11,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:11,344 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 12:40:11,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:11,444 INFO L225 Difference]: With dead ends: 264743 [2019-09-08 12:40:11,445 INFO L226 Difference]: Without dead ends: 98989 [2019-09-08 12:40:11,695 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 12:40:11,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98989 states. [2019-09-08 12:40:28,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98989 to 98987. [2019-09-08 12:40:28,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98987 states. [2019-09-08 12:40:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98987 states to 98987 states and 136340 transitions. [2019-09-08 12:40:28,521 INFO L78 Accepts]: Start accepts. Automaton has 98987 states and 136340 transitions. Word has length 184 [2019-09-08 12:40:28,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:28,521 INFO L475 AbstractCegarLoop]: Abstraction has 98987 states and 136340 transitions. [2019-09-08 12:40:28,521 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 98987 states and 136340 transitions. [2019-09-08 12:40:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:40:28,580 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:28,580 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, 1, 1, 1, 1, 1] [2019-09-08 12:40:28,581 INFO L418 AbstractCegarLoop]: === Iteration 32 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:28,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:28,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1656820827, now seen corresponding path program 1 times [2019-09-08 12:40:28,581 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:28,581 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:28,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:28,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:28,582 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:28,652 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 12:40:28,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:28,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 12:40:28,653 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 12:40:28,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 12:40:28,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 12:40:28,654 INFO L87 Difference]: Start difference. First operand 98987 states and 136340 transitions. Second operand 3 states. [2019-09-08 12:40:39,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 12:40:39,093 INFO L93 Difference]: Finished difference Result 141902 states and 196373 transitions. [2019-09-08 12:40:39,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 12:40:39,094 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-09-08 12:40:39,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 12:40:39,144 INFO L225 Difference]: With dead ends: 141902 [2019-09-08 12:40:39,145 INFO L226 Difference]: Without dead ends: 56242 [2019-09-08 12:40:39,193 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 12:40:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56242 states. [2019-09-08 12:40:52,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56242 to 56240. [2019-09-08 12:40:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56240 states. [2019-09-08 12:40:52,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56240 states to 56240 states and 76414 transitions. [2019-09-08 12:40:52,130 INFO L78 Accepts]: Start accepts. Automaton has 56240 states and 76414 transitions. Word has length 184 [2019-09-08 12:40:52,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 12:40:52,130 INFO L475 AbstractCegarLoop]: Abstraction has 56240 states and 76414 transitions. [2019-09-08 12:40:52,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 12:40:52,131 INFO L276 IsEmpty]: Start isEmpty. Operand 56240 states and 76414 transitions. [2019-09-08 12:40:52,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-09-08 12:40:52,161 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 12:40:52,161 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, 1, 1, 1, 1, 1] [2019-09-08 12:40:52,161 INFO L418 AbstractCegarLoop]: === Iteration 33 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 12:40:52,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 12:40:52,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1454752053, now seen corresponding path program 1 times [2019-09-08 12:40:52,162 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 12:40:52,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 12:40:52,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:52,163 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 12:40:52,163 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 12:40:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 12:40:52,443 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 12:40:52,444 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 12:40:52,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 12:40:52,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 12:40:52,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 12:40:52,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 12:40:52,445 INFO L87 Difference]: Start difference. First operand 56240 states and 76414 transitions. Second operand 10 states.