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/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 08:13:58,325 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 08:13:58,327 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 08:13:58,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 08:13:58,339 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 08:13:58,340 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 08:13:58,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 08:13:58,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 08:13:58,344 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 08:13:58,345 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 08:13:58,346 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 08:13:58,347 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 08:13:58,348 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 08:13:58,348 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 08:13:58,349 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 08:13:58,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 08:13:58,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 08:13:58,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 08:13:58,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 08:13:58,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 08:13:58,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 08:13:58,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 08:13:58,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 08:13:58,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 08:13:58,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 08:13:58,361 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 08:13:58,361 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 08:13:58,362 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 08:13:58,363 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 08:13:58,363 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 08:13:58,364 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 08:13:58,365 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 08:13:58,366 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 08:13:58,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 08:13:58,369 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 08:13:58,369 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 08:13:58,371 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 08:13:58,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 08:13:58,372 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 08:13:58,373 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 08:13:58,374 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 08:13:58,375 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 08:13:58,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 08:13:58,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 08:13:58,402 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 08:13:58,402 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 08:13:58,403 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 08:13:58,403 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 08:13:58,403 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 08:13:58,403 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 08:13:58,403 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 08:13:58,404 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 08:13:58,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 08:13:58,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 08:13:58,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 08:13:58,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 08:13:58,406 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 08:13:58,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 08:13:58,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 08:13:58,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 08:13:58,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 08:13:58,407 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 08:13:58,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 08:13:58,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 08:13:58,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 08:13:58,408 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 08:13:58,408 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 08:13:58,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 08:13:58,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 08:13:58,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 08:13:58,409 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 08:13:58,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 08:13:58,464 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 08:13:58,468 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 08:13:58,470 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 08:13:58,470 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 08:13:58,471 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:13:58,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4bf0c56/a0b7ffdee5c64dd6b43d4baa02267064/FLAGdd7f9f105 [2019-09-08 08:13:59,017 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 08:13:59,018 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:13:59,035 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4bf0c56/a0b7ffdee5c64dd6b43d4baa02267064/FLAGdd7f9f105 [2019-09-08 08:13:59,345 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb4bf0c56/a0b7ffdee5c64dd6b43d4baa02267064 [2019-09-08 08:13:59,356 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 08:13:59,358 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 08:13:59,359 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 08:13:59,359 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 08:13:59,361 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 08:13:59,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18312eb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59, skipping insertion in model container [2019-09-08 08:13:59,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,371 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 08:13:59,413 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 08:13:59,759 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:13:59,769 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 08:13:59,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 08:13:59,869 INFO L192 MainTranslator]: Completed translation [2019-09-08 08:13:59,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59 WrapperNode [2019-09-08 08:13:59,869 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 08:13:59,872 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 08:13:59,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 08:13:59,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 08:13:59,888 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,949 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,953 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (1/1) ... [2019-09-08 08:13:59,960 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 08:13:59,961 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 08:13:59,961 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 08:13:59,961 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 08:13:59,962 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (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 08:14:00,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 08:14:00,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 08:14:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 08:14:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 08:14:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 08:14:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 08:14:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 08:14:00,008 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 08:14:00,009 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 08:14:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 08:14:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 08:14:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 08:14:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 08:14:00,009 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 08:14:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 08:14:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 08:14:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 08:14:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 08:14:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 08:14:00,010 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 08:14:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 08:14:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 08:14:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 08:14:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 08:14:00,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 08:14:00,826 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 08:14:00,826 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 08:14:00,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:14:00 BoogieIcfgContainer [2019-09-08 08:14:00,828 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 08:14:00,829 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 08:14:00,829 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 08:14:00,832 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 08:14:00,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 08:13:59" (1/3) ... [2019-09-08 08:14:00,833 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6140f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:14:00, skipping insertion in model container [2019-09-08 08:14:00,833 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 08:13:59" (2/3) ... [2019-09-08 08:14:00,834 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c6140f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 08:14:00, skipping insertion in model container [2019-09-08 08:14:00,834 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 08:14:00" (3/3) ... [2019-09-08 08:14:00,836 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3_overflow.ufo.UNBOUNDED.pals.c [2019-09-08 08:14:00,846 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 08:14:00,854 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 08:14:00,871 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 08:14:00,902 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 08:14:00,903 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 08:14:00,903 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 08:14:00,904 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 08:14:00,904 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 08:14:00,904 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 08:14:00,904 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 08:14:00,905 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 08:14:00,905 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 08:14:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states. [2019-09-08 08:14:00,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-09-08 08:14:00,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:00,940 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] [2019-09-08 08:14:00,942 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:00,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:00,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1847423492, now seen corresponding path program 1 times [2019-09-08 08:14:00,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:00,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:01,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:01,012 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:01,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:01,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:01,383 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 08:14:01,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:01,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:01,393 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:01,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:01,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:01,433 INFO L87 Difference]: Start difference. First operand 167 states. Second operand 5 states. [2019-09-08 08:14:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:01,589 INFO L93 Difference]: Finished difference Result 267 states and 429 transitions. [2019-09-08 08:14:01,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 08:14:01,591 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 59 [2019-09-08 08:14:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:01,604 INFO L225 Difference]: With dead ends: 267 [2019-09-08 08:14:01,604 INFO L226 Difference]: Without dead ends: 162 [2019-09-08 08:14:01,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 08:14:01,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2019-09-08 08:14:01,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2019-09-08 08:14:01,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-09-08 08:14:01,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 234 transitions. [2019-09-08 08:14:01,665 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 234 transitions. Word has length 59 [2019-09-08 08:14:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:01,666 INFO L475 AbstractCegarLoop]: Abstraction has 162 states and 234 transitions. [2019-09-08 08:14:01,666 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:14:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 234 transitions. [2019-09-08 08:14:01,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-09-08 08:14:01,671 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:01,672 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] [2019-09-08 08:14:01,674 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:01,674 INFO L82 PathProgramCache]: Analyzing trace with hash 2059093754, now seen corresponding path program 1 times [2019-09-08 08:14:01,675 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:01,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:01,677 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:01,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:01,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:01,954 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 08:14:01,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:01,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:14:01,956 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:14:01,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:14:01,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:14:01,957 INFO L87 Difference]: Start difference. First operand 162 states and 234 transitions. Second operand 9 states. [2019-09-08 08:14:04,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:04,644 INFO L93 Difference]: Finished difference Result 1014 states and 1574 transitions. [2019-09-08 08:14:04,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-09-08 08:14:04,644 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 88 [2019-09-08 08:14:04,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:04,657 INFO L225 Difference]: With dead ends: 1014 [2019-09-08 08:14:04,657 INFO L226 Difference]: Without dead ends: 918 [2019-09-08 08:14:04,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=215, Invalid=655, Unknown=0, NotChecked=0, Total=870 [2019-09-08 08:14:04,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2019-09-08 08:14:04,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 628. [2019-09-08 08:14:04,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 628 states. [2019-09-08 08:14:04,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 963 transitions. [2019-09-08 08:14:04,772 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 963 transitions. Word has length 88 [2019-09-08 08:14:04,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:04,773 INFO L475 AbstractCegarLoop]: Abstraction has 628 states and 963 transitions. [2019-09-08 08:14:04,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:14:04,774 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 963 transitions. [2019-09-08 08:14:04,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-09-08 08:14:04,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:04,790 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] [2019-09-08 08:14:04,790 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:04,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:04,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1228087367, now seen corresponding path program 1 times [2019-09-08 08:14:04,791 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:04,791 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:04,793 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:04,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:04,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:04,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:05,044 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 08:14:05,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:05,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:14:05,045 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:14:05,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:14:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:14:05,050 INFO L87 Difference]: Start difference. First operand 628 states and 963 transitions. Second operand 6 states. [2019-09-08 08:14:06,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:06,079 INFO L93 Difference]: Finished difference Result 1774 states and 2751 transitions. [2019-09-08 08:14:06,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 08:14:06,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 89 [2019-09-08 08:14:06,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:06,088 INFO L225 Difference]: With dead ends: 1774 [2019-09-08 08:14:06,088 INFO L226 Difference]: Without dead ends: 1212 [2019-09-08 08:14:06,091 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2019-09-08 08:14:06,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 920. [2019-09-08 08:14:06,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 920 states. [2019-09-08 08:14:06,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 920 states to 920 states and 1414 transitions. [2019-09-08 08:14:06,146 INFO L78 Accepts]: Start accepts. Automaton has 920 states and 1414 transitions. Word has length 89 [2019-09-08 08:14:06,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:06,147 INFO L475 AbstractCegarLoop]: Abstraction has 920 states and 1414 transitions. [2019-09-08 08:14:06,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:14:06,147 INFO L276 IsEmpty]: Start isEmpty. Operand 920 states and 1414 transitions. [2019-09-08 08:14:06,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-08 08:14:06,149 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:06,149 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] [2019-09-08 08:14:06,149 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:06,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:06,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1185008209, now seen corresponding path program 1 times [2019-09-08 08:14:06,150 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:06,150 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:06,151 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:06,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:06,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:06,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:06,262 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 08:14:06,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:06,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:14:06,263 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:14:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:14:06,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:14:06,263 INFO L87 Difference]: Start difference. First operand 920 states and 1414 transitions. Second operand 6 states. [2019-09-08 08:14:07,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:07,485 INFO L93 Difference]: Finished difference Result 5109 states and 7947 transitions. [2019-09-08 08:14:07,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:14:07,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 90 [2019-09-08 08:14:07,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:07,510 INFO L225 Difference]: With dead ends: 5109 [2019-09-08 08:14:07,510 INFO L226 Difference]: Without dead ends: 4255 [2019-09-08 08:14:07,515 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:14:07,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4255 states. [2019-09-08 08:14:07,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4255 to 4229. [2019-09-08 08:14:07,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4229 states. [2019-09-08 08:14:07,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4229 states to 4229 states and 6535 transitions. [2019-09-08 08:14:07,703 INFO L78 Accepts]: Start accepts. Automaton has 4229 states and 6535 transitions. Word has length 90 [2019-09-08 08:14:07,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:07,703 INFO L475 AbstractCegarLoop]: Abstraction has 4229 states and 6535 transitions. [2019-09-08 08:14:07,703 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:14:07,704 INFO L276 IsEmpty]: Start isEmpty. Operand 4229 states and 6535 transitions. [2019-09-08 08:14:07,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-08 08:14:07,706 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:07,706 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] [2019-09-08 08:14:07,707 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:07,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:07,707 INFO L82 PathProgramCache]: Analyzing trace with hash -202130626, now seen corresponding path program 1 times [2019-09-08 08:14:07,707 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:07,707 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:07,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:07,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:07,802 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 08:14:07,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:07,803 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 08:14:07,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 08:14:07,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 08:14:07,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 08:14:07,804 INFO L87 Difference]: Start difference. First operand 4229 states and 6535 transitions. Second operand 6 states. [2019-09-08 08:14:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:09,237 INFO L93 Difference]: Finished difference Result 21623 states and 33520 transitions. [2019-09-08 08:14:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 08:14:09,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-09-08 08:14:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:09,347 INFO L225 Difference]: With dead ends: 21623 [2019-09-08 08:14:09,347 INFO L226 Difference]: Without dead ends: 17460 [2019-09-08 08:14:09,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 08:14:09,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17460 states. [2019-09-08 08:14:10,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17460 to 17374. [2019-09-08 08:14:10,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17374 states. [2019-09-08 08:14:10,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17374 states to 17374 states and 26803 transitions. [2019-09-08 08:14:10,106 INFO L78 Accepts]: Start accepts. Automaton has 17374 states and 26803 transitions. Word has length 91 [2019-09-08 08:14:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:10,107 INFO L475 AbstractCegarLoop]: Abstraction has 17374 states and 26803 transitions. [2019-09-08 08:14:10,108 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 08:14:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 17374 states and 26803 transitions. [2019-09-08 08:14:10,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:14:10,111 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:10,111 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:14:10,111 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:10,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:10,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1231990130, now seen corresponding path program 1 times [2019-09-08 08:14:10,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:10,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:10,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:10,115 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:10,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:10,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:10,307 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 08:14:10,307 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:10,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:14:10,308 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:14:10,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:14:10,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:14:10,310 INFO L87 Difference]: Start difference. First operand 17374 states and 26803 transitions. Second operand 9 states. [2019-09-08 08:14:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:13,743 INFO L93 Difference]: Finished difference Result 30573 states and 47366 transitions. [2019-09-08 08:14:13,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 08:14:13,743 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 08:14:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:13,855 INFO L225 Difference]: With dead ends: 30573 [2019-09-08 08:14:13,856 INFO L226 Difference]: Without dead ends: 22354 [2019-09-08 08:14:13,886 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:14:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22354 states. [2019-09-08 08:14:15,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22354 to 19350. [2019-09-08 08:14:15,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19350 states. [2019-09-08 08:14:15,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19350 states to 19350 states and 29865 transitions. [2019-09-08 08:14:15,223 INFO L78 Accepts]: Start accepts. Automaton has 19350 states and 29865 transitions. Word has length 92 [2019-09-08 08:14:15,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:15,226 INFO L475 AbstractCegarLoop]: Abstraction has 19350 states and 29865 transitions. [2019-09-08 08:14:15,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:14:15,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19350 states and 29865 transitions. [2019-09-08 08:14:15,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:14:15,233 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:15,233 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] [2019-09-08 08:14:15,233 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:15,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:15,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1642679078, now seen corresponding path program 1 times [2019-09-08 08:14:15,242 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:15,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:15,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:15,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:15,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:15,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:15,387 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 08:14:15,387 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:15,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:14:15,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:14:15,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:14:15,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:14:15,389 INFO L87 Difference]: Start difference. First operand 19350 states and 29865 transitions. Second operand 9 states. [2019-09-08 08:14:18,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:18,750 INFO L93 Difference]: Finished difference Result 33105 states and 51270 transitions. [2019-09-08 08:14:18,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-09-08 08:14:18,750 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 08:14:18,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:18,834 INFO L225 Difference]: With dead ends: 33105 [2019-09-08 08:14:18,834 INFO L226 Difference]: Without dead ends: 24430 [2019-09-08 08:14:18,868 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=238, Invalid=884, Unknown=0, NotChecked=0, Total=1122 [2019-09-08 08:14:18,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24430 states. [2019-09-08 08:14:19,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24430 to 21169. [2019-09-08 08:14:19,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21169 states. [2019-09-08 08:14:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21169 states to 21169 states and 32653 transitions. [2019-09-08 08:14:19,760 INFO L78 Accepts]: Start accepts. Automaton has 21169 states and 32653 transitions. Word has length 92 [2019-09-08 08:14:19,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:19,761 INFO L475 AbstractCegarLoop]: Abstraction has 21169 states and 32653 transitions. [2019-09-08 08:14:19,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:14:19,761 INFO L276 IsEmpty]: Start isEmpty. Operand 21169 states and 32653 transitions. [2019-09-08 08:14:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-08 08:14:19,765 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:19,765 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] [2019-09-08 08:14:19,766 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:19,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:19,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1811658150, now seen corresponding path program 1 times [2019-09-08 08:14:19,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:19,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:19,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:19,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:19,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:19,911 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 08:14:19,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:19,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 08:14:19,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 08:14:19,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 08:14:19,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 08:14:19,913 INFO L87 Difference]: Start difference. First operand 21169 states and 32653 transitions. Second operand 9 states. [2019-09-08 08:14:23,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:23,198 INFO L93 Difference]: Finished difference Result 32080 states and 49702 transitions. [2019-09-08 08:14:23,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-09-08 08:14:23,199 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 92 [2019-09-08 08:14:23,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:23,303 INFO L225 Difference]: With dead ends: 32080 [2019-09-08 08:14:23,304 INFO L226 Difference]: Without dead ends: 24364 [2019-09-08 08:14:23,336 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=829, Unknown=0, NotChecked=0, Total=1056 [2019-09-08 08:14:23,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24364 states. [2019-09-08 08:14:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24364 to 17206. [2019-09-08 08:14:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17206 states. [2019-09-08 08:14:24,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17206 states to 17206 states and 26500 transitions. [2019-09-08 08:14:24,157 INFO L78 Accepts]: Start accepts. Automaton has 17206 states and 26500 transitions. Word has length 92 [2019-09-08 08:14:24,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:24,158 INFO L475 AbstractCegarLoop]: Abstraction has 17206 states and 26500 transitions. [2019-09-08 08:14:24,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 08:14:24,158 INFO L276 IsEmpty]: Start isEmpty. Operand 17206 states and 26500 transitions. [2019-09-08 08:14:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:14:24,168 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:24,168 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] [2019-09-08 08:14:24,169 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:24,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:24,169 INFO L82 PathProgramCache]: Analyzing trace with hash -785378954, now seen corresponding path program 1 times [2019-09-08 08:14:24,169 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:24,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:24,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:24,170 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:24,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:24,242 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 08:14:24,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:24,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 08:14:24,242 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 08:14:24,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 08:14:24,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:14:24,243 INFO L87 Difference]: Start difference. First operand 17206 states and 26500 transitions. Second operand 4 states. [2019-09-08 08:14:25,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:25,846 INFO L93 Difference]: Finished difference Result 58569 states and 90780 transitions. [2019-09-08 08:14:25,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 08:14:25,846 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-09-08 08:14:25,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:25,968 INFO L225 Difference]: With dead ends: 58569 [2019-09-08 08:14:25,968 INFO L226 Difference]: Without dead ends: 41429 [2019-09-08 08:14:26,028 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 08:14:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41429 states. [2019-09-08 08:14:27,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41429 to 41425. [2019-09-08 08:14:27,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41425 states. [2019-09-08 08:14:27,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41425 states to 41425 states and 63244 transitions. [2019-09-08 08:14:27,452 INFO L78 Accepts]: Start accepts. Automaton has 41425 states and 63244 transitions. Word has length 93 [2019-09-08 08:14:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:27,453 INFO L475 AbstractCegarLoop]: Abstraction has 41425 states and 63244 transitions. [2019-09-08 08:14:27,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 08:14:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 41425 states and 63244 transitions. [2019-09-08 08:14:27,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:14:27,456 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:27,456 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] [2019-09-08 08:14:27,456 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:27,456 INFO L82 PathProgramCache]: Analyzing trace with hash -2147449061, now seen corresponding path program 1 times [2019-09-08 08:14:27,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:27,457 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:27,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:27,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:27,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:27,591 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 08:14:27,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:27,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 08:14:27,592 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 08:14:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 08:14:27,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-09-08 08:14:27,593 INFO L87 Difference]: Start difference. First operand 41425 states and 63244 transitions. Second operand 10 states. [2019-09-08 08:14:33,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:33,836 INFO L93 Difference]: Finished difference Result 104125 states and 163067 transitions. [2019-09-08 08:14:33,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2019-09-08 08:14:33,837 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 93 [2019-09-08 08:14:33,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:34,187 INFO L225 Difference]: With dead ends: 104125 [2019-09-08 08:14:34,187 INFO L226 Difference]: Without dead ends: 86031 [2019-09-08 08:14:34,243 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=479, Invalid=1683, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 08:14:34,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86031 states. [2019-09-08 08:14:37,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86031 to 80646. [2019-09-08 08:14:37,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80646 states. [2019-09-08 08:14:37,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80646 states to 80646 states and 124015 transitions. [2019-09-08 08:14:37,901 INFO L78 Accepts]: Start accepts. Automaton has 80646 states and 124015 transitions. Word has length 93 [2019-09-08 08:14:37,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:37,901 INFO L475 AbstractCegarLoop]: Abstraction has 80646 states and 124015 transitions. [2019-09-08 08:14:37,901 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 08:14:37,901 INFO L276 IsEmpty]: Start isEmpty. Operand 80646 states and 124015 transitions. [2019-09-08 08:14:37,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-08 08:14:37,905 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:37,905 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] [2019-09-08 08:14:37,905 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:37,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:37,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1445849187, now seen corresponding path program 1 times [2019-09-08 08:14:37,906 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:37,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:37,907 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:37,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:37,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:37,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:37,987 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 08:14:37,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:37,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:14:37,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:14:37,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:14:37,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:14:37,989 INFO L87 Difference]: Start difference. First operand 80646 states and 124015 transitions. Second operand 5 states. [2019-09-08 08:14:42,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:42,668 INFO L93 Difference]: Finished difference Result 193315 states and 300884 transitions. [2019-09-08 08:14:42,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:14:42,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-09-08 08:14:42,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:43,192 INFO L225 Difference]: With dead ends: 193315 [2019-09-08 08:14:43,193 INFO L226 Difference]: Without dead ends: 136887 [2019-09-08 08:14:43,305 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:14:43,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136887 states. [2019-09-08 08:14:48,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136887 to 135957. [2019-09-08 08:14:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135957 states. [2019-09-08 08:14:48,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135957 states to 135957 states and 210729 transitions. [2019-09-08 08:14:48,308 INFO L78 Accepts]: Start accepts. Automaton has 135957 states and 210729 transitions. Word has length 93 [2019-09-08 08:14:48,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:14:48,309 INFO L475 AbstractCegarLoop]: Abstraction has 135957 states and 210729 transitions. [2019-09-08 08:14:48,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:14:48,309 INFO L276 IsEmpty]: Start isEmpty. Operand 135957 states and 210729 transitions. [2019-09-08 08:14:48,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:14:48,313 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:14:48,313 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 08:14:48,313 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:14:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:14:48,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1124147, now seen corresponding path program 1 times [2019-09-08 08:14:48,314 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:14:48,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:14:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:48,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:14:48,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:14:48,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:14:48,458 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 08:14:48,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:14:48,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:14:48,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:14:48,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:14:48,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:14:48,461 INFO L87 Difference]: Start difference. First operand 135957 states and 210729 transitions. Second operand 11 states. [2019-09-08 08:14:55,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:14:55,793 INFO L93 Difference]: Finished difference Result 312058 states and 494030 transitions. [2019-09-08 08:14:55,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:14:55,793 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-08 08:14:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:14:56,479 INFO L225 Difference]: With dead ends: 312058 [2019-09-08 08:14:56,479 INFO L226 Difference]: Without dead ends: 190228 [2019-09-08 08:14:56,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:14:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190228 states. [2019-09-08 08:15:05,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190228 to 153292. [2019-09-08 08:15:05,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153292 states. [2019-09-08 08:15:06,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153292 states to 153292 states and 241057 transitions. [2019-09-08 08:15:06,329 INFO L78 Accepts]: Start accepts. Automaton has 153292 states and 241057 transitions. Word has length 94 [2019-09-08 08:15:06,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:06,330 INFO L475 AbstractCegarLoop]: Abstraction has 153292 states and 241057 transitions. [2019-09-08 08:15:06,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:15:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 153292 states and 241057 transitions. [2019-09-08 08:15:06,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-08 08:15:06,333 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:06,333 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] [2019-09-08 08:15:06,333 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:06,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:06,334 INFO L82 PathProgramCache]: Analyzing trace with hash -235590489, now seen corresponding path program 1 times [2019-09-08 08:15:06,334 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:06,334 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:06,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:06,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:06,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:06,477 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 08:15:06,478 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:06,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 08:15:06,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 08:15:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 08:15:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-08 08:15:06,480 INFO L87 Difference]: Start difference. First operand 153292 states and 241057 transitions. Second operand 11 states. [2019-09-08 08:15:14,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:14,690 INFO L93 Difference]: Finished difference Result 364125 states and 584124 transitions. [2019-09-08 08:15:14,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-09-08 08:15:14,691 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 94 [2019-09-08 08:15:14,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:15,437 INFO L225 Difference]: With dead ends: 364125 [2019-09-08 08:15:15,438 INFO L226 Difference]: Without dead ends: 225565 [2019-09-08 08:15:16,155 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2019-09-08 08:15:16,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225565 states. [2019-09-08 08:15:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225565 to 151763. [2019-09-08 08:15:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151763 states. [2019-09-08 08:15:22,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151763 states to 151763 states and 237667 transitions. [2019-09-08 08:15:22,202 INFO L78 Accepts]: Start accepts. Automaton has 151763 states and 237667 transitions. Word has length 94 [2019-09-08 08:15:22,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:22,202 INFO L475 AbstractCegarLoop]: Abstraction has 151763 states and 237667 transitions. [2019-09-08 08:15:22,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 08:15:22,203 INFO L276 IsEmpty]: Start isEmpty. Operand 151763 states and 237667 transitions. [2019-09-08 08:15:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 08:15:22,206 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:22,206 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] [2019-09-08 08:15:22,206 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:22,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:22,206 INFO L82 PathProgramCache]: Analyzing trace with hash 1544800193, now seen corresponding path program 1 times [2019-09-08 08:15:22,207 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:22,207 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:22,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:22,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:22,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:15:22,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:22,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:15:22,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:15:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:15:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:15:22,340 INFO L87 Difference]: Start difference. First operand 151763 states and 237667 transitions. Second operand 5 states. [2019-09-08 08:15:31,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:15:31,866 INFO L93 Difference]: Finished difference Result 451738 states and 720158 transitions. [2019-09-08 08:15:31,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:15:31,866 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-09-08 08:15:31,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:15:32,659 INFO L225 Difference]: With dead ends: 451738 [2019-09-08 08:15:32,659 INFO L226 Difference]: Without dead ends: 299989 [2019-09-08 08:15:32,856 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:15:33,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299989 states. [2019-09-08 08:15:45,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299989 to 299987. [2019-09-08 08:15:45,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299987 states. [2019-09-08 08:15:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299987 states to 299987 states and 463803 transitions. [2019-09-08 08:15:46,523 INFO L78 Accepts]: Start accepts. Automaton has 299987 states and 463803 transitions. Word has length 95 [2019-09-08 08:15:46,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:15:46,524 INFO L475 AbstractCegarLoop]: Abstraction has 299987 states and 463803 transitions. [2019-09-08 08:15:46,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:15:46,524 INFO L276 IsEmpty]: Start isEmpty. Operand 299987 states and 463803 transitions. [2019-09-08 08:15:46,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:15:46,529 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:15:46,529 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] [2019-09-08 08:15:46,529 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:15:46,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:15:46,529 INFO L82 PathProgramCache]: Analyzing trace with hash -798140578, now seen corresponding path program 1 times [2019-09-08 08:15:46,530 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:15:46,530 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:15:46,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:46,531 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:15:46,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:15:46,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:15:46,610 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 08:15:46,610 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:15:46,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:15:46,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:15:46,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:15:46,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:15:46,611 INFO L87 Difference]: Start difference. First operand 299987 states and 463803 transitions. Second operand 5 states. [2019-09-08 08:16:03,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:03,081 INFO L93 Difference]: Finished difference Result 694349 states and 1078551 transitions. [2019-09-08 08:16:03,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 08:16:03,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:16:03,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:16:04,285 INFO L225 Difference]: With dead ends: 694349 [2019-09-08 08:16:04,285 INFO L226 Difference]: Without dead ends: 394690 [2019-09-08 08:16:04,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:16:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394690 states. [2019-09-08 08:16:29,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394690 to 384035. [2019-09-08 08:16:29,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384035 states. [2019-09-08 08:16:30,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384035 states to 384035 states and 593654 transitions. [2019-09-08 08:16:30,301 INFO L78 Accepts]: Start accepts. Automaton has 384035 states and 593654 transitions. Word has length 96 [2019-09-08 08:16:30,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:16:30,302 INFO L475 AbstractCegarLoop]: Abstraction has 384035 states and 593654 transitions. [2019-09-08 08:16:30,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:16:30,302 INFO L276 IsEmpty]: Start isEmpty. Operand 384035 states and 593654 transitions. [2019-09-08 08:16:30,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:16:30,307 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:16:30,307 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] [2019-09-08 08:16:30,307 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:16:30,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:16:30,307 INFO L82 PathProgramCache]: Analyzing trace with hash -893746222, now seen corresponding path program 1 times [2019-09-08 08:16:30,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:16:30,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:16:30,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:30,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:16:30,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:16:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:16:30,420 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 08:16:30,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:16:30,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:16:30,421 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:16:30,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:16:30,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:16:30,421 INFO L87 Difference]: Start difference. First operand 384035 states and 593654 transitions. Second operand 5 states. [2019-09-08 08:16:58,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:16:58,906 INFO L93 Difference]: Finished difference Result 1118932 states and 1772020 transitions. [2019-09-08 08:16:58,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:16:58,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-09-08 08:16:58,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:17:01,028 INFO L225 Difference]: With dead ends: 1118932 [2019-09-08 08:17:01,028 INFO L226 Difference]: Without dead ends: 734929 [2019-09-08 08:17:01,649 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:17:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734929 states. [2019-09-08 08:17:51,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734929 to 734927. [2019-09-08 08:17:51,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734927 states. [2019-09-08 08:17:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734927 states to 734927 states and 1115467 transitions. [2019-09-08 08:17:54,361 INFO L78 Accepts]: Start accepts. Automaton has 734927 states and 1115467 transitions. Word has length 96 [2019-09-08 08:17:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:17:54,361 INFO L475 AbstractCegarLoop]: Abstraction has 734927 states and 1115467 transitions. [2019-09-08 08:17:54,362 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 08:17:54,362 INFO L276 IsEmpty]: Start isEmpty. Operand 734927 states and 1115467 transitions. [2019-09-08 08:17:54,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-08 08:17:54,367 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:17:54,367 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] [2019-09-08 08:17:54,367 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:17:54,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:17:54,368 INFO L82 PathProgramCache]: Analyzing trace with hash 679963453, now seen corresponding path program 1 times [2019-09-08 08:17:54,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:17:54,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:17:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:54,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:17:54,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:17:54,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:17:54,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 08:17:54,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:17:54,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 08:17:54,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 08:17:54,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 08:17:54,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 08:17:54,408 INFO L87 Difference]: Start difference. First operand 734927 states and 1115467 transitions. Second operand 3 states. [2019-09-08 08:18:24,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:18:24,896 INFO L93 Difference]: Finished difference Result 1098080 states and 1665974 transitions. [2019-09-08 08:18:24,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 08:18:24,896 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-08 08:18:24,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:18:27,859 INFO L225 Difference]: With dead ends: 1098080 [2019-09-08 08:18:27,860 INFO L226 Difference]: Without dead ends: 735119 [2019-09-08 08:18:28,269 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 08:18:28,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735119 states. [2019-09-08 08:19:22,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735119 to 734929. [2019-09-08 08:19:22,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 734929 states. [2019-09-08 08:19:24,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734929 states to 734929 states and 1115469 transitions. [2019-09-08 08:19:24,134 INFO L78 Accepts]: Start accepts. Automaton has 734929 states and 1115469 transitions. Word has length 96 [2019-09-08 08:19:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 08:19:24,135 INFO L475 AbstractCegarLoop]: Abstraction has 734929 states and 1115469 transitions. [2019-09-08 08:19:24,135 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 08:19:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 734929 states and 1115469 transitions. [2019-09-08 08:19:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 08:19:24,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 08:19:24,141 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] [2019-09-08 08:19:24,141 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 08:19:24,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 08:19:24,141 INFO L82 PathProgramCache]: Analyzing trace with hash 938283974, now seen corresponding path program 1 times [2019-09-08 08:19:24,141 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 08:19:24,141 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 08:19:24,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:24,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 08:19:24,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 08:19:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 08:19:24,237 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 08:19:24,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 08:19:24,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 08:19:24,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 08:19:24,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 08:19:24,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 08:19:24,238 INFO L87 Difference]: Start difference. First operand 734929 states and 1115469 transitions. Second operand 5 states. [2019-09-08 08:20:24,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 08:20:24,738 INFO L93 Difference]: Finished difference Result 1912833 states and 2956829 transitions. [2019-09-08 08:20:24,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 08:20:24,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-08 08:20:24,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 08:20:29,111 INFO L225 Difference]: With dead ends: 1912833 [2019-09-08 08:20:29,112 INFO L226 Difference]: Without dead ends: 1177964 [2019-09-08 08:20:31,229 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 08:20:31,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1177964 states.