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/pals_lcr.6.ufo.UNBOUNDED.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 04:38:43,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 04:38:43,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 04:38:43,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 04:38:43,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 04:38:43,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 04:38:43,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 04:38:43,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 04:38:43,531 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 04:38:43,532 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 04:38:43,533 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 04:38:43,534 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 04:38:43,534 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 04:38:43,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 04:38:43,536 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 04:38:43,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 04:38:43,538 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 04:38:43,539 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 04:38:43,541 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 04:38:43,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 04:38:43,544 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 04:38:43,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 04:38:43,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 04:38:43,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 04:38:43,550 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 04:38:43,551 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 04:38:43,551 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 04:38:43,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 04:38:43,552 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 04:38:43,553 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 04:38:43,554 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 04:38:43,554 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 04:38:43,555 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 04:38:43,556 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 04:38:43,557 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 04:38:43,557 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 04:38:43,558 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 04:38:43,558 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 04:38:43,558 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 04:38:43,559 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 04:38:43,560 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 04:38:43,560 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 04:38:43,582 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 04:38:43,582 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 04:38:43,583 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 04:38:43,584 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 04:38:43,584 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 04:38:43,584 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 04:38:43,585 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 04:38:43,585 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 04:38:43,585 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 04:38:43,585 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 04:38:43,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 04:38:43,587 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 04:38:43,587 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 04:38:43,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 04:38:43,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 04:38:43,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 04:38:43,588 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 04:38:43,589 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 04:38:43,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 04:38:43,589 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 04:38:43,589 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 04:38:43,590 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 04:38:43,590 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 04:38:43,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 04:38:43,590 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 04:38:43,590 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 04:38:43,591 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 04:38:43,591 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 04:38:43,591 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 04:38:43,591 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 04:38:43,631 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 04:38:43,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 04:38:43,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 04:38:43,647 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 04:38:43,647 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 04:38:43,648 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2019-09-10 04:38:43,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88778add/5e319dd97181413d94869cfe242a9272/FLAGebfbf08ef [2019-09-10 04:38:44,228 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 04:38:44,228 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_lcr.6.ufo.UNBOUNDED.pals.c [2019-09-10 04:38:44,246 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88778add/5e319dd97181413d94869cfe242a9272/FLAGebfbf08ef [2019-09-10 04:38:44,523 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a88778add/5e319dd97181413d94869cfe242a9272 [2019-09-10 04:38:44,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 04:38:44,534 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 04:38:44,535 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 04:38:44,535 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 04:38:44,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 04:38:44,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:38:44" (1/1) ... [2019-09-10 04:38:44,543 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbd1c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:44, skipping insertion in model container [2019-09-10 04:38:44,544 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 04:38:44" (1/1) ... [2019-09-10 04:38:44,551 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 04:38:44,607 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 04:38:44,959 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:38:44,980 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 04:38:45,041 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 04:38:45,065 INFO L192 MainTranslator]: Completed translation [2019-09-10 04:38:45,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45 WrapperNode [2019-09-10 04:38:45,066 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 04:38:45,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 04:38:45,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 04:38:45,067 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 04:38:45,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,077 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,087 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,087 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,101 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,114 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,117 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (1/1) ... [2019-09-10 04:38:45,122 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 04:38:45,123 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 04:38:45,123 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 04:38:45,123 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 04:38:45,124 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (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 04:38:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 04:38:45,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node5 [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure node6 [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-10 04:38:45,176 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 04:38:45,177 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-10 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 04:38:45,177 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 04:38:45,178 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 04:38:45,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 04:38:45,180 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 04:38:45,931 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 04:38:45,932 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-10 04:38:45,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:38:45 BoogieIcfgContainer [2019-09-10 04:38:45,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 04:38:45,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 04:38:45,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 04:38:45,937 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 04:38:45,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 04:38:44" (1/3) ... [2019-09-10 04:38:45,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46414f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:38:45, skipping insertion in model container [2019-09-10 04:38:45,938 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 04:38:45" (2/3) ... [2019-09-10 04:38:45,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46414f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 04:38:45, skipping insertion in model container [2019-09-10 04:38:45,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 04:38:45" (3/3) ... [2019-09-10 04:38:45,940 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals.c [2019-09-10 04:38:45,949 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 04:38:45,955 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 04:38:45,970 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 04:38:45,992 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 04:38:45,993 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 04:38:45,993 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 04:38:45,993 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 04:38:45,993 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 04:38:45,993 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 04:38:45,993 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 04:38:45,994 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 04:38:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states. [2019-09-10 04:38:46,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-10 04:38:46,030 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:46,031 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] [2019-09-10 04:38:46,033 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:46,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1623400355, now seen corresponding path program 1 times [2019-09-10 04:38:46,040 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:46,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:46,093 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:46,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:46,093 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:46,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:46,480 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 04:38:46,483 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:38:46,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:38:46,484 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:46,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:38:46,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:38:46,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:38:46,507 INFO L87 Difference]: Start difference. First operand 145 states. Second operand 5 states. [2019-09-10 04:38:46,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:46,683 INFO L93 Difference]: Finished difference Result 144 states and 219 transitions. [2019-09-10 04:38:46,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 04:38:46,685 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-10 04:38:46,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:46,697 INFO L225 Difference]: With dead ends: 144 [2019-09-10 04:38:46,698 INFO L226 Difference]: Without dead ends: 140 [2019-09-10 04:38:46,699 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 04:38:46,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-09-10 04:38:46,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-09-10 04:38:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-09-10 04:38:46,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 176 transitions. [2019-09-10 04:38:46,744 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 176 transitions. Word has length 68 [2019-09-10 04:38:46,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:46,745 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 176 transitions. [2019-09-10 04:38:46,745 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:38:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 176 transitions. [2019-09-10 04:38:46,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-09-10 04:38:46,750 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:46,750 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] [2019-09-10 04:38:46,750 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:46,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:46,751 INFO L82 PathProgramCache]: Analyzing trace with hash -943611812, now seen corresponding path program 1 times [2019-09-10 04:38:46,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:46,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:46,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:46,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:46,754 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:46,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:47,221 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 04:38:47,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:38:47,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:38:47,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:47,225 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:38:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:38:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:38:47,227 INFO L87 Difference]: Start difference. First operand 140 states and 176 transitions. Second operand 15 states. [2019-09-10 04:38:56,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:56,364 INFO L93 Difference]: Finished difference Result 1478 states and 2292 transitions. [2019-09-10 04:38:56,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-09-10 04:38:56,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 107 [2019-09-10 04:38:56,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:56,403 INFO L225 Difference]: With dead ends: 1478 [2019-09-10 04:38:56,403 INFO L226 Difference]: Without dead ends: 1478 [2019-09-10 04:38:56,407 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2179 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1247, Invalid=4759, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:38:56,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2019-09-10 04:38:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1133. [2019-09-10 04:38:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1133 states. [2019-09-10 04:38:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1625 transitions. [2019-09-10 04:38:56,560 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1625 transitions. Word has length 107 [2019-09-10 04:38:56,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:56,561 INFO L475 AbstractCegarLoop]: Abstraction has 1133 states and 1625 transitions. [2019-09-10 04:38:56,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:38:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1625 transitions. [2019-09-10 04:38:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:38:56,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:56,567 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] [2019-09-10 04:38:56,568 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1641944652, now seen corresponding path program 1 times [2019-09-10 04:38:56,568 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:56,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:56,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:56,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:56,571 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:56,675 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 04:38:56,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:38:56,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 04:38:56,681 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:56,681 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 04:38:56,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 04:38:56,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 04:38:56,683 INFO L87 Difference]: Start difference. First operand 1133 states and 1625 transitions. Second operand 3 states. [2019-09-10 04:38:56,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:56,732 INFO L93 Difference]: Finished difference Result 2137 states and 3066 transitions. [2019-09-10 04:38:56,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 04:38:56,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 109 [2019-09-10 04:38:56,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:56,744 INFO L225 Difference]: With dead ends: 2137 [2019-09-10 04:38:56,745 INFO L226 Difference]: Without dead ends: 2137 [2019-09-10 04:38:56,745 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 04:38:56,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-09-10 04:38:56,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 2111. [2019-09-10 04:38:56,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2111 states. [2019-09-10 04:38:56,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3029 transitions. [2019-09-10 04:38:56,820 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3029 transitions. Word has length 109 [2019-09-10 04:38:56,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:56,820 INFO L475 AbstractCegarLoop]: Abstraction has 2111 states and 3029 transitions. [2019-09-10 04:38:56,821 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 04:38:56,821 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3029 transitions. [2019-09-10 04:38:56,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:38:56,823 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:56,824 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] [2019-09-10 04:38:56,824 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:56,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:56,824 INFO L82 PathProgramCache]: Analyzing trace with hash 354242196, now seen corresponding path program 1 times [2019-09-10 04:38:56,825 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:56,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:56,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:56,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:56,826 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:56,992 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 04:38:56,992 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:38:56,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:38:56,993 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:56,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:38:56,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:38:56,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:38:56,994 INFO L87 Difference]: Start difference. First operand 2111 states and 3029 transitions. Second operand 5 states. [2019-09-10 04:38:57,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:57,532 INFO L93 Difference]: Finished difference Result 4020 states and 5740 transitions. [2019-09-10 04:38:57,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:38:57,532 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:38:57,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:57,556 INFO L225 Difference]: With dead ends: 4020 [2019-09-10 04:38:57,556 INFO L226 Difference]: Without dead ends: 4020 [2019-09-10 04:38:57,557 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:38:57,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4020 states. [2019-09-10 04:38:57,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4020 to 4018. [2019-09-10 04:38:57,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4018 states. [2019-09-10 04:38:57,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4018 states to 4018 states and 5739 transitions. [2019-09-10 04:38:57,754 INFO L78 Accepts]: Start accepts. Automaton has 4018 states and 5739 transitions. Word has length 109 [2019-09-10 04:38:57,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:57,754 INFO L475 AbstractCegarLoop]: Abstraction has 4018 states and 5739 transitions. [2019-09-10 04:38:57,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:38:57,754 INFO L276 IsEmpty]: Start isEmpty. Operand 4018 states and 5739 transitions. [2019-09-10 04:38:57,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:38:57,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:57,759 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] [2019-09-10 04:38:57,762 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:57,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:57,762 INFO L82 PathProgramCache]: Analyzing trace with hash -996933238, now seen corresponding path program 1 times [2019-09-10 04:38:57,762 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:57,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:57,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:57,764 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:57,948 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 04:38:57,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:38:57,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:38:57,949 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:57,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:38:57,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:38:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:38:57,950 INFO L87 Difference]: Start difference. First operand 4018 states and 5739 transitions. Second operand 5 states. [2019-09-10 04:38:58,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:58,501 INFO L93 Difference]: Finished difference Result 7660 states and 10878 transitions. [2019-09-10 04:38:58,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:38:58,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:38:58,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:58,544 INFO L225 Difference]: With dead ends: 7660 [2019-09-10 04:38:58,545 INFO L226 Difference]: Without dead ends: 7660 [2019-09-10 04:38:58,545 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:38:58,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2019-09-10 04:38:58,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 7658. [2019-09-10 04:38:58,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7658 states. [2019-09-10 04:38:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7658 states to 7658 states and 10877 transitions. [2019-09-10 04:38:58,832 INFO L78 Accepts]: Start accepts. Automaton has 7658 states and 10877 transitions. Word has length 109 [2019-09-10 04:38:58,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:38:58,834 INFO L475 AbstractCegarLoop]: Abstraction has 7658 states and 10877 transitions. [2019-09-10 04:38:58,834 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:38:58,835 INFO L276 IsEmpty]: Start isEmpty. Operand 7658 states and 10877 transitions. [2019-09-10 04:38:58,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:38:58,836 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:38:58,836 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] [2019-09-10 04:38:58,837 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:38:58,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:38:58,839 INFO L82 PathProgramCache]: Analyzing trace with hash 250575616, now seen corresponding path program 1 times [2019-09-10 04:38:58,840 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:38:58,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:58,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:38:58,843 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:38:58,843 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:38:58,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:38:59,005 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 04:38:59,005 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:38:59,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:38:59,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:38:59,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:38:59,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:38:59,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:38:59,007 INFO L87 Difference]: Start difference. First operand 7658 states and 10877 transitions. Second operand 5 states. [2019-09-10 04:38:59,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:38:59,586 INFO L93 Difference]: Finished difference Result 14592 states and 20590 transitions. [2019-09-10 04:38:59,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:38:59,587 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:38:59,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:38:59,670 INFO L225 Difference]: With dead ends: 14592 [2019-09-10 04:38:59,673 INFO L226 Difference]: Without dead ends: 14592 [2019-09-10 04:38:59,674 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:38:59,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14592 states. [2019-09-10 04:39:00,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14592 to 14590. [2019-09-10 04:39:00,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14590 states. [2019-09-10 04:39:00,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14590 states to 14590 states and 20589 transitions. [2019-09-10 04:39:00,126 INFO L78 Accepts]: Start accepts. Automaton has 14590 states and 20589 transitions. Word has length 109 [2019-09-10 04:39:00,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:00,126 INFO L475 AbstractCegarLoop]: Abstraction has 14590 states and 20589 transitions. [2019-09-10 04:39:00,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:39:00,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14590 states and 20589 transitions. [2019-09-10 04:39:00,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:39:00,128 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:00,129 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] [2019-09-10 04:39:00,129 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1387652534, now seen corresponding path program 1 times [2019-09-10 04:39:00,130 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:00,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:00,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:00,133 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:00,299 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 04:39:00,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:00,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:39:00,299 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:00,300 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:39:00,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:39:00,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:39:00,301 INFO L87 Difference]: Start difference. First operand 14590 states and 20589 transitions. Second operand 5 states. [2019-09-10 04:39:00,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:00,960 INFO L93 Difference]: Finished difference Result 27736 states and 38870 transitions. [2019-09-10 04:39:00,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:39:00,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 109 [2019-09-10 04:39:00,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:01,066 INFO L225 Difference]: With dead ends: 27736 [2019-09-10 04:39:01,066 INFO L226 Difference]: Without dead ends: 27736 [2019-09-10 04:39:01,066 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:39:01,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27736 states. [2019-09-10 04:39:02,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27736 to 27734. [2019-09-10 04:39:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27734 states. [2019-09-10 04:39:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27734 states to 27734 states and 38869 transitions. [2019-09-10 04:39:02,256 INFO L78 Accepts]: Start accepts. Automaton has 27734 states and 38869 transitions. Word has length 109 [2019-09-10 04:39:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:02,257 INFO L475 AbstractCegarLoop]: Abstraction has 27734 states and 38869 transitions. [2019-09-10 04:39:02,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:39:02,257 INFO L276 IsEmpty]: Start isEmpty. Operand 27734 states and 38869 transitions. [2019-09-10 04:39:02,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:39:02,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:02,259 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] [2019-09-10 04:39:02,259 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:02,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:02,259 INFO L82 PathProgramCache]: Analyzing trace with hash -191907264, now seen corresponding path program 1 times [2019-09-10 04:39:02,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:02,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:02,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:02,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:02,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:02,634 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 04:39:02,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:02,634 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-09-10 04:39:02,635 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:02,636 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-09-10 04:39:02,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-09-10 04:39:02,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-09-10 04:39:02,636 INFO L87 Difference]: Start difference. First operand 27734 states and 38869 transitions. Second operand 15 states. [2019-09-10 04:39:06,970 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 32 [2019-09-10 04:39:11,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:11,319 INFO L93 Difference]: Finished difference Result 44104 states and 71518 transitions. [2019-09-10 04:39:11,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-09-10 04:39:11,319 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 109 [2019-09-10 04:39:11,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:11,516 INFO L225 Difference]: With dead ends: 44104 [2019-09-10 04:39:11,516 INFO L226 Difference]: Without dead ends: 44104 [2019-09-10 04:39:11,518 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2096 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1250, Invalid=4450, Unknown=0, NotChecked=0, Total=5700 [2019-09-10 04:39:11,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44104 states. [2019-09-10 04:39:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44104 to 27926. [2019-09-10 04:39:12,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27926 states. [2019-09-10 04:39:12,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27926 states to 27926 states and 38933 transitions. [2019-09-10 04:39:12,907 INFO L78 Accepts]: Start accepts. Automaton has 27926 states and 38933 transitions. Word has length 109 [2019-09-10 04:39:12,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:12,908 INFO L475 AbstractCegarLoop]: Abstraction has 27926 states and 38933 transitions. [2019-09-10 04:39:12,908 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-09-10 04:39:12,908 INFO L276 IsEmpty]: Start isEmpty. Operand 27926 states and 38933 transitions. [2019-09-10 04:39:12,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-09-10 04:39:12,911 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:12,911 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] [2019-09-10 04:39:12,911 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:12,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:12,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1706333516, now seen corresponding path program 1 times [2019-09-10 04:39:12,912 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:12,914 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:12,914 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:12,915 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:12,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:13,074 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 04:39:13,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:13,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:39:13,076 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:13,076 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:39:13,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:39:13,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:39:13,078 INFO L87 Difference]: Start difference. First operand 27926 states and 38933 transitions. Second operand 9 states. [2019-09-10 04:39:13,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:13,975 INFO L93 Difference]: Finished difference Result 40067 states and 54880 transitions. [2019-09-10 04:39:13,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:39:13,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2019-09-10 04:39:13,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:14,921 INFO L225 Difference]: With dead ends: 40067 [2019-09-10 04:39:14,921 INFO L226 Difference]: Without dead ends: 40067 [2019-09-10 04:39:14,922 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:39:14,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40067 states. [2019-09-10 04:39:15,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40067 to 27979. [2019-09-10 04:39:15,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27979 states. [2019-09-10 04:39:15,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27979 states to 27979 states and 39000 transitions. [2019-09-10 04:39:15,575 INFO L78 Accepts]: Start accepts. Automaton has 27979 states and 39000 transitions. Word has length 109 [2019-09-10 04:39:15,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:15,575 INFO L475 AbstractCegarLoop]: Abstraction has 27979 states and 39000 transitions. [2019-09-10 04:39:15,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:39:15,576 INFO L276 IsEmpty]: Start isEmpty. Operand 27979 states and 39000 transitions. [2019-09-10 04:39:15,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:39:15,578 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:15,578 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] [2019-09-10 04:39:15,579 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:15,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:15,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1806101332, now seen corresponding path program 1 times [2019-09-10 04:39:15,581 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:15,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:15,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:15,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:15,585 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:15,732 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 04:39:15,733 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:15,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:39:15,733 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:15,734 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:39:15,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:39:15,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:39:15,734 INFO L87 Difference]: Start difference. First operand 27979 states and 39000 transitions. Second operand 5 states. [2019-09-10 04:39:16,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:16,445 INFO L93 Difference]: Finished difference Result 41522 states and 57328 transitions. [2019-09-10 04:39:16,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:39:16,447 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-09-10 04:39:16,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:16,552 INFO L225 Difference]: With dead ends: 41522 [2019-09-10 04:39:16,552 INFO L226 Difference]: Without dead ends: 41522 [2019-09-10 04:39:16,553 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-10 04:39:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41522 states. [2019-09-10 04:39:17,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41522 to 40764. [2019-09-10 04:39:17,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40764 states. [2019-09-10 04:39:17,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40764 states to 40764 states and 56380 transitions. [2019-09-10 04:39:17,540 INFO L78 Accepts]: Start accepts. Automaton has 40764 states and 56380 transitions. Word has length 110 [2019-09-10 04:39:17,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:17,540 INFO L475 AbstractCegarLoop]: Abstraction has 40764 states and 56380 transitions. [2019-09-10 04:39:17,540 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:39:17,541 INFO L276 IsEmpty]: Start isEmpty. Operand 40764 states and 56380 transitions. [2019-09-10 04:39:17,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-10 04:39:17,544 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:17,544 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] [2019-09-10 04:39:17,544 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:17,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:17,545 INFO L82 PathProgramCache]: Analyzing trace with hash -158676371, now seen corresponding path program 1 times [2019-09-10 04:39:17,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:17,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:17,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:17,548 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:17,666 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 04:39:17,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:17,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 04:39:17,667 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:17,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 04:39:17,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 04:39:17,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:39:17,669 INFO L87 Difference]: Start difference. First operand 40764 states and 56380 transitions. Second operand 8 states. [2019-09-10 04:39:17,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:17,937 INFO L93 Difference]: Finished difference Result 49746 states and 72808 transitions. [2019-09-10 04:39:17,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 04:39:17,937 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 110 [2019-09-10 04:39:17,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:18,096 INFO L225 Difference]: With dead ends: 49746 [2019-09-10 04:39:18,097 INFO L226 Difference]: Without dead ends: 49746 [2019-09-10 04:39:18,098 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-10 04:39:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49746 states. [2019-09-10 04:39:19,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49746 to 44652. [2019-09-10 04:39:19,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44652 states. [2019-09-10 04:39:19,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44652 states to 44652 states and 60396 transitions. [2019-09-10 04:39:19,473 INFO L78 Accepts]: Start accepts. Automaton has 44652 states and 60396 transitions. Word has length 110 [2019-09-10 04:39:19,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:19,473 INFO L475 AbstractCegarLoop]: Abstraction has 44652 states and 60396 transitions. [2019-09-10 04:39:19,473 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 04:39:19,473 INFO L276 IsEmpty]: Start isEmpty. Operand 44652 states and 60396 transitions. [2019-09-10 04:39:19,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-09-10 04:39:19,475 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:19,475 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 04:39:19,475 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:19,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:19,476 INFO L82 PathProgramCache]: Analyzing trace with hash -1797355689, now seen corresponding path program 1 times [2019-09-10 04:39:19,476 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:19,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:19,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:19,478 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:19,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:19,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 04:39:19,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:19,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 04:39:19,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:19,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 04:39:19,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 04:39:19,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-10 04:39:19,590 INFO L87 Difference]: Start difference. First operand 44652 states and 60396 transitions. Second operand 9 states. [2019-09-10 04:39:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:20,862 INFO L93 Difference]: Finished difference Result 54185 states and 73926 transitions. [2019-09-10 04:39:20,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-10 04:39:20,862 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 111 [2019-09-10 04:39:20,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:21,040 INFO L225 Difference]: With dead ends: 54185 [2019-09-10 04:39:21,040 INFO L226 Difference]: Without dead ends: 54173 [2019-09-10 04:39:21,041 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-09-10 04:39:21,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54173 states. [2019-09-10 04:39:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54173 to 44687. [2019-09-10 04:39:22,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44687 states. [2019-09-10 04:39:22,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44687 states to 44687 states and 60439 transitions. [2019-09-10 04:39:22,192 INFO L78 Accepts]: Start accepts. Automaton has 44687 states and 60439 transitions. Word has length 111 [2019-09-10 04:39:22,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:22,192 INFO L475 AbstractCegarLoop]: Abstraction has 44687 states and 60439 transitions. [2019-09-10 04:39:22,192 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 04:39:22,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44687 states and 60439 transitions. [2019-09-10 04:39:22,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-09-10 04:39:22,198 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:22,198 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] [2019-09-10 04:39:22,199 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:22,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:22,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1580659, now seen corresponding path program 1 times [2019-09-10 04:39:22,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:22,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:22,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:22,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:22,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:22,325 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 04:39:22,325 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 04:39:22,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 04:39:22,326 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:22,326 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 04:39:22,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 04:39:22,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 04:39:22,327 INFO L87 Difference]: Start difference. First operand 44687 states and 60439 transitions. Second operand 5 states. [2019-09-10 04:39:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:23,067 INFO L93 Difference]: Finished difference Result 62522 states and 83488 transitions. [2019-09-10 04:39:23,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-10 04:39:23,068 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-09-10 04:39:23,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:23,183 INFO L225 Difference]: With dead ends: 62522 [2019-09-10 04:39:23,183 INFO L226 Difference]: Without dead ends: 62522 [2019-09-10 04:39:23,184 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 04:39:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62522 states. [2019-09-10 04:39:24,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62522 to 62517. [2019-09-10 04:39:24,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62517 states. [2019-09-10 04:39:24,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62517 states to 62517 states and 83484 transitions. [2019-09-10 04:39:24,192 INFO L78 Accepts]: Start accepts. Automaton has 62517 states and 83484 transitions. Word has length 112 [2019-09-10 04:39:24,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:24,193 INFO L475 AbstractCegarLoop]: Abstraction has 62517 states and 83484 transitions. [2019-09-10 04:39:24,193 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 04:39:24,193 INFO L276 IsEmpty]: Start isEmpty. Operand 62517 states and 83484 transitions. [2019-09-10 04:39:24,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 04:39:24,211 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:24,212 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, 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] [2019-09-10 04:39:24,212 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:24,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:24,212 INFO L82 PathProgramCache]: Analyzing trace with hash 1267773895, now seen corresponding path program 1 times [2019-09-10 04:39:24,212 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:24,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:24,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:24,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:24,214 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 04:39:24,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:24,323 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:24,324 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 04:39:24,326 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [241], [242], [243], [245], [254], [261], [263], [270], [273], [278], [281], [285], [298], [300], [301], [302], [332], [337], [339], [341], [342], [345], [361], [363], [365], [368], [372], [374], [375], [378], [394], [396], [398], [401], [405], [407], [408], [411], [427], [429], [431], [434], [438], [440], [441], [442], [443], [466], [469], [473], [475], [476], [479], [481], [484], [486], [487], [490], [493], [498], [501], [508], [510], [513], [517], [519], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543] [2019-09-10 04:39:24,400 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:24,401 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:24,579 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:24,740 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:39:24,741 INFO L272 AbstractInterpreter]: Visited 57 different actions 57 times. Never merged. Never widened. Performed 548 root evaluator evaluations with a maximum evaluation depth of 6. Performed 548 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Never found a fixpoint. Largest state had 133 variables. [2019-09-10 04:39:24,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:24,746 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:39:25,051 INFO L227 lantSequenceWeakener]: Weakened 28 states. On average, predicates are now at 76.41% of their original sizes. [2019-09-10 04:39:25,051 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:39:28,533 INFO L420 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2019-09-10 04:39:28,534 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:39:28,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:39:28,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [34] imperfect sequences [5] total 37 [2019-09-10 04:39:28,535 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:28,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-09-10 04:39:28,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-09-10 04:39:28,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=843, Unknown=0, NotChecked=0, Total=1122 [2019-09-10 04:39:28,537 INFO L87 Difference]: Start difference. First operand 62517 states and 83484 transitions. Second operand 34 states. [2019-09-10 04:39:45,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:39:45,910 INFO L93 Difference]: Finished difference Result 67282 states and 90147 transitions. [2019-09-10 04:39:45,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-09-10 04:39:45,911 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 168 [2019-09-10 04:39:45,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:39:46,047 INFO L225 Difference]: With dead ends: 67282 [2019-09-10 04:39:46,047 INFO L226 Difference]: Without dead ends: 67282 [2019-09-10 04:39:46,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=410, Invalid=1150, Unknown=0, NotChecked=0, Total=1560 [2019-09-10 04:39:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67282 states. [2019-09-10 04:39:46,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67282 to 67232. [2019-09-10 04:39:46,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67232 states. [2019-09-10 04:39:47,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67232 states to 67232 states and 90094 transitions. [2019-09-10 04:39:47,043 INFO L78 Accepts]: Start accepts. Automaton has 67232 states and 90094 transitions. Word has length 168 [2019-09-10 04:39:47,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:39:47,043 INFO L475 AbstractCegarLoop]: Abstraction has 67232 states and 90094 transitions. [2019-09-10 04:39:47,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 34 states. [2019-09-10 04:39:47,044 INFO L276 IsEmpty]: Start isEmpty. Operand 67232 states and 90094 transitions. [2019-09-10 04:39:47,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 04:39:47,065 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:39:47,065 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, 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] [2019-09-10 04:39:47,066 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:39:47,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:47,066 INFO L82 PathProgramCache]: Analyzing trace with hash 352516871, now seen corresponding path program 1 times [2019-09-10 04:39:47,067 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:39:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:47,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:39:47,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:39:47,069 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:39:47,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:39:47,171 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-09-10 04:39:47,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:39:47,172 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:39:47,172 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 04:39:47,175 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [241], [242], [243], [245], [254], [261], [263], [270], [273], [278], [281], [285], [298], [300], [301], [302], [332], [335], [339], [341], [342], [345], [361], [363], [365], [368], [372], [374], [375], [378], [394], [396], [398], [401], [405], [407], [408], [411], [427], [429], [431], [434], [438], [440], [441], [442], [443], [466], [469], [473], [475], [476], [479], [481], [484], [486], [487], [490], [493], [498], [501], [508], [510], [513], [517], [519], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543] [2019-09-10 04:39:47,187 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:39:47,187 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:39:47,208 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:39:48,405 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:39:48,407 INFO L272 AbstractInterpreter]: Visited 127 different actions 990 times. Merged at 19 different actions 203 times. Widened at 1 different actions 1 times. Performed 13542 root evaluator evaluations with a maximum evaluation depth of 6. Performed 13542 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 44 fixpoints after 6 different actions. Largest state had 133 variables. [2019-09-10 04:39:48,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:39:48,407 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:39:48,791 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 77.85% of their original sizes. [2019-09-10 04:39:48,791 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:39:54,521 INFO L420 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2019-09-10 04:39:54,522 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:39:54,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:39:54,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [77] imperfect sequences [5] total 80 [2019-09-10 04:39:54,522 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:39:54,523 INFO L454 AbstractCegarLoop]: Interpolant automaton has 77 states [2019-09-10 04:39:54,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2019-09-10 04:39:54,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=541, Invalid=5311, Unknown=0, NotChecked=0, Total=5852 [2019-09-10 04:39:54,526 INFO L87 Difference]: Start difference. First operand 67232 states and 90094 transitions. Second operand 77 states. [2019-09-10 04:42:46,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:42:46,183 INFO L93 Difference]: Finished difference Result 87173 states and 124201 transitions. [2019-09-10 04:42:46,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 229 states. [2019-09-10 04:42:46,183 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 168 [2019-09-10 04:42:46,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:42:46,549 INFO L225 Difference]: With dead ends: 87173 [2019-09-10 04:42:46,549 INFO L226 Difference]: Without dead ends: 87173 [2019-09-10 04:42:46,572 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 367 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27386 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=5996, Invalid=70456, Unknown=0, NotChecked=0, Total=76452 [2019-09-10 04:42:46,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87173 states. [2019-09-10 04:42:50,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87173 to 69047. [2019-09-10 04:42:50,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69047 states. [2019-09-10 04:42:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69047 states to 69047 states and 91692 transitions. [2019-09-10 04:42:50,363 INFO L78 Accepts]: Start accepts. Automaton has 69047 states and 91692 transitions. Word has length 168 [2019-09-10 04:42:50,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:42:50,363 INFO L475 AbstractCegarLoop]: Abstraction has 69047 states and 91692 transitions. [2019-09-10 04:42:50,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 77 states. [2019-09-10 04:42:50,364 INFO L276 IsEmpty]: Start isEmpty. Operand 69047 states and 91692 transitions. [2019-09-10 04:42:50,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2019-09-10 04:42:50,392 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:42:50,392 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, 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] [2019-09-10 04:42:50,393 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:42:50,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:50,393 INFO L82 PathProgramCache]: Analyzing trace with hash -319702147, now seen corresponding path program 1 times [2019-09-10 04:42:50,393 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:42:50,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:50,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:42:50,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:42:50,395 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:42:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:42:50,510 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:42:50,513 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:42:50,513 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:42:50,513 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 169 with the following transitions: [2019-09-10 04:42:50,514 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [241], [242], [243], [245], [254], [261], [263], [270], [273], [278], [281], [285], [298], [300], [301], [302], [332], [335], [339], [341], [342], [345], [361], [363], [365], [368], [372], [374], [375], [378], [381], [386], [389], [396], [398], [401], [405], [407], [408], [411], [427], [429], [431], [434], [438], [440], [441], [442], [443], [446], [462], [464], [466], [469], [473], [475], [476], [479], [481], [484], [486], [487], [490], [506], [508], [510], [513], [517], [519], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543] [2019-09-10 04:42:50,519 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:42:50,519 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:42:50,538 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:42:52,008 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:42:52,009 INFO L272 AbstractInterpreter]: Visited 130 different actions 1227 times. Merged at 21 different actions 268 times. Widened at 1 different actions 1 times. Performed 16194 root evaluator evaluations with a maximum evaluation depth of 6. Performed 16194 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 65 fixpoints after 9 different actions. Largest state had 133 variables. [2019-09-10 04:42:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:42:52,009 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:42:52,254 INFO L227 lantSequenceWeakener]: Weakened 133 states. On average, predicates are now at 77.64% of their original sizes. [2019-09-10 04:42:52,254 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:42:57,724 INFO L420 sIntCurrentIteration]: We unified 167 AI predicates to 167 [2019-09-10 04:42:57,725 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:42:57,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:42:57,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [78] imperfect sequences [5] total 81 [2019-09-10 04:42:57,725 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:42:57,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 78 states [2019-09-10 04:42:57,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2019-09-10 04:42:57,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=5475, Unknown=0, NotChecked=0, Total=6006 [2019-09-10 04:42:57,727 INFO L87 Difference]: Start difference. First operand 69047 states and 91692 transitions. Second operand 78 states. [2019-09-10 04:45:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:45:54,170 INFO L93 Difference]: Finished difference Result 73286 states and 104521 transitions. [2019-09-10 04:45:54,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 254 states. [2019-09-10 04:45:54,170 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 168 [2019-09-10 04:45:54,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:45:54,423 INFO L225 Difference]: With dead ends: 73286 [2019-09-10 04:45:54,423 INFO L226 Difference]: Without dead ends: 73286 [2019-09-10 04:45:54,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 300 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32519 ImplicationChecksByTransitivity, 25.1s TimeCoverageRelationStatistics Valid=7243, Invalid=83659, Unknown=0, NotChecked=0, Total=90902 [2019-09-10 04:45:54,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73286 states. [2019-09-10 04:45:55,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73286 to 62525. [2019-09-10 04:45:55,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62525 states. [2019-09-10 04:45:56,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62525 states to 62525 states and 82853 transitions. [2019-09-10 04:45:56,048 INFO L78 Accepts]: Start accepts. Automaton has 62525 states and 82853 transitions. Word has length 168 [2019-09-10 04:45:56,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:45:56,049 INFO L475 AbstractCegarLoop]: Abstraction has 62525 states and 82853 transitions. [2019-09-10 04:45:56,049 INFO L476 AbstractCegarLoop]: Interpolant automaton has 78 states. [2019-09-10 04:45:56,049 INFO L276 IsEmpty]: Start isEmpty. Operand 62525 states and 82853 transitions. [2019-09-10 04:45:56,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 04:45:56,061 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:45:56,061 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, 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] [2019-09-10 04:45:56,061 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:45:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:45:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1674672962, now seen corresponding path program 1 times [2019-09-10 04:45:56,065 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:45:56,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:45:56,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:45:56,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:45:56,068 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:45:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:45:56,169 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-10 04:45:56,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:45:56,170 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:45:56,170 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-10 04:45:56,171 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [241], [242], [243], [245], [254], [261], [263], [270], [273], [278], [281], [285], [298], [300], [301], [302], [305], [310], [312], [328], [330], [332], [335], [339], [341], [342], [345], [348], [353], [356], [363], [365], [368], [372], [374], [375], [378], [394], [396], [398], [401], [405], [407], [408], [411], [427], [429], [431], [434], [438], [440], [441], [442], [443], [466], [469], [473], [475], [476], [479], [481], [484], [486], [487], [490], [506], [508], [510], [513], [517], [519], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543] [2019-09-10 04:45:56,172 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:45:56,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:45:56,189 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:45:56,918 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:45:56,918 INFO L272 AbstractInterpreter]: Visited 132 different actions 1199 times. Merged at 21 different actions 259 times. Widened at 1 different actions 1 times. Performed 15783 root evaluator evaluations with a maximum evaluation depth of 6. Performed 15783 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 65 fixpoints after 9 different actions. Largest state had 133 variables. [2019-09-10 04:45:56,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:45:56,919 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:45:57,151 INFO L227 lantSequenceWeakener]: Weakened 30 states. On average, predicates are now at 87.64% of their original sizes. [2019-09-10 04:45:57,151 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:46:11,291 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-10 04:46:11,292 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:46:11,292 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:46:11,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [89] imperfect sequences [5] total 92 [2019-09-10 04:46:11,292 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:46:11,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 89 states [2019-09-10 04:46:11,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2019-09-10 04:46:11,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=834, Invalid=6998, Unknown=0, NotChecked=0, Total=7832 [2019-09-10 04:46:11,295 INFO L87 Difference]: Start difference. First operand 62525 states and 82853 transitions. Second operand 89 states. [2019-09-10 04:48:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 04:48:02,200 INFO L93 Difference]: Finished difference Result 75073 states and 107170 transitions. [2019-09-10 04:48:02,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2019-09-10 04:48:02,200 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 170 [2019-09-10 04:48:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 04:48:02,448 INFO L225 Difference]: With dead ends: 75073 [2019-09-10 04:48:02,448 INFO L226 Difference]: Without dead ends: 75073 [2019-09-10 04:48:02,450 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9469 ImplicationChecksByTransitivity, 22.7s TimeCoverageRelationStatistics Valid=1946, Invalid=23814, Unknown=0, NotChecked=0, Total=25760 [2019-09-10 04:48:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75073 states. [2019-09-10 04:48:03,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75073 to 67159. [2019-09-10 04:48:03,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67159 states. [2019-09-10 04:48:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67159 states to 67159 states and 88981 transitions. [2019-09-10 04:48:03,693 INFO L78 Accepts]: Start accepts. Automaton has 67159 states and 88981 transitions. Word has length 170 [2019-09-10 04:48:03,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 04:48:03,693 INFO L475 AbstractCegarLoop]: Abstraction has 67159 states and 88981 transitions. [2019-09-10 04:48:03,693 INFO L476 AbstractCegarLoop]: Interpolant automaton has 89 states. [2019-09-10 04:48:03,693 INFO L276 IsEmpty]: Start isEmpty. Operand 67159 states and 88981 transitions. [2019-09-10 04:48:03,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-09-10 04:48:03,705 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 04:48:03,706 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, 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] [2019-09-10 04:48:03,706 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 04:48:03,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:03,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1271699332, now seen corresponding path program 1 times [2019-09-10 04:48:03,707 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 04:48:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:03,708 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 04:48:03,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 04:48:03,708 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 04:48:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 04:48:04,090 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 21 proven. 19 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 04:48:04,090 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 04:48:04,090 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 04:48:04,091 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 171 with the following transitions: [2019-09-10 04:48:04,091 INFO L207 CegarAbsIntRunner]: [0], [3], [6], [9], [12], [15], [18], [21], [24], [27], [30], [33], [36], [39], [42], [45], [48], [51], [54], [57], [60], [63], [66], [69], [72], [75], [78], [81], [84], [87], [90], [93], [96], [99], [102], [105], [108], [111], [114], [117], [120], [241], [242], [243], [245], [254], [261], [263], [270], [273], [278], [281], [285], [298], [300], [301], [302], [305], [310], [312], [328], [330], [332], [335], [339], [341], [342], [345], [361], [363], [365], [368], [372], [374], [375], [378], [394], [396], [398], [401], [405], [407], [408], [411], [427], [429], [431], [434], [438], [440], [441], [442], [443], [446], [449], [454], [457], [464], [466], [469], [473], [475], [476], [479], [481], [484], [486], [487], [490], [506], [508], [510], [513], [517], [519], [523], [524], [525], [526], [527], [528], [529], [530], [531], [532], [533], [534], [535], [536], [537], [538], [539], [540], [541], [542], [543] [2019-09-10 04:48:04,093 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 04:48:04,093 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 04:48:04,111 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 04:48:04,949 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 04:48:04,949 INFO L272 AbstractInterpreter]: Visited 135 different actions 1499 times. Merged at 23 different actions 340 times. Widened at 1 different actions 1 times. Performed 18904 root evaluator evaluations with a maximum evaluation depth of 6. Performed 18904 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 89 fixpoints after 10 different actions. Largest state had 133 variables. [2019-09-10 04:48:04,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 04:48:04,949 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 04:48:05,125 INFO L227 lantSequenceWeakener]: Weakened 37 states. On average, predicates are now at 86.14% of their original sizes. [2019-09-10 04:48:05,125 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 04:48:20,922 INFO L420 sIntCurrentIteration]: We unified 169 AI predicates to 169 [2019-09-10 04:48:20,922 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 04:48:20,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 04:48:20,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [93] imperfect sequences [18] total 109 [2019-09-10 04:48:20,923 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 04:48:20,923 INFO L454 AbstractCegarLoop]: Interpolant automaton has 93 states [2019-09-10 04:48:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2019-09-10 04:48:20,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=938, Invalid=7618, Unknown=0, NotChecked=0, Total=8556 [2019-09-10 04:48:20,924 INFO L87 Difference]: Start difference. First operand 67159 states and 88981 transitions. Second operand 93 states.