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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 06:12:53,060 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 06:12:53,062 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 06:12:53,073 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 06:12:53,074 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 06:12:53,075 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 06:12:53,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 06:12:53,078 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 06:12:53,079 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 06:12:53,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 06:12:53,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 06:12:53,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 06:12:53,083 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 06:12:53,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 06:12:53,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 06:12:53,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 06:12:53,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 06:12:53,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 06:12:53,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 06:12:53,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 06:12:53,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 06:12:53,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 06:12:53,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 06:12:53,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 06:12:53,098 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 06:12:53,099 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 06:12:53,099 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 06:12:53,100 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 06:12:53,100 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 06:12:53,101 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 06:12:53,101 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 06:12:53,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 06:12:53,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 06:12:53,103 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 06:12:53,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 06:12:53,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 06:12:53,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 06:12:53,106 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 06:12:53,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 06:12:53,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 06:12:53,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 06:12:53,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 06:12:53,132 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 06:12:53,132 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 06:12:53,133 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 06:12:53,133 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 06:12:53,133 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 06:12:53,134 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 06:12:53,134 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 06:12:53,134 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 06:12:53,134 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 06:12:53,135 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 06:12:53,136 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 06:12:53,136 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 06:12:53,136 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 06:12:53,136 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 06:12:53,137 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 06:12:53,137 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 06:12:53,137 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 06:12:53,137 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 06:12:53,137 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 06:12:53,137 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 06:12:53,138 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 06:12:53,138 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 06:12:53,138 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 06:12:53,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 06:12:53,139 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 06:12:53,139 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 06:12:53,139 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 06:12:53,140 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 06:12:53,140 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 06:12:53,140 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 06:12:53,197 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 06:12:53,209 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 06:12:53,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 06:12:53,213 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 06:12:53,214 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 06:12:53,214 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:12:53,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f0708ea/2ef0e70ba89d4df09ed1e14cca550be3/FLAGa6def2b05 [2019-09-10 06:12:53,738 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 06:12:53,739 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:12:53,757 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f0708ea/2ef0e70ba89d4df09ed1e14cca550be3/FLAGa6def2b05 [2019-09-10 06:12:54,085 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/33f0708ea/2ef0e70ba89d4df09ed1e14cca550be3 [2019-09-10 06:12:54,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 06:12:54,098 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 06:12:54,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:54,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 06:12:54,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 06:12:54,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b46dfdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54, skipping insertion in model container [2019-09-10 06:12:54,106 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,112 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 06:12:54,168 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 06:12:54,629 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:54,649 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 06:12:54,807 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 06:12:54,837 INFO L192 MainTranslator]: Completed translation [2019-09-10 06:12:54,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54 WrapperNode [2019-09-10 06:12:54,838 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 06:12:54,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 06:12:54,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 06:12:54,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 06:12:54,848 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,848 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (1/1) ... [2019-09-10 06:12:54,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 06:12:54,948 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 06:12:54,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 06:12:54,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 06:12:54,950 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (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-10 06:12:55,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 06:12:55,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 06:12:55,033 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 06:12:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 06:12:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 06:12:55,033 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 06:12:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 06:12:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 06:12:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 06:12:55,034 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 06:12:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 06:12:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 06:12:55,036 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 06:12:55,037 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 06:12:55,037 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 06:12:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 06:12:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 06:12:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 06:12:55,038 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 06:12:55,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 06:12:56,444 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 06:12:56,444 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 06:12:56,447 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:56 BoogieIcfgContainer [2019-09-10 06:12:56,447 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 06:12:56,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 06:12:56,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 06:12:56,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 06:12:56,452 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 06:12:54" (1/3) ... [2019-09-10 06:12:56,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f46a192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:56, skipping insertion in model container [2019-09-10 06:12:56,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 06:12:54" (2/3) ... [2019-09-10 06:12:56,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f46a192 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 06:12:56, skipping insertion in model container [2019-09-10 06:12:56,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 06:12:56" (3/3) ... [2019-09-10 06:12:56,460 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 06:12:56,470 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 06:12:56,492 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 06:12:56,510 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 06:12:56,543 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 06:12:56,543 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 06:12:56,543 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 06:12:56,544 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 06:12:56,544 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 06:12:56,544 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 06:12:56,544 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 06:12:56,544 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 06:12:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states. [2019-09-10 06:12:56,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-10 06:12:56,632 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:56,633 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:56,635 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:56,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:56,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1495088547, now seen corresponding path program 1 times [2019-09-10 06:12:56,643 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:56,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:56,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:56,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:57,202 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-10 06:12:57,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:57,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:57,205 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:57,211 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:57,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:57,228 INFO L87 Difference]: Start difference. First operand 319 states. Second operand 3 states. [2019-09-10 06:12:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:57,372 INFO L93 Difference]: Finished difference Result 446 states and 765 transitions. [2019-09-10 06:12:57,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:57,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-09-10 06:12:57,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:57,392 INFO L225 Difference]: With dead ends: 446 [2019-09-10 06:12:57,392 INFO L226 Difference]: Without dead ends: 438 [2019-09-10 06:12:57,394 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-10 06:12:57,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-10 06:12:57,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 435. [2019-09-10 06:12:57,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-09-10 06:12:57,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 726 transitions. [2019-09-10 06:12:57,488 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 726 transitions. Word has length 102 [2019-09-10 06:12:57,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:57,489 INFO L475 AbstractCegarLoop]: Abstraction has 435 states and 726 transitions. [2019-09-10 06:12:57,489 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:57,489 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 726 transitions. [2019-09-10 06:12:57,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-09-10 06:12:57,493 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:57,493 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:57,493 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:57,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:57,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1002553119, now seen corresponding path program 1 times [2019-09-10 06:12:57,495 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:57,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:57,500 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:57,500 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:57,500 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:57,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:57,855 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-10 06:12:57,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:57,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:57,855 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:57,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:57,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:57,858 INFO L87 Difference]: Start difference. First operand 435 states and 726 transitions. Second operand 3 states. [2019-09-10 06:12:57,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:57,900 INFO L93 Difference]: Finished difference Result 671 states and 1113 transitions. [2019-09-10 06:12:57,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:57,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-09-10 06:12:57,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:57,909 INFO L225 Difference]: With dead ends: 671 [2019-09-10 06:12:57,909 INFO L226 Difference]: Without dead ends: 671 [2019-09-10 06:12:57,910 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-10 06:12:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-09-10 06:12:57,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 667. [2019-09-10 06:12:57,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 667 states. [2019-09-10 06:12:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 1110 transitions. [2019-09-10 06:12:57,949 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 1110 transitions. Word has length 105 [2019-09-10 06:12:57,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:57,949 INFO L475 AbstractCegarLoop]: Abstraction has 667 states and 1110 transitions. [2019-09-10 06:12:57,950 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:57,950 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 1110 transitions. [2019-09-10 06:12:57,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-09-10 06:12:57,952 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:57,952 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:57,952 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:57,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:57,953 INFO L82 PathProgramCache]: Analyzing trace with hash 1754696449, now seen corresponding path program 1 times [2019-09-10 06:12:57,953 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:57,954 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:57,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:57,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:57,955 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:58,139 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-10 06:12:58,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:58,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:58,140 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:58,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:58,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:58,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:58,144 INFO L87 Difference]: Start difference. First operand 667 states and 1110 transitions. Second operand 3 states. [2019-09-10 06:12:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:58,187 INFO L93 Difference]: Finished difference Result 1117 states and 1843 transitions. [2019-09-10 06:12:58,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:58,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 108 [2019-09-10 06:12:58,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:58,197 INFO L225 Difference]: With dead ends: 1117 [2019-09-10 06:12:58,198 INFO L226 Difference]: Without dead ends: 1117 [2019-09-10 06:12:58,198 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-10 06:12:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1117 states. [2019-09-10 06:12:58,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1117 to 1111. [2019-09-10 06:12:58,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-09-10 06:12:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1838 transitions. [2019-09-10 06:12:58,227 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1838 transitions. Word has length 108 [2019-09-10 06:12:58,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:58,228 INFO L475 AbstractCegarLoop]: Abstraction has 1111 states and 1838 transitions. [2019-09-10 06:12:58,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:58,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1838 transitions. [2019-09-10 06:12:58,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 06:12:58,231 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:58,232 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:58,232 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:58,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:58,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1073140101, now seen corresponding path program 1 times [2019-09-10 06:12:58,233 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:58,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:58,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,235 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:58,375 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-10 06:12:58,376 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:58,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:12:58,376 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:58,377 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:12:58,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:12:58,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:12:58,378 INFO L87 Difference]: Start difference. First operand 1111 states and 1838 transitions. Second operand 3 states. [2019-09-10 06:12:58,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:58,442 INFO L93 Difference]: Finished difference Result 1969 states and 3223 transitions. [2019-09-10 06:12:58,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:12:58,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-09-10 06:12:58,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:58,460 INFO L225 Difference]: With dead ends: 1969 [2019-09-10 06:12:58,460 INFO L226 Difference]: Without dead ends: 1969 [2019-09-10 06:12:58,461 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-10 06:12:58,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-09-10 06:12:58,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1959. [2019-09-10 06:12:58,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1959 states. [2019-09-10 06:12:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1959 states to 1959 states and 3214 transitions. [2019-09-10 06:12:58,533 INFO L78 Accepts]: Start accepts. Automaton has 1959 states and 3214 transitions. Word has length 111 [2019-09-10 06:12:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:58,534 INFO L475 AbstractCegarLoop]: Abstraction has 1959 states and 3214 transitions. [2019-09-10 06:12:58,534 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:12:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1959 states and 3214 transitions. [2019-09-10 06:12:58,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-09-10 06:12:58,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:58,536 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:58,537 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:58,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:58,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1622346843, now seen corresponding path program 1 times [2019-09-10 06:12:58,537 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:58,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:58,540 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:58,793 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:58,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:12:58,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:58,794 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:12:58,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:12:58,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:12:58,796 INFO L87 Difference]: Start difference. First operand 1959 states and 3214 transitions. Second operand 6 states. [2019-09-10 06:12:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:59,178 INFO L93 Difference]: Finished difference Result 8437 states and 13913 transitions. [2019-09-10 06:12:59,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 06:12:59,179 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 114 [2019-09-10 06:12:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:59,222 INFO L225 Difference]: With dead ends: 8437 [2019-09-10 06:12:59,223 INFO L226 Difference]: Without dead ends: 8437 [2019-09-10 06:12:59,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-09-10 06:12:59,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8437 states. [2019-09-10 06:12:59,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8437 to 3617. [2019-09-10 06:12:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3617 states. [2019-09-10 06:12:59,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3617 states to 3617 states and 5929 transitions. [2019-09-10 06:12:59,364 INFO L78 Accepts]: Start accepts. Automaton has 3617 states and 5929 transitions. Word has length 114 [2019-09-10 06:12:59,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:59,364 INFO L475 AbstractCegarLoop]: Abstraction has 3617 states and 5929 transitions. [2019-09-10 06:12:59,364 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:12:59,364 INFO L276 IsEmpty]: Start isEmpty. Operand 3617 states and 5929 transitions. [2019-09-10 06:12:59,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-09-10 06:12:59,370 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:59,370 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:59,370 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:59,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1180687097, now seen corresponding path program 1 times [2019-09-10 06:12:59,371 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:59,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:59,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:59,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:59,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:12:59,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:12:59,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:12:59,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:12:59,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:12:59,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:12:59,590 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:12:59,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:12:59,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:59,592 INFO L87 Difference]: Start difference. First operand 3617 states and 5929 transitions. Second operand 4 states. [2019-09-10 06:12:59,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:12:59,764 INFO L93 Difference]: Finished difference Result 7263 states and 11975 transitions. [2019-09-10 06:12:59,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:12:59,765 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-09-10 06:12:59,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:12:59,802 INFO L225 Difference]: With dead ends: 7263 [2019-09-10 06:12:59,803 INFO L226 Difference]: Without dead ends: 7263 [2019-09-10 06:12:59,803 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:12:59,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7263 states. [2019-09-10 06:12:59,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7263 to 5372. [2019-09-10 06:12:59,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5372 states. [2019-09-10 06:12:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5372 states to 5372 states and 8823 transitions. [2019-09-10 06:12:59,953 INFO L78 Accepts]: Start accepts. Automaton has 5372 states and 8823 transitions. Word has length 115 [2019-09-10 06:12:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:12:59,953 INFO L475 AbstractCegarLoop]: Abstraction has 5372 states and 8823 transitions. [2019-09-10 06:12:59,954 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:12:59,958 INFO L276 IsEmpty]: Start isEmpty. Operand 5372 states and 8823 transitions. [2019-09-10 06:12:59,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-09-10 06:12:59,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:12:59,962 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:12:59,962 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:12:59,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:12:59,973 INFO L82 PathProgramCache]: Analyzing trace with hash -2115015956, now seen corresponding path program 1 times [2019-09-10 06:12:59,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:12:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:59,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:12:59,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:12:59,976 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:00,092 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-10 06:13:00,092 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:00,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:00,092 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:00,093 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:00,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:00,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:00,094 INFO L87 Difference]: Start difference. First operand 5372 states and 8823 transitions. Second operand 4 states. [2019-09-10 06:13:00,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:00,252 INFO L93 Difference]: Finished difference Result 10578 states and 17407 transitions. [2019-09-10 06:13:00,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:00,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-09-10 06:13:00,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:00,300 INFO L225 Difference]: With dead ends: 10578 [2019-09-10 06:13:00,300 INFO L226 Difference]: Without dead ends: 10578 [2019-09-10 06:13:00,301 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:00,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10578 states. [2019-09-10 06:13:00,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10578 to 7951. [2019-09-10 06:13:00,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7951 states. [2019-09-10 06:13:00,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7951 states to 7951 states and 13048 transitions. [2019-09-10 06:13:00,653 INFO L78 Accepts]: Start accepts. Automaton has 7951 states and 13048 transitions. Word has length 116 [2019-09-10 06:13:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:00,654 INFO L475 AbstractCegarLoop]: Abstraction has 7951 states and 13048 transitions. [2019-09-10 06:13:00,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:00,655 INFO L276 IsEmpty]: Start isEmpty. Operand 7951 states and 13048 transitions. [2019-09-10 06:13:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:13:00,664 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:00,664 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:00,665 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash -69500361, now seen corresponding path program 1 times [2019-09-10 06:13:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:00,667 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:00,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:00,667 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:00,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:00,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:00,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:00,794 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:00,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:00,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:00,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:00,796 INFO L87 Difference]: Start difference. First operand 7951 states and 13048 transitions. Second operand 3 states. [2019-09-10 06:13:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:00,868 INFO L93 Difference]: Finished difference Result 11372 states and 18622 transitions. [2019-09-10 06:13:00,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:00,869 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:13:00,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:00,894 INFO L225 Difference]: With dead ends: 11372 [2019-09-10 06:13:00,895 INFO L226 Difference]: Without dead ends: 11372 [2019-09-10 06:13:00,896 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-10 06:13:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11372 states. [2019-09-10 06:13:01,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11372 to 11370. [2019-09-10 06:13:01,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11370 states. [2019-09-10 06:13:01,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11370 states to 11370 states and 18621 transitions. [2019-09-10 06:13:01,096 INFO L78 Accepts]: Start accepts. Automaton has 11370 states and 18621 transitions. Word has length 117 [2019-09-10 06:13:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:01,097 INFO L475 AbstractCegarLoop]: Abstraction has 11370 states and 18621 transitions. [2019-09-10 06:13:01,097 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 11370 states and 18621 transitions. [2019-09-10 06:13:01,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:13:01,100 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:01,101 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:01,101 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:01,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:01,101 INFO L82 PathProgramCache]: Analyzing trace with hash 284821087, now seen corresponding path program 1 times [2019-09-10 06:13:01,101 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:01,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:01,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:01,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:01,103 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:01,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:01,200 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-10 06:13:01,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:01,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:01,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:01,202 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:01,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:01,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:01,202 INFO L87 Difference]: Start difference. First operand 11370 states and 18621 transitions. Second operand 3 states. [2019-09-10 06:13:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:01,267 INFO L93 Difference]: Finished difference Result 16088 states and 26290 transitions. [2019-09-10 06:13:01,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:01,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:13:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:01,410 INFO L225 Difference]: With dead ends: 16088 [2019-09-10 06:13:01,410 INFO L226 Difference]: Without dead ends: 16088 [2019-09-10 06:13:01,411 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-10 06:13:01,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16088 states. [2019-09-10 06:13:01,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16088 to 16086. [2019-09-10 06:13:01,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16086 states. [2019-09-10 06:13:01,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16086 states to 16086 states and 26289 transitions. [2019-09-10 06:13:01,713 INFO L78 Accepts]: Start accepts. Automaton has 16086 states and 26289 transitions. Word has length 117 [2019-09-10 06:13:01,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:01,713 INFO L475 AbstractCegarLoop]: Abstraction has 16086 states and 26289 transitions. [2019-09-10 06:13:01,713 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:01,713 INFO L276 IsEmpty]: Start isEmpty. Operand 16086 states and 26289 transitions. [2019-09-10 06:13:01,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:13:01,716 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:01,716 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:01,717 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:01,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:01,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1198037472, now seen corresponding path program 1 times [2019-09-10 06:13:01,717 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:01,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:01,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:01,719 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:01,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:01,826 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-10 06:13:01,827 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:01,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:01,827 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:01,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:01,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:01,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:01,828 INFO L87 Difference]: Start difference. First operand 16086 states and 26289 transitions. Second operand 4 states. [2019-09-10 06:13:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:02,022 INFO L93 Difference]: Finished difference Result 35466 states and 58061 transitions. [2019-09-10 06:13:02,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:02,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 117 [2019-09-10 06:13:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:02,128 INFO L225 Difference]: With dead ends: 35466 [2019-09-10 06:13:02,129 INFO L226 Difference]: Without dead ends: 35466 [2019-09-10 06:13:02,129 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:02,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35466 states. [2019-09-10 06:13:03,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35466 to 25724. [2019-09-10 06:13:03,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25724 states. [2019-09-10 06:13:03,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25724 states to 25724 states and 41999 transitions. [2019-09-10 06:13:03,262 INFO L78 Accepts]: Start accepts. Automaton has 25724 states and 41999 transitions. Word has length 117 [2019-09-10 06:13:03,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:03,263 INFO L475 AbstractCegarLoop]: Abstraction has 25724 states and 41999 transitions. [2019-09-10 06:13:03,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:03,263 INFO L276 IsEmpty]: Start isEmpty. Operand 25724 states and 41999 transitions. [2019-09-10 06:13:03,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:13:03,266 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:03,266 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:03,266 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:03,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:03,267 INFO L82 PathProgramCache]: Analyzing trace with hash -820325105, now seen corresponding path program 1 times [2019-09-10 06:13:03,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:03,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:03,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:03,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:03,269 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:03,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:03,354 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-10 06:13:03,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:03,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:03,355 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:03,356 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:03,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:03,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:03,356 INFO L87 Difference]: Start difference. First operand 25724 states and 41999 transitions. Second operand 3 states. [2019-09-10 06:13:03,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:03,492 INFO L93 Difference]: Finished difference Result 38179 states and 62243 transitions. [2019-09-10 06:13:03,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:03,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:13:03,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:03,586 INFO L225 Difference]: With dead ends: 38179 [2019-09-10 06:13:03,586 INFO L226 Difference]: Without dead ends: 38179 [2019-09-10 06:13:03,587 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-10 06:13:03,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38179 states. [2019-09-10 06:13:04,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38179 to 38177. [2019-09-10 06:13:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38177 states. [2019-09-10 06:13:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38177 states to 38177 states and 62242 transitions. [2019-09-10 06:13:04,329 INFO L78 Accepts]: Start accepts. Automaton has 38177 states and 62242 transitions. Word has length 117 [2019-09-10 06:13:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:04,330 INFO L475 AbstractCegarLoop]: Abstraction has 38177 states and 62242 transitions. [2019-09-10 06:13:04,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 38177 states and 62242 transitions. [2019-09-10 06:13:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-09-10 06:13:04,332 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:04,332 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:04,333 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash 226754279, now seen corresponding path program 1 times [2019-09-10 06:13:04,333 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:04,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:04,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:04,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:04,416 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-10 06:13:04,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:04,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 06:13:04,417 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:04,417 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 06:13:04,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 06:13:04,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 06:13:04,418 INFO L87 Difference]: Start difference. First operand 38177 states and 62242 transitions. Second operand 3 states. [2019-09-10 06:13:04,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:04,616 INFO L93 Difference]: Finished difference Result 56803 states and 92711 transitions. [2019-09-10 06:13:04,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 06:13:04,617 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-09-10 06:13:04,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:04,756 INFO L225 Difference]: With dead ends: 56803 [2019-09-10 06:13:04,756 INFO L226 Difference]: Without dead ends: 56803 [2019-09-10 06:13:04,756 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-10 06:13:04,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56803 states. [2019-09-10 06:13:06,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56803 to 56801. [2019-09-10 06:13:06,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56801 states. [2019-09-10 06:13:06,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56801 states to 56801 states and 92710 transitions. [2019-09-10 06:13:06,452 INFO L78 Accepts]: Start accepts. Automaton has 56801 states and 92710 transitions. Word has length 117 [2019-09-10 06:13:06,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:06,453 INFO L475 AbstractCegarLoop]: Abstraction has 56801 states and 92710 transitions. [2019-09-10 06:13:06,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 06:13:06,453 INFO L276 IsEmpty]: Start isEmpty. Operand 56801 states and 92710 transitions. [2019-09-10 06:13:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 06:13:06,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:06,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:06,455 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:06,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1463049779, now seen corresponding path program 1 times [2019-09-10 06:13:06,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:06,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:06,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:06,459 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:06,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:06,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:06,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:06,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-10 06:13:06,555 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:06,556 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-10 06:13:06,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-10 06:13:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-10 06:13:06,557 INFO L87 Difference]: Start difference. First operand 56801 states and 92710 transitions. Second operand 4 states. [2019-09-10 06:13:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:07,288 INFO L93 Difference]: Finished difference Result 125489 states and 204979 transitions. [2019-09-10 06:13:07,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-10 06:13:07,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 118 [2019-09-10 06:13:07,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:07,545 INFO L225 Difference]: With dead ends: 125489 [2019-09-10 06:13:07,545 INFO L226 Difference]: Without dead ends: 125489 [2019-09-10 06:13:07,546 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:07,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125489 states. [2019-09-10 06:13:10,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125489 to 90920. [2019-09-10 06:13:10,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90920 states. [2019-09-10 06:13:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90920 states to 90920 states and 148063 transitions. [2019-09-10 06:13:10,522 INFO L78 Accepts]: Start accepts. Automaton has 90920 states and 148063 transitions. Word has length 118 [2019-09-10 06:13:10,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:10,523 INFO L475 AbstractCegarLoop]: Abstraction has 90920 states and 148063 transitions. [2019-09-10 06:13:10,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-10 06:13:10,523 INFO L276 IsEmpty]: Start isEmpty. Operand 90920 states and 148063 transitions. [2019-09-10 06:13:10,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-09-10 06:13:10,525 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:10,525 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:10,525 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:10,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:10,526 INFO L82 PathProgramCache]: Analyzing trace with hash 46901475, now seen corresponding path program 1 times [2019-09-10 06:13:10,526 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:10,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,527 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:10,527 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:10,527 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:10,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:10,769 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-10 06:13:10,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:10,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:13:10,770 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:10,770 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:13:10,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:13:10,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:10,771 INFO L87 Difference]: Start difference. First operand 90920 states and 148063 transitions. Second operand 6 states. [2019-09-10 06:13:11,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:11,158 INFO L93 Difference]: Finished difference Result 90922 states and 147439 transitions. [2019-09-10 06:13:11,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:13:11,158 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 120 [2019-09-10 06:13:11,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:11,722 INFO L225 Difference]: With dead ends: 90922 [2019-09-10 06:13:11,723 INFO L226 Difference]: Without dead ends: 90922 [2019-09-10 06:13:11,723 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-09-10 06:13:11,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90922 states. [2019-09-10 06:13:12,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90922 to 90920. [2019-09-10 06:13:12,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90920 states. [2019-09-10 06:13:12,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90920 states to 90920 states and 147438 transitions. [2019-09-10 06:13:12,693 INFO L78 Accepts]: Start accepts. Automaton has 90920 states and 147438 transitions. Word has length 120 [2019-09-10 06:13:12,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:12,694 INFO L475 AbstractCegarLoop]: Abstraction has 90920 states and 147438 transitions. [2019-09-10 06:13:12,694 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:13:12,694 INFO L276 IsEmpty]: Start isEmpty. Operand 90920 states and 147438 transitions. [2019-09-10 06:13:12,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-09-10 06:13:12,695 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:12,695 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:12,696 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:12,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:12,696 INFO L82 PathProgramCache]: Analyzing trace with hash -671873135, now seen corresponding path program 1 times [2019-09-10 06:13:12,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:12,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:12,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:12,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:12,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:14,800 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-10 06:13:14,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:14,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:13:14,801 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:14,801 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:13:14,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:13:14,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:14,802 INFO L87 Difference]: Start difference. First operand 90920 states and 147438 transitions. Second operand 6 states. [2019-09-10 06:13:15,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:15,365 INFO L93 Difference]: Finished difference Result 205450 states and 332569 transitions. [2019-09-10 06:13:15,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:13:15,366 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-09-10 06:13:15,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:15,658 INFO L225 Difference]: With dead ends: 205450 [2019-09-10 06:13:15,658 INFO L226 Difference]: Without dead ends: 205450 [2019-09-10 06:13:15,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-09-10 06:13:15,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205450 states. [2019-09-10 06:13:20,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205450 to 205446. [2019-09-10 06:13:20,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205446 states. [2019-09-10 06:13:20,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205446 states to 205446 states and 332567 transitions. [2019-09-10 06:13:20,961 INFO L78 Accepts]: Start accepts. Automaton has 205446 states and 332567 transitions. Word has length 123 [2019-09-10 06:13:20,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:20,962 INFO L475 AbstractCegarLoop]: Abstraction has 205446 states and 332567 transitions. [2019-09-10 06:13:20,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:13:20,962 INFO L276 IsEmpty]: Start isEmpty. Operand 205446 states and 332567 transitions. [2019-09-10 06:13:20,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-09-10 06:13:20,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:20,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 06:13:20,963 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:20,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:20,963 INFO L82 PathProgramCache]: Analyzing trace with hash 644860160, now seen corresponding path program 1 times [2019-09-10 06:13:20,964 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:20,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:20,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:20,965 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:21,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:13:21,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:21,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 06:13:21,093 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:21,094 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 06:13:21,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 06:13:21,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 06:13:21,094 INFO L87 Difference]: Start difference. First operand 205446 states and 332567 transitions. Second operand 5 states. [2019-09-10 06:13:22,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:22,030 INFO L93 Difference]: Finished difference Result 394466 states and 634150 transitions. [2019-09-10 06:13:22,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:13:22,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-09-10 06:13:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:22,563 INFO L225 Difference]: With dead ends: 394466 [2019-09-10 06:13:22,563 INFO L226 Difference]: Without dead ends: 394466 [2019-09-10 06:13:22,564 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:23,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394466 states. [2019-09-10 06:13:29,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394466 to 210102. [2019-09-10 06:13:29,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210102 states. [2019-09-10 06:13:29,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210102 states to 210102 states and 337196 transitions. [2019-09-10 06:13:29,679 INFO L78 Accepts]: Start accepts. Automaton has 210102 states and 337196 transitions. Word has length 124 [2019-09-10 06:13:29,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:29,679 INFO L475 AbstractCegarLoop]: Abstraction has 210102 states and 337196 transitions. [2019-09-10 06:13:29,679 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 06:13:29,679 INFO L276 IsEmpty]: Start isEmpty. Operand 210102 states and 337196 transitions. [2019-09-10 06:13:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:13:29,686 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:29,686 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:13:29,686 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:29,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 71004762, now seen corresponding path program 1 times [2019-09-10 06:13:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:29,691 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:29,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:29,691 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:30,451 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-09-10 06:13:30,451 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:30,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:13:30,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:30,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:13:30,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:13:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:30,453 INFO L87 Difference]: Start difference. First operand 210102 states and 337196 transitions. Second operand 6 states. [2019-09-10 06:13:31,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:31,337 INFO L93 Difference]: Finished difference Result 373565 states and 599986 transitions. [2019-09-10 06:13:31,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:13:31,338 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-10 06:13:31,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:31,806 INFO L225 Difference]: With dead ends: 373565 [2019-09-10 06:13:31,806 INFO L226 Difference]: Without dead ends: 373565 [2019-09-10 06:13:31,807 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:13:32,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373565 states. [2019-09-10 06:13:38,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373565 to 291103. [2019-09-10 06:13:38,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291103 states. [2019-09-10 06:13:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291103 states to 291103 states and 466630 transitions. [2019-09-10 06:13:39,172 INFO L78 Accepts]: Start accepts. Automaton has 291103 states and 466630 transitions. Word has length 155 [2019-09-10 06:13:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:39,173 INFO L475 AbstractCegarLoop]: Abstraction has 291103 states and 466630 transitions. [2019-09-10 06:13:39,173 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:13:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 291103 states and 466630 transitions. [2019-09-10 06:13:39,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:13:39,183 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:39,184 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:13:39,184 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:39,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:39,184 INFO L82 PathProgramCache]: Analyzing trace with hash 425326210, now seen corresponding path program 1 times [2019-09-10 06:13:39,184 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:39,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:39,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:39,186 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:39,357 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-09-10 06:13:39,357 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:39,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:13:39,358 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:39,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:13:39,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:13:39,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:39,359 INFO L87 Difference]: Start difference. First operand 291103 states and 466630 transitions. Second operand 6 states. [2019-09-10 06:13:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:40,379 INFO L93 Difference]: Finished difference Result 398577 states and 640242 transitions. [2019-09-10 06:13:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:13:40,380 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-10 06:13:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:40,957 INFO L225 Difference]: With dead ends: 398577 [2019-09-10 06:13:40,957 INFO L226 Difference]: Without dead ends: 398577 [2019-09-10 06:13:40,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:13:41,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398577 states. [2019-09-10 06:13:49,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398577 to 368761. [2019-09-10 06:13:49,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368761 states. [2019-09-10 06:13:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368761 states to 368761 states and 591186 transitions. [2019-09-10 06:13:50,421 INFO L78 Accepts]: Start accepts. Automaton has 368761 states and 591186 transitions. Word has length 155 [2019-09-10 06:13:50,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:13:50,422 INFO L475 AbstractCegarLoop]: Abstraction has 368761 states and 591186 transitions. [2019-09-10 06:13:50,422 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:13:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 368761 states and 591186 transitions. [2019-09-10 06:13:50,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:13:50,428 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:13:50,429 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:13:50,429 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:13:50,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:13:50,429 INFO L82 PathProgramCache]: Analyzing trace with hash -679819982, now seen corresponding path program 1 times [2019-09-10 06:13:50,429 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:13:50,430 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:50,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:13:50,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:13:50,431 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:13:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:13:50,599 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-10 06:13:50,599 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:13:50,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:13:50,599 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:13:50,601 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:13:50,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:13:50,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:13:50,602 INFO L87 Difference]: Start difference. First operand 368761 states and 591186 transitions. Second operand 6 states. [2019-09-10 06:13:51,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:13:51,680 INFO L93 Difference]: Finished difference Result 438673 states and 704866 transitions. [2019-09-10 06:13:51,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:13:51,681 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-10 06:13:51,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:13:52,241 INFO L225 Difference]: With dead ends: 438673 [2019-09-10 06:13:52,241 INFO L226 Difference]: Without dead ends: 438673 [2019-09-10 06:13:52,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:13:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438673 states. [2019-09-10 06:14:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438673 to 414689. [2019-09-10 06:14:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414689 states. [2019-09-10 06:14:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414689 states to 414689 states and 665302 transitions. [2019-09-10 06:14:05,074 INFO L78 Accepts]: Start accepts. Automaton has 414689 states and 665302 transitions. Word has length 155 [2019-09-10 06:14:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:05,075 INFO L475 AbstractCegarLoop]: Abstraction has 414689 states and 665302 transitions. [2019-09-10 06:14:05,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:14:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 414689 states and 665302 transitions. [2019-09-10 06:14:05,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-10 06:14:05,080 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:05,081 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:14:05,081 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:05,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:05,081 INFO L82 PathProgramCache]: Analyzing trace with hash 367259402, now seen corresponding path program 1 times [2019-09-10 06:14:05,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:05,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:05,083 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:05,083 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:05,083 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:05,255 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-10 06:14:05,255 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 06:14:05,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 06:14:05,255 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:05,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 06:14:05,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 06:14:05,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-10 06:14:05,256 INFO L87 Difference]: Start difference. First operand 414689 states and 665302 transitions. Second operand 6 states. [2019-09-10 06:14:13,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:14:13,519 INFO L93 Difference]: Finished difference Result 564657 states and 909638 transitions. [2019-09-10 06:14:13,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 06:14:13,519 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-10 06:14:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 06:14:14,188 INFO L225 Difference]: With dead ends: 564657 [2019-09-10 06:14:14,189 INFO L226 Difference]: Without dead ends: 564657 [2019-09-10 06:14:14,189 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-09-10 06:14:14,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564657 states. [2019-09-10 06:14:18,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564657 to 508145. [2019-09-10 06:14:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 508145 states. [2019-09-10 06:14:19,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508145 states to 508145 states and 816714 transitions. [2019-09-10 06:14:19,916 INFO L78 Accepts]: Start accepts. Automaton has 508145 states and 816714 transitions. Word has length 155 [2019-09-10 06:14:19,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 06:14:19,917 INFO L475 AbstractCegarLoop]: Abstraction has 508145 states and 816714 transitions. [2019-09-10 06:14:19,917 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 06:14:19,917 INFO L276 IsEmpty]: Start isEmpty. Operand 508145 states and 816714 transitions. [2019-09-10 06:14:19,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-09-10 06:14:19,922 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 06:14:19,922 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10 06:14:19,922 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 06:14:19,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:19,923 INFO L82 PathProgramCache]: Analyzing trace with hash -1566028748, now seen corresponding path program 1 times [2019-09-10 06:14:19,923 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 06:14:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:19,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 06:14:19,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 06:14:19,924 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 06:14:19,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 06:14:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 2 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 06:14:20,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 06:14:20,148 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 06:14:20,149 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 157 with the following transitions: [2019-09-10 06:14:20,151 INFO L207 CegarAbsIntRunner]: [0], [3], [5], [8], [10], [13], [15], [18], [20], [23], [25], [28], [30], [33], [35], [38], [40], [43], [45], [48], [50], [53], [55], [58], [60], [63], [65], [68], [70], [73], [75], [78], [80], [83], [85], [88], [90], [93], [95], [98], [100], [103], [105], [108], [110], [113], [115], [118], [120], [123], [126], [129], [132], [135], [138], [141], [144], [147], [150], [153], [156], [159], [162], [165], [168], [171], [174], [177], [180], [183], [186], [189], [192], [195], [198], [201], [204], [207], [210], [213], [217], [222], [246], [249], [251], [367], [370], [373], [376], [379], [382], [389], [397], [399], [402], [403], [405], [414], [417], [428], [431], [441], [463], [466], [503], [511], [519], [527], [549], [552], [589], [597], [605], [613], [635], [638], [675], [683], [691], [699], [709], [713], [717], [719], [721], [724], [761], [769], [777], [785], [1397], [1398], [1402], [1403], [1404] [2019-09-10 06:14:20,207 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 06:14:20,207 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 06:14:20,410 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 06:14:20,714 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 06:14:20,716 INFO L272 AbstractInterpreter]: Visited 134 different actions 247 times. Merged at 47 different actions 108 times. Never widened. Performed 1000 root evaluator evaluations with a maximum evaluation depth of 5. Performed 1000 inverse root evaluator evaluations with a maximum inverse evaluation depth of 5. Found 3 fixpoints after 2 different actions. Largest state had 278 variables. [2019-09-10 06:14:20,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 06:14:20,721 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 06:14:21,265 INFO L227 lantSequenceWeakener]: Weakened 100 states. On average, predicates are now at 90.09% of their original sizes. [2019-09-10 06:14:21,265 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 06:14:48,574 INFO L420 sIntCurrentIteration]: We unified 155 AI predicates to 155 [2019-09-10 06:14:48,574 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 06:14:48,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 06:14:48,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [88] imperfect sequences [10] total 96 [2019-09-10 06:14:48,575 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 06:14:48,576 INFO L454 AbstractCegarLoop]: Interpolant automaton has 88 states [2019-09-10 06:14:48,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2019-09-10 06:14:48,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1521, Invalid=6135, Unknown=0, NotChecked=0, Total=7656 [2019-09-10 06:14:48,579 INFO L87 Difference]: Start difference. First operand 508145 states and 816714 transitions. Second operand 88 states. [2019-09-10 06:23:41,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 06:23:41,623 INFO L93 Difference]: Finished difference Result 9004608 states and 14037627 transitions. [2019-09-10 06:23:41,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 855 states. [2019-09-10 06:23:41,623 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 156 [2019-09-10 06:23:41,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted.