java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 07:25:20,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 07:25:20,682 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 07:25:20,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 07:25:20,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 07:25:20,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 07:25:20,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 07:25:20,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 07:25:20,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 07:25:20,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 07:25:20,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 07:25:20,717 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 07:25:20,717 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 07:25:20,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 07:25:20,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 07:25:20,720 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 07:25:20,721 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 07:25:20,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 07:25:20,723 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 07:25:20,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 07:25:20,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 07:25:20,727 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 07:25:20,728 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 07:25:20,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 07:25:20,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 07:25:20,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 07:25:20,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 07:25:20,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 07:25:20,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 07:25:20,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 07:25:20,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 07:25:20,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 07:25:20,736 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 07:25:20,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 07:25:20,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 07:25:20,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 07:25:20,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 07:25:20,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 07:25:20,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 07:25:20,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 07:25:20,740 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 07:25:20,741 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 07:25:20,758 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 07:25:20,758 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 07:25:20,758 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 07:25:20,758 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 07:25:20,759 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 07:25:20,759 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 07:25:20,759 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 07:25:20,760 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 07:25:20,760 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 07:25:20,760 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 07:25:20,761 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 07:25:20,761 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 07:25:20,761 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 07:25:20,761 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 07:25:20,761 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 07:25:20,762 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 07:25:20,762 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 07:25:20,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 07:25:20,762 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 07:25:20,762 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 07:25:20,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 07:25:20,763 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 07:25:20,763 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 07:25:20,763 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 07:25:20,763 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 07:25:20,764 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 07:25:20,764 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 07:25:20,764 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 07:25:20,764 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 07:25:20,764 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 07:25:20,812 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 07:25:20,826 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 07:25:20,829 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 07:25:20,830 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 07:25:20,831 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 07:25:20,832 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:25:20,894 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4638294/35c85125ebb24ec4a0bc5d3c6c0ce0fe/FLAG7f9788e8f [2019-09-10 07:25:21,434 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 07:25:21,436 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:25:21,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4638294/35c85125ebb24ec4a0bc5d3c6c0ce0fe/FLAG7f9788e8f [2019-09-10 07:25:21,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4f4638294/35c85125ebb24ec4a0bc5d3c6c0ce0fe [2019-09-10 07:25:21,750 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 07:25:21,752 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 07:25:21,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:21,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 07:25:21,756 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 07:25:21,757 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:21" (1/1) ... [2019-09-10 07:25:21,760 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@379628a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:21, skipping insertion in model container [2019-09-10 07:25:21,760 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 07:25:21" (1/1) ... [2019-09-10 07:25:21,768 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 07:25:21,818 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 07:25:22,204 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:22,220 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 07:25:22,348 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 07:25:22,372 INFO L192 MainTranslator]: Completed translation [2019-09-10 07:25:22,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22 WrapperNode [2019-09-10 07:25:22,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 07:25:22,373 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 07:25:22,373 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 07:25:22,373 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 07:25:22,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,396 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,397 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,413 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,429 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (1/1) ... [2019-09-10 07:25:22,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 07:25:22,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 07:25:22,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 07:25:22,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 07:25:22,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (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 07:25:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 07:25:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 07:25:22,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 07:25:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 07:25:22,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 07:25:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 07:25:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-10 07:25:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 07:25:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 07:25:22,491 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 07:25:22,492 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 07:25:22,492 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 07:25:22,492 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 07:25:22,493 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 07:25:22,493 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 07:25:22,494 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 07:25:22,494 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 07:25:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 07:25:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 07:25:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 07:25:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 07:25:22,495 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 07:25:23,331 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 07:25:23,331 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 07:25:23,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:23 BoogieIcfgContainer [2019-09-10 07:25:23,333 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 07:25:23,335 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 07:25:23,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 07:25:23,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 07:25:23,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 07:25:21" (1/3) ... [2019-09-10 07:25:23,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f1ce4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:23, skipping insertion in model container [2019-09-10 07:25:23,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 07:25:22" (2/3) ... [2019-09-10 07:25:23,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58f1ce4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 07:25:23, skipping insertion in model container [2019-09-10 07:25:23,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 07:25:23" (3/3) ... [2019-09-10 07:25:23,349 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.6.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-09-10 07:25:23,361 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 07:25:23,382 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 07:25:23,402 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 07:25:23,426 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 07:25:23,426 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 07:25:23,426 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 07:25:23,426 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 07:25:23,427 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 07:25:23,427 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 07:25:23,427 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 07:25:23,427 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 07:25:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states. [2019-09-10 07:25:23,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-09-10 07:25:23,464 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:23,465 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] [2019-09-10 07:25:23,468 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:23,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash -56104316, now seen corresponding path program 1 times [2019-09-10 07:25:23,475 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:23,535 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:23,535 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:23,536 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:24,011 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 07:25:24,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:24,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:24,014 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:24,021 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:24,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:24,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:24,040 INFO L87 Difference]: Start difference. First operand 170 states. Second operand 3 states. [2019-09-10 07:25:24,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:24,134 INFO L93 Difference]: Finished difference Result 276 states and 445 transitions. [2019-09-10 07:25:24,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:24,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-09-10 07:25:24,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:24,153 INFO L225 Difference]: With dead ends: 276 [2019-09-10 07:25:24,153 INFO L226 Difference]: Without dead ends: 268 [2019-09-10 07:25:24,155 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 07:25:24,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2019-09-10 07:25:24,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2019-09-10 07:25:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-09-10 07:25:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 396 transitions. [2019-09-10 07:25:24,224 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 396 transitions. Word has length 78 [2019-09-10 07:25:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:24,225 INFO L475 AbstractCegarLoop]: Abstraction has 266 states and 396 transitions. [2019-09-10 07:25:24,226 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:24,226 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 396 transitions. [2019-09-10 07:25:24,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-09-10 07:25:24,236 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:24,236 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] [2019-09-10 07:25:24,237 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:24,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:24,237 INFO L82 PathProgramCache]: Analyzing trace with hash -30986540, now seen corresponding path program 1 times [2019-09-10 07:25:24,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:24,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,241 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:24,429 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 07:25:24,429 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:24,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:24,430 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:24,432 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:24,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:24,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:24,433 INFO L87 Difference]: Start difference. First operand 266 states and 396 transitions. Second operand 3 states. [2019-09-10 07:25:24,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:24,492 INFO L93 Difference]: Finished difference Result 452 states and 690 transitions. [2019-09-10 07:25:24,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:24,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-09-10 07:25:24,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:24,497 INFO L225 Difference]: With dead ends: 452 [2019-09-10 07:25:24,497 INFO L226 Difference]: Without dead ends: 452 [2019-09-10 07:25:24,498 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 07:25:24,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2019-09-10 07:25:24,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 450. [2019-09-10 07:25:24,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 450 states. [2019-09-10 07:25:24,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 689 transitions. [2019-09-10 07:25:24,530 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 689 transitions. Word has length 79 [2019-09-10 07:25:24,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:24,531 INFO L475 AbstractCegarLoop]: Abstraction has 450 states and 689 transitions. [2019-09-10 07:25:24,531 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:24,531 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 689 transitions. [2019-09-10 07:25:24,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-09-10 07:25:24,534 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:24,535 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] [2019-09-10 07:25:24,535 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:24,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:24,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1869199441, now seen corresponding path program 1 times [2019-09-10 07:25:24,536 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:24,537 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,538 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:24,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,538 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:24,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:24,671 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 07:25:24,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:24,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:24,672 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:24,672 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:24,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:24,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:24,673 INFO L87 Difference]: Start difference. First operand 450 states and 689 transitions. Second operand 3 states. [2019-09-10 07:25:24,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:24,702 INFO L93 Difference]: Finished difference Result 788 states and 1222 transitions. [2019-09-10 07:25:24,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:24,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-09-10 07:25:24,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:24,708 INFO L225 Difference]: With dead ends: 788 [2019-09-10 07:25:24,708 INFO L226 Difference]: Without dead ends: 788 [2019-09-10 07:25:24,709 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 07:25:24,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2019-09-10 07:25:24,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 786. [2019-09-10 07:25:24,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 786 states. [2019-09-10 07:25:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1221 transitions. [2019-09-10 07:25:24,752 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1221 transitions. Word has length 80 [2019-09-10 07:25:24,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:24,752 INFO L475 AbstractCegarLoop]: Abstraction has 786 states and 1221 transitions. [2019-09-10 07:25:24,752 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:24,752 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1221 transitions. [2019-09-10 07:25:24,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-09-10 07:25:24,754 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:24,755 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] [2019-09-10 07:25:24,755 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:24,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:24,755 INFO L82 PathProgramCache]: Analyzing trace with hash -28449079, now seen corresponding path program 1 times [2019-09-10 07:25:24,755 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:24,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,757 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:24,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,757 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:24,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:24,852 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 07:25:24,853 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:24,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:24,853 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:24,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:24,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:24,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:24,854 INFO L87 Difference]: Start difference. First operand 786 states and 1221 transitions. Second operand 3 states. [2019-09-10 07:25:24,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:24,888 INFO L93 Difference]: Finished difference Result 1396 states and 2178 transitions. [2019-09-10 07:25:24,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:24,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-09-10 07:25:24,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:24,898 INFO L225 Difference]: With dead ends: 1396 [2019-09-10 07:25:24,899 INFO L226 Difference]: Without dead ends: 1396 [2019-09-10 07:25:24,899 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 07:25:24,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1396 states. [2019-09-10 07:25:24,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1396 to 1394. [2019-09-10 07:25:24,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1394 states. [2019-09-10 07:25:24,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2177 transitions. [2019-09-10 07:25:24,968 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2177 transitions. Word has length 81 [2019-09-10 07:25:24,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:24,970 INFO L475 AbstractCegarLoop]: Abstraction has 1394 states and 2177 transitions. [2019-09-10 07:25:24,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:24,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2177 transitions. [2019-09-10 07:25:24,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-09-10 07:25:24,979 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:24,979 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] [2019-09-10 07:25:24,979 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:24,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash 579558126, now seen corresponding path program 1 times [2019-09-10 07:25:24,980 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:24,981 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,982 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:24,982 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:24,982 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:25,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:25,086 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:25,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:25,086 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:25,087 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:25,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:25,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:25,088 INFO L87 Difference]: Start difference. First operand 1394 states and 2177 transitions. Second operand 3 states. [2019-09-10 07:25:25,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:25,126 INFO L93 Difference]: Finished difference Result 2484 states and 3874 transitions. [2019-09-10 07:25:25,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:25,127 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-09-10 07:25:25,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:25,141 INFO L225 Difference]: With dead ends: 2484 [2019-09-10 07:25:25,141 INFO L226 Difference]: Without dead ends: 2484 [2019-09-10 07:25:25,141 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 07:25:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-09-10 07:25:25,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2482. [2019-09-10 07:25:25,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-09-10 07:25:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 3873 transitions. [2019-09-10 07:25:25,209 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 3873 transitions. Word has length 82 [2019-09-10 07:25:25,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:25,210 INFO L475 AbstractCegarLoop]: Abstraction has 2482 states and 3873 transitions. [2019-09-10 07:25:25,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:25,211 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 3873 transitions. [2019-09-10 07:25:25,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-09-10 07:25:25,218 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:25,218 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] [2019-09-10 07:25:25,218 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:25,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:25,219 INFO L82 PathProgramCache]: Analyzing trace with hash 1438283986, now seen corresponding path program 1 times [2019-09-10 07:25:25,219 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:25,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:25,221 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:25,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:25,221 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:25,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:25,524 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 07:25:25,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:25,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:25:25,525 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:25,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:25:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:25:25,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:25,528 INFO L87 Difference]: Start difference. First operand 2482 states and 3873 transitions. Second operand 8 states. [2019-09-10 07:25:25,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:25,937 INFO L93 Difference]: Finished difference Result 12652 states and 19670 transitions. [2019-09-10 07:25:25,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:25:25,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-09-10 07:25:25,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:26,001 INFO L225 Difference]: With dead ends: 12652 [2019-09-10 07:25:26,001 INFO L226 Difference]: Without dead ends: 12652 [2019-09-10 07:25:26,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:26,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12652 states. [2019-09-10 07:25:26,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12652 to 12642. [2019-09-10 07:25:26,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12642 states. [2019-09-10 07:25:26,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12642 states to 12642 states and 19665 transitions. [2019-09-10 07:25:26,282 INFO L78 Accepts]: Start accepts. Automaton has 12642 states and 19665 transitions. Word has length 83 [2019-09-10 07:25:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:26,282 INFO L475 AbstractCegarLoop]: Abstraction has 12642 states and 19665 transitions. [2019-09-10 07:25:26,283 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:25:26,283 INFO L276 IsEmpty]: Start isEmpty. Operand 12642 states and 19665 transitions. [2019-09-10 07:25:26,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-09-10 07:25:26,284 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:26,284 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:26,285 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:26,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:26,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1909068852, now seen corresponding path program 1 times [2019-09-10 07:25:26,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:26,287 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:26,287 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:26,287 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:26,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:26,436 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 07:25:26,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:26,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:26,437 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:26,437 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:26,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:26,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:26,439 INFO L87 Difference]: Start difference. First operand 12642 states and 19665 transitions. Second operand 3 states. [2019-09-10 07:25:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:26,556 INFO L93 Difference]: Finished difference Result 21940 states and 33778 transitions. [2019-09-10 07:25:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:26,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-09-10 07:25:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:26,638 INFO L225 Difference]: With dead ends: 21940 [2019-09-10 07:25:26,638 INFO L226 Difference]: Without dead ends: 21940 [2019-09-10 07:25:26,638 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 07:25:26,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21940 states. [2019-09-10 07:25:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21940 to 21938. [2019-09-10 07:25:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21938 states. [2019-09-10 07:25:27,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21938 states to 21938 states and 33777 transitions. [2019-09-10 07:25:27,740 INFO L78 Accepts]: Start accepts. Automaton has 21938 states and 33777 transitions. Word has length 84 [2019-09-10 07:25:27,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:27,740 INFO L475 AbstractCegarLoop]: Abstraction has 21938 states and 33777 transitions. [2019-09-10 07:25:27,740 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:27,740 INFO L276 IsEmpty]: Start isEmpty. Operand 21938 states and 33777 transitions. [2019-09-10 07:25:27,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:25:27,742 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:27,742 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] [2019-09-10 07:25:27,743 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:27,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:27,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2091636891, now seen corresponding path program 1 times [2019-09-10 07:25:27,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:27,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:27,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:27,746 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:27,746 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:27,876 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 07:25:27,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:27,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:27,877 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:27,878 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:27,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:27,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:27,879 INFO L87 Difference]: Start difference. First operand 21938 states and 33777 transitions. Second operand 5 states. [2019-09-10 07:25:28,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:28,326 INFO L93 Difference]: Finished difference Result 40660 states and 62322 transitions. [2019-09-10 07:25:28,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:25:28,327 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-09-10 07:25:28,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:28,420 INFO L225 Difference]: With dead ends: 40660 [2019-09-10 07:25:28,421 INFO L226 Difference]: Without dead ends: 40660 [2019-09-10 07:25:28,421 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-10 07:25:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40660 states. [2019-09-10 07:25:29,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40660 to 40658. [2019-09-10 07:25:29,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40658 states. [2019-09-10 07:25:29,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40658 states to 40658 states and 62321 transitions. [2019-09-10 07:25:29,442 INFO L78 Accepts]: Start accepts. Automaton has 40658 states and 62321 transitions. Word has length 85 [2019-09-10 07:25:29,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:29,442 INFO L475 AbstractCegarLoop]: Abstraction has 40658 states and 62321 transitions. [2019-09-10 07:25:29,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:29,443 INFO L276 IsEmpty]: Start isEmpty. Operand 40658 states and 62321 transitions. [2019-09-10 07:25:29,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-09-10 07:25:29,444 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:29,444 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] [2019-09-10 07:25:29,447 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:29,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:29,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1934689024, now seen corresponding path program 1 times [2019-09-10 07:25:29,447 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:29,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,449 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:29,449 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:29,449 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:29,676 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 07:25:29,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:29,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 07:25:29,677 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:29,677 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 07:25:29,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 07:25:29,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:25:29,679 INFO L87 Difference]: Start difference. First operand 40658 states and 62321 transitions. Second operand 8 states. [2019-09-10 07:25:31,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:31,774 INFO L93 Difference]: Finished difference Result 197438 states and 301751 transitions. [2019-09-10 07:25:31,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 07:25:31,775 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 85 [2019-09-10 07:25:31,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:32,240 INFO L225 Difference]: With dead ends: 197438 [2019-09-10 07:25:32,240 INFO L226 Difference]: Without dead ends: 197438 [2019-09-10 07:25:32,241 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2019-09-10 07:25:32,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197438 states. [2019-09-10 07:25:33,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197438 to 81266. [2019-09-10 07:25:33,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81266 states. [2019-09-10 07:25:33,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81266 states to 81266 states and 123185 transitions. [2019-09-10 07:25:33,939 INFO L78 Accepts]: Start accepts. Automaton has 81266 states and 123185 transitions. Word has length 85 [2019-09-10 07:25:33,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:33,940 INFO L475 AbstractCegarLoop]: Abstraction has 81266 states and 123185 transitions. [2019-09-10 07:25:33,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 07:25:33,940 INFO L276 IsEmpty]: Start isEmpty. Operand 81266 states and 123185 transitions. [2019-09-10 07:25:33,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-09-10 07:25:33,941 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:33,941 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] [2019-09-10 07:25:33,942 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:33,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:33,942 INFO L82 PathProgramCache]: Analyzing trace with hash -172715075, now seen corresponding path program 1 times [2019-09-10 07:25:33,942 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:33,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:33,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:33,944 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:33,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:34,057 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 07:25:34,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:34,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 07:25:34,058 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:34,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 07:25:34,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 07:25:34,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 07:25:34,061 INFO L87 Difference]: Start difference. First operand 81266 states and 123185 transitions. Second operand 5 states. [2019-09-10 07:25:35,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:35,702 INFO L93 Difference]: Finished difference Result 165298 states and 247729 transitions. [2019-09-10 07:25:35,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 07:25:35,702 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 86 [2019-09-10 07:25:35,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:36,018 INFO L225 Difference]: With dead ends: 165298 [2019-09-10 07:25:36,018 INFO L226 Difference]: Without dead ends: 165298 [2019-09-10 07:25:36,019 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:25:36,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165298 states. [2019-09-10 07:25:37,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165298 to 84082. [2019-09-10 07:25:37,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84082 states. [2019-09-10 07:25:37,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84082 states to 84082 states and 126001 transitions. [2019-09-10 07:25:37,388 INFO L78 Accepts]: Start accepts. Automaton has 84082 states and 126001 transitions. Word has length 86 [2019-09-10 07:25:37,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:37,388 INFO L475 AbstractCegarLoop]: Abstraction has 84082 states and 126001 transitions. [2019-09-10 07:25:37,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 07:25:37,388 INFO L276 IsEmpty]: Start isEmpty. Operand 84082 states and 126001 transitions. [2019-09-10 07:25:37,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-09-10 07:25:37,390 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:37,390 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] [2019-09-10 07:25:37,390 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1049580209, now seen corresponding path program 1 times [2019-09-10 07:25:37,391 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,393 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:37,393 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:37,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:37,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:37,471 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 07:25:37,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:25:37,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:25:37,471 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:25:37,472 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:25:37,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:25:37,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:25:37,473 INFO L87 Difference]: Start difference. First operand 84082 states and 126001 transitions. Second operand 3 states. [2019-09-10 07:25:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:38,264 INFO L93 Difference]: Finished difference Result 105686 states and 157156 transitions. [2019-09-10 07:25:38,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:25:38,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 87 [2019-09-10 07:25:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:25:38,396 INFO L225 Difference]: With dead ends: 105686 [2019-09-10 07:25:38,396 INFO L226 Difference]: Without dead ends: 105686 [2019-09-10 07:25:38,398 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 07:25:38,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105686 states. [2019-09-10 07:25:40,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105686 to 105332. [2019-09-10 07:25:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105332 states. [2019-09-10 07:25:41,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105332 states to 105332 states and 156803 transitions. [2019-09-10 07:25:41,000 INFO L78 Accepts]: Start accepts. Automaton has 105332 states and 156803 transitions. Word has length 87 [2019-09-10 07:25:41,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:25:41,001 INFO L475 AbstractCegarLoop]: Abstraction has 105332 states and 156803 transitions. [2019-09-10 07:25:41,001 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:25:41,001 INFO L276 IsEmpty]: Start isEmpty. Operand 105332 states and 156803 transitions. [2019-09-10 07:25:41,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:25:41,040 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:25:41,040 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 07:25:41,040 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:25:41,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:41,041 INFO L82 PathProgramCache]: Analyzing trace with hash 1906818762, now seen corresponding path program 1 times [2019-09-10 07:25:41,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:25:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:41,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:41,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:25:41,043 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:25:41,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:25:41,307 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:25:41,307 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:25:41,308 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 07:25:41,311 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], [123], [126], [128], [131], [136], [147], [149], [152], [163], [165], [168], [179], [181], [184], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [245], [250], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [369], [371], [384], [392], [411], [422], [424], [437], [445], [464], [475], [477], [490], [498], [517], [528], [530], [532], [535], [538], [541], [543], [545], [617], [618], [622], [623], [624] [2019-09-10 07:25:41,366 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:25:41,366 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:25:41,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:25:42,147 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 07:25:42,153 INFO L272 AbstractInterpreter]: Visited 109 different actions 616 times. Merged at 61 different actions 439 times. Widened at 17 different actions 45 times. Performed 2014 root evaluator evaluations with a maximum evaluation depth of 8. Performed 2014 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 73 fixpoints after 16 different actions. Largest state had 166 variables. [2019-09-10 07:25:42,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:25:42,159 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 07:25:42,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:25:42,159 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 07:25:42,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:25:42,188 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 07:25:42,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:25:42,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 913 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-10 07:25:42,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 07:25:42,535 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:25:42,536 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 07:25:42,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 07:25:42,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 07:25:42,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 4, 4] total 14 [2019-09-10 07:25:42,708 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 07:25:42,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 07:25:42,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 07:25:42,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-09-10 07:25:42,710 INFO L87 Difference]: Start difference. First operand 105332 states and 156803 transitions. Second operand 12 states. [2019-09-10 07:25:58,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:25:58,706 INFO L93 Difference]: Finished difference Result 1326742 states and 1937924 transitions. [2019-09-10 07:25:58,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-09-10 07:25:58,706 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 118 [2019-09-10 07:25:58,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:00,644 INFO L225 Difference]: With dead ends: 1326742 [2019-09-10 07:26:00,644 INFO L226 Difference]: Without dead ends: 1326742 [2019-09-10 07:26:00,647 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3786 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=1765, Invalid=8135, Unknown=0, NotChecked=0, Total=9900 [2019-09-10 07:26:08,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1326742 states. [2019-09-10 07:26:21,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1326742 to 317540. [2019-09-10 07:26:21,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317540 states. [2019-09-10 07:26:21,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317540 states to 317540 states and 465603 transitions. [2019-09-10 07:26:21,695 INFO L78 Accepts]: Start accepts. Automaton has 317540 states and 465603 transitions. Word has length 118 [2019-09-10 07:26:21,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:21,696 INFO L475 AbstractCegarLoop]: Abstraction has 317540 states and 465603 transitions. [2019-09-10 07:26:21,696 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 07:26:21,696 INFO L276 IsEmpty]: Start isEmpty. Operand 317540 states and 465603 transitions. [2019-09-10 07:26:21,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:26:21,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:21,744 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-10 07:26:21,744 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:21,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:21,744 INFO L82 PathProgramCache]: Analyzing trace with hash -482119262, now seen corresponding path program 1 times [2019-09-10 07:26:21,744 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:21,747 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:21,747 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:21,747 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:21,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:21,825 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:26:21,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:21,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 07:26:21,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:21,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 07:26:21,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 07:26:21,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 07:26:21,827 INFO L87 Difference]: Start difference. First operand 317540 states and 465603 transitions. Second operand 3 states. [2019-09-10 07:26:27,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:27,473 INFO L93 Difference]: Finished difference Result 503783 states and 737798 transitions. [2019-09-10 07:26:27,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 07:26:27,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 118 [2019-09-10 07:26:27,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:28,119 INFO L225 Difference]: With dead ends: 503783 [2019-09-10 07:26:28,119 INFO L226 Difference]: Without dead ends: 503783 [2019-09-10 07:26:28,119 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 07:26:28,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 503783 states. [2019-09-10 07:26:33,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 503783 to 503781. [2019-09-10 07:26:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503781 states. [2019-09-10 07:26:33,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503781 states to 503781 states and 737797 transitions. [2019-09-10 07:26:33,885 INFO L78 Accepts]: Start accepts. Automaton has 503781 states and 737797 transitions. Word has length 118 [2019-09-10 07:26:33,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:26:33,886 INFO L475 AbstractCegarLoop]: Abstraction has 503781 states and 737797 transitions. [2019-09-10 07:26:33,886 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 07:26:33,886 INFO L276 IsEmpty]: Start isEmpty. Operand 503781 states and 737797 transitions. [2019-09-10 07:26:41,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:26:41,068 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:26:41,068 INFO L399 BasicCegarLoop]: trace histogram [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 07:26:41,069 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:26:41,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:26:41,069 INFO L82 PathProgramCache]: Analyzing trace with hash -739654471, now seen corresponding path program 1 times [2019-09-10 07:26:41,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:26:41,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:41,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:26:41,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:26:41,071 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:26:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:26:41,170 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 07:26:41,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 07:26:41,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 07:26:41,171 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:26:41,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 07:26:41,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 07:26:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-10 07:26:41,173 INFO L87 Difference]: Start difference. First operand 503781 states and 737797 transitions. Second operand 6 states. [2019-09-10 07:26:46,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:26:46,669 INFO L93 Difference]: Finished difference Result 1435465 states and 2087399 transitions. [2019-09-10 07:26:46,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 07:26:46,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-09-10 07:26:46,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:26:48,891 INFO L225 Difference]: With dead ends: 1435465 [2019-09-10 07:26:48,892 INFO L226 Difference]: Without dead ends: 1435465 [2019-09-10 07:26:48,892 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-10 07:26:51,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1435465 states. [2019-09-10 07:27:31,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1435465 to 1435461. [2019-09-10 07:27:31,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1435461 states. [2019-09-10 07:27:48,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1435461 states to 1435461 states and 2087397 transitions. [2019-09-10 07:27:48,990 INFO L78 Accepts]: Start accepts. Automaton has 1435461 states and 2087397 transitions. Word has length 118 [2019-09-10 07:27:48,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 07:27:48,991 INFO L475 AbstractCegarLoop]: Abstraction has 1435461 states and 2087397 transitions. [2019-09-10 07:27:48,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 07:27:48,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1435461 states and 2087397 transitions. [2019-09-10 07:27:49,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-09-10 07:27:49,060 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 07:27:49,060 INFO L399 BasicCegarLoop]: trace histogram [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 07:27:49,060 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 07:27:49,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:49,061 INFO L82 PathProgramCache]: Analyzing trace with hash 2031162782, now seen corresponding path program 1 times [2019-09-10 07:27:49,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 07:27:49,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:49,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 07:27:49,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 07:27:49,063 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 07:27:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 07:27:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 07:27:49,173 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 07:27:49,173 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 07:27:49,174 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 119 with the following transitions: [2019-09-10 07:27:49,174 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], [123], [126], [128], [149], [152], [155], [158], [163], [165], [168], [179], [181], [184], [195], [197], [200], [211], [213], [216], [227], [229], [232], [235], [237], [240], [241], [243], [252], [263], [265], [278], [286], [305], [316], [318], [331], [339], [358], [369], [371], [384], [392], [411], [422], [424], [437], [445], [464], [466], [469], [477], [480], [483], [486], [488], [490], [532], [545], [553], [572], [617], [618], [622], [623], [624] [2019-09-10 07:27:49,183 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 07:27:49,183 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 07:27:49,229 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 07:27:49,399 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 07:27:49,399 INFO L272 AbstractInterpreter]: Visited 101 different actions 298 times. Merged at 50 different actions 166 times. Widened at 5 different actions 10 times. Performed 1139 root evaluator evaluations with a maximum evaluation depth of 7. Performed 1139 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 22 fixpoints after 8 different actions. Largest state had 166 variables. [2019-09-10 07:27:49,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 07:27:49,400 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 07:27:49,701 INFO L227 lantSequenceWeakener]: Weakened 80 states. On average, predicates are now at 79.98% of their original sizes. [2019-09-10 07:27:49,701 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 07:28:02,956 INFO L420 sIntCurrentIteration]: We unified 117 AI predicates to 117 [2019-09-10 07:28:02,956 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 07:28:02,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 07:28:02,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [57] imperfect sequences [7] total 62 [2019-09-10 07:28:02,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 07:28:02,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-09-10 07:28:02,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-09-10 07:28:02,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2820, Unknown=0, NotChecked=0, Total=3192 [2019-09-10 07:28:02,960 INFO L87 Difference]: Start difference. First operand 1435461 states and 2087397 transitions. Second operand 57 states. [2019-09-10 07:30:28,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 07:30:28,231 INFO L93 Difference]: Finished difference Result 3541610 states and 5027758 transitions. [2019-09-10 07:30:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 592 states. [2019-09-10 07:30:28,232 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2019-09-10 07:30:28,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 07:30:36,355 INFO L225 Difference]: With dead ends: 3541610 [2019-09-10 07:30:36,356 INFO L226 Difference]: Without dead ends: 3541610 [2019-09-10 07:30:36,380 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 609 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172458 ImplicationChecksByTransitivity, 58.8s TimeCoverageRelationStatistics Valid=36180, Invalid=336530, Unknown=0, NotChecked=0, Total=372710 [2019-09-10 07:30:38,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3541610 states.