java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:02:37,344 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:02:37,346 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:02:37,358 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:02:37,358 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:02:37,359 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:02:37,361 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:02:37,362 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:02:37,364 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:02:37,365 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:02:37,366 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:02:37,367 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:02:37,367 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:02:37,368 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:02:37,369 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:02:37,370 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:02:37,371 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:02:37,372 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:02:37,374 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:02:37,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:02:37,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:02:37,378 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:02:37,379 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:02:37,380 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:02:37,382 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:02:37,382 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:02:37,383 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:02:37,384 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:02:37,384 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:02:37,385 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:02:37,385 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:02:37,386 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:02:37,387 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:02:37,387 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:02:37,388 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:02:37,389 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:02:37,389 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:02:37,389 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:02:37,390 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:02:37,390 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:02:37,391 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:02:37,392 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 10:02:37,407 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:02:37,407 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:02:37,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:02:37,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:02:37,408 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:02:37,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:02:37,409 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:02:37,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:02:37,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:02:37,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:02:37,410 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:02:37,410 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:02:37,410 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:02:37,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:02:37,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:02:37,411 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:02:37,411 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:02:37,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:02:37,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:02:37,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:02:37,412 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:02:37,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:02:37,412 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:02:37,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:02:37,413 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:02:37,413 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:02:37,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:02:37,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:02:37,413 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:02:37,444 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:02:37,458 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:02:37,461 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:02:37,463 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:02:37,463 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:02:37,464 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:02:37,527 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e85619d8/e65d147411da4a02b509a14816f894ee/FLAG5fefb1a12 [2019-09-08 10:02:38,073 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:02:38,074 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:02:38,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e85619d8/e65d147411da4a02b509a14816f894ee/FLAG5fefb1a12 [2019-09-08 10:02:38,340 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e85619d8/e65d147411da4a02b509a14816f894ee [2019-09-08 10:02:38,354 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:02:38,356 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:02:38,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:02:38,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:02:38,363 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:02:38,364 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:02:38" (1/1) ... [2019-09-08 10:02:38,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79eba214 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:38, skipping insertion in model container [2019-09-08 10:02:38,368 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:02:38" (1/1) ... [2019-09-08 10:02:38,376 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:02:38,450 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:02:38,955 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:02:38,971 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:02:39,137 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:02:39,164 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:02:39,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39 WrapperNode [2019-09-08 10:02:39,165 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:02:39,165 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:02:39,166 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:02:39,166 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:02:39,176 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,220 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,245 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (1/1) ... [2019-09-08 10:02:39,253 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:02:39,254 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:02:39,254 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:02:39,254 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:02:39,255 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (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 10:02:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:02:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:02:39,334 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:02:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:02:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:02:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:02:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:02:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:02:39,335 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:02:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:02:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:02:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:02:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:02:39,336 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:02:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:02:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:02:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:02:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:02:39,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:02:40,886 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:02:40,886 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:02:40,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:02:40 BoogieIcfgContainer [2019-09-08 10:02:40,889 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:02:40,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:02:40,891 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:02:40,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:02:40,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:02:38" (1/3) ... [2019-09-08 10:02:40,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d443338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:02:40, skipping insertion in model container [2019-09-08 10:02:40,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:02:39" (2/3) ... [2019-09-08 10:02:40,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d443338 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:02:40, skipping insertion in model container [2019-09-08 10:02:40,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:02:40" (3/3) ... [2019-09-08 10:02:40,904 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.ufo.BOUNDED-8.pals.c.v+cfa-reducer.c [2019-09-08 10:02:40,914 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:02:40,936 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 10:02:40,955 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 10:02:41,007 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:02:41,009 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:02:41,009 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:02:41,009 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:02:41,010 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:02:41,010 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:02:41,010 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:02:41,010 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:02:41,010 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:02:41,055 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states. [2019-09-08 10:02:41,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-08 10:02:41,078 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:41,079 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] [2019-09-08 10:02:41,081 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:41,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:41,086 INFO L82 PathProgramCache]: Analyzing trace with hash 2040025279, now seen corresponding path program 1 times [2019-09-08 10:02:41,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:41,088 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:41,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:41,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:41,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:41,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:41,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:41,682 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:41,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:41,700 INFO L87 Difference]: Start difference. First operand 324 states. Second operand 3 states. [2019-09-08 10:02:41,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:41,927 INFO L93 Difference]: Finished difference Result 575 states and 998 transitions. [2019-09-08 10:02:41,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:41,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-09-08 10:02:41,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:41,969 INFO L225 Difference]: With dead ends: 575 [2019-09-08 10:02:41,969 INFO L226 Difference]: Without dead ends: 436 [2019-09-08 10:02:41,976 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 10:02:42,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-09-08 10:02:42,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-09-08 10:02:42,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-09-08 10:02:42,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 718 transitions. [2019-09-08 10:02:42,129 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 718 transitions. Word has length 115 [2019-09-08 10:02:42,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:42,131 INFO L475 AbstractCegarLoop]: Abstraction has 434 states and 718 transitions. [2019-09-08 10:02:42,131 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:42,132 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 718 transitions. [2019-09-08 10:02:42,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 10:02:42,143 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:42,144 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] [2019-09-08 10:02:42,144 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:42,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:42,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1630734110, now seen corresponding path program 1 times [2019-09-08 10:02:42,146 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:42,146 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:42,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:42,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:42,441 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 10:02:42,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:42,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:42,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:42,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:42,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,445 INFO L87 Difference]: Start difference. First operand 434 states and 718 transitions. Second operand 3 states. [2019-09-08 10:02:42,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:42,484 INFO L93 Difference]: Finished difference Result 664 states and 1109 transitions. [2019-09-08 10:02:42,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:42,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 10:02:42,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:42,488 INFO L225 Difference]: With dead ends: 664 [2019-09-08 10:02:42,489 INFO L226 Difference]: Without dead ends: 537 [2019-09-08 10:02:42,491 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 10:02:42,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2019-09-08 10:02:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 535. [2019-09-08 10:02:42,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 535 states. [2019-09-08 10:02:42,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 890 transitions. [2019-09-08 10:02:42,513 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 890 transitions. Word has length 118 [2019-09-08 10:02:42,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:42,514 INFO L475 AbstractCegarLoop]: Abstraction has 535 states and 890 transitions. [2019-09-08 10:02:42,514 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:42,514 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 890 transitions. [2019-09-08 10:02:42,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-08 10:02:42,516 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:42,516 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] [2019-09-08 10:02:42,516 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:42,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:42,517 INFO L82 PathProgramCache]: Analyzing trace with hash 1903519920, now seen corresponding path program 1 times [2019-09-08 10:02:42,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:42,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,519 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:42,519 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:42,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 10:02:42,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:42,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:42,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:42,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:42,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,655 INFO L87 Difference]: Start difference. First operand 535 states and 890 transitions. Second operand 3 states. [2019-09-08 10:02:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:42,703 INFO L93 Difference]: Finished difference Result 1188 states and 1989 transitions. [2019-09-08 10:02:42,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:42,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-08 10:02:42,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:42,709 INFO L225 Difference]: With dead ends: 1188 [2019-09-08 10:02:42,709 INFO L226 Difference]: Without dead ends: 848 [2019-09-08 10:02:42,711 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 848 states. [2019-09-08 10:02:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 848 to 846. [2019-09-08 10:02:42,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-09-08 10:02:42,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1410 transitions. [2019-09-08 10:02:42,743 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1410 transitions. Word has length 118 [2019-09-08 10:02:42,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:42,743 INFO L475 AbstractCegarLoop]: Abstraction has 846 states and 1410 transitions. [2019-09-08 10:02:42,743 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:42,744 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1410 transitions. [2019-09-08 10:02:42,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 10:02:42,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:42,747 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] [2019-09-08 10:02:42,747 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:42,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:42,748 INFO L82 PathProgramCache]: Analyzing trace with hash 1633458995, now seen corresponding path program 1 times [2019-09-08 10:02:42,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:42,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:42,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:42,897 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 10:02:42,897 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:42,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:42,898 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:42,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:42,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:42,899 INFO L87 Difference]: Start difference. First operand 846 states and 1410 transitions. Second operand 3 states. [2019-09-08 10:02:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:42,994 INFO L93 Difference]: Finished difference Result 1466 states and 2456 transitions. [2019-09-08 10:02:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:42,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 10:02:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:43,001 INFO L225 Difference]: With dead ends: 1466 [2019-09-08 10:02:43,002 INFO L226 Difference]: Without dead ends: 1126 [2019-09-08 10:02:43,003 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 10:02:43,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1126 states. [2019-09-08 10:02:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1126 to 1124. [2019-09-08 10:02:43,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-09-08 10:02:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1876 transitions. [2019-09-08 10:02:43,045 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1876 transitions. Word has length 121 [2019-09-08 10:02:43,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:43,046 INFO L475 AbstractCegarLoop]: Abstraction has 1124 states and 1876 transitions. [2019-09-08 10:02:43,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:43,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1876 transitions. [2019-09-08 10:02:43,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-09-08 10:02:43,048 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:43,048 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] [2019-09-08 10:02:43,048 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:43,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:43,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1760173243, now seen corresponding path program 1 times [2019-09-08 10:02:43,049 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:43,049 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,051 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:43,051 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:43,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 10:02:43,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:43,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:43,158 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:43,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:43,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:43,159 INFO L87 Difference]: Start difference. First operand 1124 states and 1876 transitions. Second operand 3 states. [2019-09-08 10:02:43,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:43,244 INFO L93 Difference]: Finished difference Result 2865 states and 4791 transitions. [2019-09-08 10:02:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:43,245 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-09-08 10:02:43,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:43,255 INFO L225 Difference]: With dead ends: 2865 [2019-09-08 10:02:43,255 INFO L226 Difference]: Without dead ends: 1954 [2019-09-08 10:02:43,258 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 10:02:43,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-08 10:02:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1952. [2019-09-08 10:02:43,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1952 states. [2019-09-08 10:02:43,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1952 states to 1952 states and 3247 transitions. [2019-09-08 10:02:43,357 INFO L78 Accepts]: Start accepts. Automaton has 1952 states and 3247 transitions. Word has length 121 [2019-09-08 10:02:43,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:43,358 INFO L475 AbstractCegarLoop]: Abstraction has 1952 states and 3247 transitions. [2019-09-08 10:02:43,358 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:43,358 INFO L276 IsEmpty]: Start isEmpty. Operand 1952 states and 3247 transitions. [2019-09-08 10:02:43,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 10:02:43,360 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:43,360 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] [2019-09-08 10:02:43,361 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:43,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:43,361 INFO L82 PathProgramCache]: Analyzing trace with hash -499105252, now seen corresponding path program 1 times [2019-09-08 10:02:43,361 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:43,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:43,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:43,519 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 10:02:43,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:43,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:43,521 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:43,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:43,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:43,522 INFO L87 Difference]: Start difference. First operand 1952 states and 3247 transitions. Second operand 3 states. [2019-09-08 10:02:43,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:43,638 INFO L93 Difference]: Finished difference Result 3558 states and 5947 transitions. [2019-09-08 10:02:43,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:43,639 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 10:02:43,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:43,653 INFO L225 Difference]: With dead ends: 3558 [2019-09-08 10:02:43,653 INFO L226 Difference]: Without dead ends: 2647 [2019-09-08 10:02:43,657 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 10:02:43,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-09-08 10:02:43,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 2645. [2019-09-08 10:02:43,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2645 states. [2019-09-08 10:02:43,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2645 states to 2645 states and 4402 transitions. [2019-09-08 10:02:43,786 INFO L78 Accepts]: Start accepts. Automaton has 2645 states and 4402 transitions. Word has length 124 [2019-09-08 10:02:43,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:43,787 INFO L475 AbstractCegarLoop]: Abstraction has 2645 states and 4402 transitions. [2019-09-08 10:02:43,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:43,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2645 states and 4402 transitions. [2019-09-08 10:02:43,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-08 10:02:43,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:43,789 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] [2019-09-08 10:02:43,790 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:43,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:43,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1030513194, now seen corresponding path program 1 times [2019-09-08 10:02:43,790 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:43,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:43,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,792 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:43,792 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:43,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:43,891 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 10:02:43,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:43,892 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:43,892 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:43,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:43,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:43,893 INFO L87 Difference]: Start difference. First operand 2645 states and 4402 transitions. Second operand 3 states. [2019-09-08 10:02:44,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:44,176 INFO L93 Difference]: Finished difference Result 7230 states and 12009 transitions. [2019-09-08 10:02:44,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:44,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2019-09-08 10:02:44,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:44,213 INFO L225 Difference]: With dead ends: 7230 [2019-09-08 10:02:44,213 INFO L226 Difference]: Without dead ends: 4816 [2019-09-08 10:02:44,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 10:02:44,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4816 states. [2019-09-08 10:02:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4816 to 4814. [2019-09-08 10:02:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2019-09-08 10:02:44,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 7948 transitions. [2019-09-08 10:02:44,620 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 7948 transitions. Word has length 124 [2019-09-08 10:02:44,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:44,620 INFO L475 AbstractCegarLoop]: Abstraction has 4814 states and 7948 transitions. [2019-09-08 10:02:44,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:44,621 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 7948 transitions. [2019-09-08 10:02:44,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-09-08 10:02:44,623 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:44,623 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] [2019-09-08 10:02:44,624 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:44,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:44,624 INFO L82 PathProgramCache]: Analyzing trace with hash -577751605, now seen corresponding path program 1 times [2019-09-08 10:02:44,624 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:44,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:44,626 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:44,626 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:44,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:44,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:44,885 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 10:02:44,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:44,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:02:44,886 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:02:44,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:02:44,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:02:44,887 INFO L87 Difference]: Start difference. First operand 4814 states and 7948 transitions. Second operand 6 states. [2019-09-08 10:02:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:46,386 INFO L93 Difference]: Finished difference Result 28885 states and 48038 transitions. [2019-09-08 10:02:46,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 10:02:46,387 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 127 [2019-09-08 10:02:46,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:46,514 INFO L225 Difference]: With dead ends: 28885 [2019-09-08 10:02:46,515 INFO L226 Difference]: Without dead ends: 24302 [2019-09-08 10:02:46,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-09-08 10:02:46,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24302 states. [2019-09-08 10:02:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24302 to 9308. [2019-09-08 10:02:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9308 states. [2019-09-08 10:02:47,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9308 states to 9308 states and 15301 transitions. [2019-09-08 10:02:47,337 INFO L78 Accepts]: Start accepts. Automaton has 9308 states and 15301 transitions. Word has length 127 [2019-09-08 10:02:47,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:47,338 INFO L475 AbstractCegarLoop]: Abstraction has 9308 states and 15301 transitions. [2019-09-08 10:02:47,338 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:02:47,338 INFO L276 IsEmpty]: Start isEmpty. Operand 9308 states and 15301 transitions. [2019-09-08 10:02:47,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 10:02:47,339 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:47,340 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:47,340 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:47,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:47,341 INFO L82 PathProgramCache]: Analyzing trace with hash -796598874, now seen corresponding path program 1 times [2019-09-08 10:02:47,341 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:47,341 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:47,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:47,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:47,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 10:02:47,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:47,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:47,494 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:47,495 INFO L87 Difference]: Start difference. First operand 9308 states and 15301 transitions. Second operand 4 states. [2019-09-08 10:02:48,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:48,520 INFO L93 Difference]: Finished difference Result 27309 states and 45168 transitions. [2019-09-08 10:02:48,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:02:48,521 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-09-08 10:02:48,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:48,574 INFO L225 Difference]: With dead ends: 27309 [2019-09-08 10:02:48,574 INFO L226 Difference]: Without dead ends: 18232 [2019-09-08 10:02:48,598 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:48,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18232 states. [2019-09-08 10:02:49,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18232 to 15163. [2019-09-08 10:02:49,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15163 states. [2019-09-08 10:02:49,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15163 states to 15163 states and 24965 transitions. [2019-09-08 10:02:49,988 INFO L78 Accepts]: Start accepts. Automaton has 15163 states and 24965 transitions. Word has length 128 [2019-09-08 10:02:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:49,989 INFO L475 AbstractCegarLoop]: Abstraction has 15163 states and 24965 transitions. [2019-09-08 10:02:49,989 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 15163 states and 24965 transitions. [2019-09-08 10:02:49,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-09-08 10:02:49,991 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:49,991 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:02:49,992 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:49,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:49,992 INFO L82 PathProgramCache]: Analyzing trace with hash 584578538, now seen corresponding path program 1 times [2019-09-08 10:02:49,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:49,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:49,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:49,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:50,099 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 10:02:50,099 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:50,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 10:02:50,100 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 10:02:50,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 10:02:50,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 10:02:50,101 INFO L87 Difference]: Start difference. First operand 15163 states and 24965 transitions. Second operand 3 states. [2019-09-08 10:02:50,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:50,885 INFO L93 Difference]: Finished difference Result 28841 states and 47657 transitions. [2019-09-08 10:02:50,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 10:02:50,885 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-09-08 10:02:50,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:50,940 INFO L225 Difference]: With dead ends: 28841 [2019-09-08 10:02:50,941 INFO L226 Difference]: Without dead ends: 20841 [2019-09-08 10:02:50,963 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 10:02:50,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20841 states. [2019-09-08 10:02:52,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20841 to 20839. [2019-09-08 10:02:52,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20839 states. [2019-09-08 10:02:52,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20839 states to 20839 states and 34253 transitions. [2019-09-08 10:02:52,185 INFO L78 Accepts]: Start accepts. Automaton has 20839 states and 34253 transitions. Word has length 128 [2019-09-08 10:02:52,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:52,186 INFO L475 AbstractCegarLoop]: Abstraction has 20839 states and 34253 transitions. [2019-09-08 10:02:52,186 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 10:02:52,186 INFO L276 IsEmpty]: Start isEmpty. Operand 20839 states and 34253 transitions. [2019-09-08 10:02:52,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-08 10:02:52,187 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:52,188 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] [2019-09-08 10:02:52,188 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:52,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:52,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1013628402, now seen corresponding path program 1 times [2019-09-08 10:02:52,189 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:52,189 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:52,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:52,190 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:52,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:02:52,288 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:52,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:52,289 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:52,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:52,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:52,290 INFO L87 Difference]: Start difference. First operand 20839 states and 34253 transitions. Second operand 4 states. [2019-09-08 10:02:54,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:54,159 INFO L93 Difference]: Finished difference Result 60941 states and 100477 transitions. [2019-09-08 10:02:54,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:02:54,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 129 [2019-09-08 10:02:54,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:54,230 INFO L225 Difference]: With dead ends: 60941 [2019-09-08 10:02:54,230 INFO L226 Difference]: Without dead ends: 40351 [2019-09-08 10:02:54,277 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:02:54,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-08 10:02:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 33920. [2019-09-08 10:02:56,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33920 states. [2019-09-08 10:02:56,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33920 states to 33920 states and 55603 transitions. [2019-09-08 10:02:56,604 INFO L78 Accepts]: Start accepts. Automaton has 33920 states and 55603 transitions. Word has length 129 [2019-09-08 10:02:56,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:02:56,604 INFO L475 AbstractCegarLoop]: Abstraction has 33920 states and 55603 transitions. [2019-09-08 10:02:56,604 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:02:56,604 INFO L276 IsEmpty]: Start isEmpty. Operand 33920 states and 55603 transitions. [2019-09-08 10:02:56,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 10:02:56,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:02:56,606 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] [2019-09-08 10:02:56,606 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:02:56,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:02:56,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1300657133, now seen corresponding path program 1 times [2019-09-08 10:02:56,606 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:02:56,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:02:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:56,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:02:56,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:02:56,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:02:56,705 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 10:02:56,706 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:02:56,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:02:56,706 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:02:56,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:02:56,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:02:56,707 INFO L87 Difference]: Start difference. First operand 33920 states and 55603 transitions. Second operand 4 states. [2019-09-08 10:02:59,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:02:59,249 INFO L93 Difference]: Finished difference Result 98585 states and 162103 transitions. [2019-09-08 10:02:59,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 10:02:59,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 130 [2019-09-08 10:02:59,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:02:59,377 INFO L225 Difference]: With dead ends: 98585 [2019-09-08 10:02:59,378 INFO L226 Difference]: Without dead ends: 64914 [2019-09-08 10:03:00,530 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:03:00,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64914 states. [2019-09-08 10:03:02,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64914 to 54909. [2019-09-08 10:03:02,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54909 states. [2019-09-08 10:03:02,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54909 states to 54909 states and 89761 transitions. [2019-09-08 10:03:02,869 INFO L78 Accepts]: Start accepts. Automaton has 54909 states and 89761 transitions. Word has length 130 [2019-09-08 10:03:02,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:02,869 INFO L475 AbstractCegarLoop]: Abstraction has 54909 states and 89761 transitions. [2019-09-08 10:03:02,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:03:02,870 INFO L276 IsEmpty]: Start isEmpty. Operand 54909 states and 89761 transitions. [2019-09-08 10:03:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-09-08 10:03:02,871 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:02,871 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:02,871 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:02,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:02,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1613171225, now seen corresponding path program 1 times [2019-09-08 10:03:02,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:02,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:02,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:02,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:02,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:02,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:03,003 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 10:03:03,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:03,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 10:03:03,004 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 10:03:03,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 10:03:03,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:03:03,005 INFO L87 Difference]: Start difference. First operand 54909 states and 89761 transitions. Second operand 7 states. [2019-09-08 10:03:14,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:14,709 INFO L93 Difference]: Finished difference Result 266912 states and 437681 transitions. [2019-09-08 10:03:14,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:03:14,710 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 131 [2019-09-08 10:03:14,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:15,049 INFO L225 Difference]: With dead ends: 266912 [2019-09-08 10:03:15,049 INFO L226 Difference]: Without dead ends: 212252 [2019-09-08 10:03:15,139 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2019-09-08 10:03:15,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212252 states. [2019-09-08 10:03:25,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212252 to 148492. [2019-09-08 10:03:25,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 10:03:25,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 241054 transitions. [2019-09-08 10:03:25,921 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 241054 transitions. Word has length 131 [2019-09-08 10:03:25,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:25,922 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 241054 transitions. [2019-09-08 10:03:25,922 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 10:03:25,922 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 241054 transitions. [2019-09-08 10:03:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-08 10:03:25,923 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:25,923 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] [2019-09-08 10:03:25,924 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1715276375, now seen corresponding path program 1 times [2019-09-08 10:03:25,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:25,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:25,926 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:25,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:26,293 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 10:03:26,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:26,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:03:26,299 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:03:26,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:03:26,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:03:26,300 INFO L87 Difference]: Start difference. First operand 148492 states and 241054 transitions. Second operand 6 states. [2019-09-08 10:03:38,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:03:38,989 INFO L93 Difference]: Finished difference Result 353665 states and 575236 transitions. [2019-09-08 10:03:38,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:03:38,989 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 133 [2019-09-08 10:03:38,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:03:39,340 INFO L225 Difference]: With dead ends: 353665 [2019-09-08 10:03:39,340 INFO L226 Difference]: Without dead ends: 205422 [2019-09-08 10:03:39,464 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:03:39,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205422 states. [2019-09-08 10:03:51,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205422 to 148492. [2019-09-08 10:03:51,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148492 states. [2019-09-08 10:03:51,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148492 states to 148492 states and 240429 transitions. [2019-09-08 10:03:51,282 INFO L78 Accepts]: Start accepts. Automaton has 148492 states and 240429 transitions. Word has length 133 [2019-09-08 10:03:51,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:03:51,282 INFO L475 AbstractCegarLoop]: Abstraction has 148492 states and 240429 transitions. [2019-09-08 10:03:51,282 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:03:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 148492 states and 240429 transitions. [2019-09-08 10:03:51,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-08 10:03:51,283 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:03:51,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:03:51,284 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:03:51,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:03:51,284 INFO L82 PathProgramCache]: Analyzing trace with hash -326924610, now seen corresponding path program 1 times [2019-09-08 10:03:51,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:03:51,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:03:51,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:51,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:03:51,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:03:51,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:03:51,568 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 10:03:51,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:03:51,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:03:51,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:03:51,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:03:51,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:03:51,570 INFO L87 Difference]: Start difference. First operand 148492 states and 240429 transitions. Second operand 6 states. [2019-09-08 10:04:11,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:04:11,235 INFO L93 Difference]: Finished difference Result 436044 states and 707875 transitions. [2019-09-08 10:04:11,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:04:11,236 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 136 [2019-09-08 10:04:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:04:12,176 INFO L225 Difference]: With dead ends: 436044 [2019-09-08 10:04:12,176 INFO L226 Difference]: Without dead ends: 287801 [2019-09-08 10:04:12,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:04:12,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287801 states. [2019-09-08 10:04:34,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287801 to 287797. [2019-09-08 10:04:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287797 states. [2019-09-08 10:04:34,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287797 states to 287797 states and 465955 transitions. [2019-09-08 10:04:34,863 INFO L78 Accepts]: Start accepts. Automaton has 287797 states and 465955 transitions. Word has length 136 [2019-09-08 10:04:34,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:04:34,863 INFO L475 AbstractCegarLoop]: Abstraction has 287797 states and 465955 transitions. [2019-09-08 10:04:34,864 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:04:34,864 INFO L276 IsEmpty]: Start isEmpty. Operand 287797 states and 465955 transitions. [2019-09-08 10:04:34,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 10:04:34,865 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:04:34,865 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:04:34,865 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:04:34,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:04:34,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1546637434, now seen corresponding path program 1 times [2019-09-08 10:04:34,866 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:04:34,866 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:04:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:34,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:04:34,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:04:34,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:04:35,036 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 10:04:35,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:04:35,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:04:35,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:04:35,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:04:35,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:04:35,039 INFO L87 Difference]: Start difference. First operand 287797 states and 465955 transitions. Second operand 5 states. [2019-09-08 10:05:06,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:05:06,251 INFO L93 Difference]: Finished difference Result 473705 states and 763150 transitions. [2019-09-08 10:05:06,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:05:06,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 10:05:06,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:05:07,202 INFO L225 Difference]: With dead ends: 473705 [2019-09-08 10:05:07,203 INFO L226 Difference]: Without dead ends: 473703 [2019-09-08 10:05:07,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:05:07,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473703 states. [2019-09-08 10:05:39,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473703 to 292397. [2019-09-08 10:05:39,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292397 states. [2019-09-08 10:05:40,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292397 states to 292397 states and 470510 transitions. [2019-09-08 10:05:40,543 INFO L78 Accepts]: Start accepts. Automaton has 292397 states and 470510 transitions. Word has length 137 [2019-09-08 10:05:40,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:05:40,543 INFO L475 AbstractCegarLoop]: Abstraction has 292397 states and 470510 transitions. [2019-09-08 10:05:40,543 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:05:40,543 INFO L276 IsEmpty]: Start isEmpty. Operand 292397 states and 470510 transitions. [2019-09-08 10:05:40,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:05:40,552 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:05:40,553 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:05:40,553 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:05:40,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:05:40,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2041446640, now seen corresponding path program 1 times [2019-09-08 10:05:40,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:05:40,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:05:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:40,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:40,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:05:40,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:05:41,116 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 10:05:41,116 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 10:05:41,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:05:41,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:05:41,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1395 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 10:05:41,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 10:05:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 10:05:41,554 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 10:05:41,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-09-08 10:05:41,555 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:05:41,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:05:41,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:05:41,556 INFO L87 Difference]: Start difference. First operand 292397 states and 470510 transitions. Second operand 9 states. [2019-09-08 10:06:51,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:06:51,837 INFO L93 Difference]: Finished difference Result 978988 states and 1593906 transitions. [2019-09-08 10:06:51,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-09-08 10:06:51,838 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-09-08 10:06:51,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:06:54,272 INFO L225 Difference]: With dead ends: 978988 [2019-09-08 10:06:54,272 INFO L226 Difference]: Without dead ends: 873902 [2019-09-08 10:06:54,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:06:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873902 states. [2019-09-08 10:07:56,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873902 to 510458. [2019-09-08 10:07:56,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 510458 states. [2019-09-08 10:07:57,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510458 states to 510458 states and 824571 transitions. [2019-09-08 10:07:57,325 INFO L78 Accepts]: Start accepts. Automaton has 510458 states and 824571 transitions. Word has length 167 [2019-09-08 10:07:57,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:07:57,325 INFO L475 AbstractCegarLoop]: Abstraction has 510458 states and 824571 transitions. [2019-09-08 10:07:57,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:07:57,326 INFO L276 IsEmpty]: Start isEmpty. Operand 510458 states and 824571 transitions. [2019-09-08 10:07:57,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:07:57,337 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:07:57,338 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:07:57,338 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:07:57,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:07:57,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1226993252, now seen corresponding path program 1 times [2019-09-08 10:07:57,339 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:07:57,339 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:07:57,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:57,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:07:57,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:07:57,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:07:57,762 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 10:07:57,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:07:57,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 10:07:57,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 10:07:57,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 10:07:57,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 10:07:57,765 INFO L87 Difference]: Start difference. First operand 510458 states and 824571 transitions. Second operand 4 states. [2019-09-08 10:09:13,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:09:13,213 INFO L93 Difference]: Finished difference Result 1034137 states and 1678698 transitions. [2019-09-08 10:09:13,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:09:13,774 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 167 [2019-09-08 10:09:13,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:09:15,266 INFO L225 Difference]: With dead ends: 1034137 [2019-09-08 10:09:15,266 INFO L226 Difference]: Without dead ends: 814205 [2019-09-08 10:09:15,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:09:16,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 814205 states. [2019-09-08 10:10:47,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 814205 to 720736. [2019-09-08 10:10:47,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720736 states. [2019-09-08 10:10:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720736 states to 720736 states and 1167117 transitions. [2019-09-08 10:10:49,327 INFO L78 Accepts]: Start accepts. Automaton has 720736 states and 1167117 transitions. Word has length 167 [2019-09-08 10:10:49,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:10:49,327 INFO L475 AbstractCegarLoop]: Abstraction has 720736 states and 1167117 transitions. [2019-09-08 10:10:49,327 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 10:10:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 720736 states and 1167117 transitions. [2019-09-08 10:10:49,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-09-08 10:10:49,334 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:10:49,335 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:10:49,335 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:10:49,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:10:49,335 INFO L82 PathProgramCache]: Analyzing trace with hash -452129158, now seen corresponding path program 1 times [2019-09-08 10:10:49,336 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:10:49,336 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:10:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:49,337 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:10:49,337 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:10:49,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:10:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-09-08 10:10:49,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:10:49,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:10:49,505 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:10:49,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:10:49,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:10:49,506 INFO L87 Difference]: Start difference. First operand 720736 states and 1167117 transitions. Second operand 6 states. [2019-09-08 10:12:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:12:29,933 INFO L93 Difference]: Finished difference Result 1507793 states and 2452860 transitions. [2019-09-08 10:12:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 10:12:29,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 167 [2019-09-08 10:12:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:12:32,747 INFO L225 Difference]: With dead ends: 1507793 [2019-09-08 10:12:32,747 INFO L226 Difference]: Without dead ends: 1036095 [2019-09-08 10:12:33,274 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:12:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036095 states.