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.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-10 08:22:21,698 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 08:22:21,701 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 08:22:21,720 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 08:22:21,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 08:22:21,722 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 08:22:21,724 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 08:22:21,738 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 08:22:21,741 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 08:22:21,743 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 08:22:21,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 08:22:21,746 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 08:22:21,746 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 08:22:21,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 08:22:21,751 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 08:22:21,752 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 08:22:21,754 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 08:22:21,759 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 08:22:21,761 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 08:22:21,763 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 08:22:21,766 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 08:22:21,768 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 08:22:21,771 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 08:22:21,772 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 08:22:21,775 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 08:22:21,776 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 08:22:21,776 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 08:22:21,778 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 08:22:21,780 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 08:22:21,781 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 08:22:21,782 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 08:22:21,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 08:22:21,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 08:22:21,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 08:22:21,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 08:22:21,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 08:22:21,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 08:22:21,788 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 08:22:21,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 08:22:21,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 08:22:21,790 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 08:22:21,791 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 08:22:21,816 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 08:22:21,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 08:22:21,817 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 08:22:21,817 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 08:22:21,818 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 08:22:21,818 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 08:22:21,818 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 08:22:21,819 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 08:22:21,819 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 08:22:21,819 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 08:22:21,821 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 08:22:21,821 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 08:22:21,822 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 08:22:21,822 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 08:22:21,822 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 08:22:21,822 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 08:22:21,823 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 08:22:21,823 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 08:22:21,823 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 08:22:21,823 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 08:22:21,823 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 08:22:21,824 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 08:22:21,824 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 08:22:21,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 08:22:21,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 08:22:21,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 08:22:21,825 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 08:22:21,825 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 08:22:21,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 08:22:21,825 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 08:22:21,878 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 08:22:21,894 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 08:22:21,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 08:22:21,901 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 08:22:21,907 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 08:22:21,909 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-10 08:22:21,967 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d84ee23/a7fe21ab40e0405c888b767f02d4a935/FLAG51f77e315 [2019-09-10 08:22:22,477 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 08:22:22,480 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-10 08:22:22,499 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d84ee23/a7fe21ab40e0405c888b767f02d4a935/FLAG51f77e315 [2019-09-10 08:22:22,791 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91d84ee23/a7fe21ab40e0405c888b767f02d4a935 [2019-09-10 08:22:22,799 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 08:22:22,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 08:22:22,801 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 08:22:22,801 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 08:22:22,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 08:22:22,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:22:22" (1/1) ... [2019-09-10 08:22:22,809 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7737060c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:22, skipping insertion in model container [2019-09-10 08:22:22,809 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 08:22:22" (1/1) ... [2019-09-10 08:22:22,816 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 08:22:22,872 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 08:22:23,224 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:22:23,240 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 08:22:23,337 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 08:22:23,370 INFO L192 MainTranslator]: Completed translation [2019-09-10 08:22:23,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23 WrapperNode [2019-09-10 08:22:23,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 08:22:23,372 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 08:22:23,372 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 08:22:23,372 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 08:22:23,383 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,383 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,410 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,422 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (1/1) ... [2019-09-10 08:22:23,431 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 08:22:23,432 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 08:22:23,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 08:22:23,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 08:22:23,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (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 08:22:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 08:22:23,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 08:22:23,490 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-10 08:22:23,490 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-10 08:22:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-10 08:22:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-10 08:22:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-10 08:22:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-10 08:22:23,491 INFO L130 BoogieDeclarations]: Found specification of procedure node5 [2019-09-10 08:22:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure node6 [2019-09-10 08:22:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure node7 [2019-09-10 08:22:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-10 08:22:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-10 08:22:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 08:22:23,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 08:22:23,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 08:22:24,310 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 08:22:24,311 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-10 08:22:24,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:22:24 BoogieIcfgContainer [2019-09-10 08:22:24,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 08:22:24,314 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 08:22:24,314 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 08:22:24,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 08:22:24,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 08:22:22" (1/3) ... [2019-09-10 08:22:24,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c6c763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:22:24, skipping insertion in model container [2019-09-10 08:22:24,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 08:22:23" (2/3) ... [2019-09-10 08:22:24,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28c6c763 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 08:22:24, skipping insertion in model container [2019-09-10 08:22:24,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 08:22:24" (3/3) ... [2019-09-10 08:22:24,323 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr.7.1.ufo.BOUNDED-14.pals.c.v+cfa-reducer.c [2019-09-10 08:22:24,332 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 08:22:24,341 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 08:22:24,358 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 08:22:24,387 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 08:22:24,387 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 08:22:24,387 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 08:22:24,388 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 08:22:24,388 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 08:22:24,388 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 08:22:24,388 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 08:22:24,388 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 08:22:24,408 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states. [2019-09-10 08:22:24,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-09-10 08:22:24,423 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:24,424 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:24,426 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:24,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:24,431 INFO L82 PathProgramCache]: Analyzing trace with hash -342597549, now seen corresponding path program 1 times [2019-09-10 08:22:24,433 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:24,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:24,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:24,488 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:25,001 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 08:22:25,004 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:25,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:25,004 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:25,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:25,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:25,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:25,031 INFO L87 Difference]: Start difference. First operand 141 states. Second operand 3 states. [2019-09-10 08:22:25,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:25,137 INFO L93 Difference]: Finished difference Result 217 states and 356 transitions. [2019-09-10 08:22:25,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:25,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 90 [2019-09-10 08:22:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:25,163 INFO L225 Difference]: With dead ends: 217 [2019-09-10 08:22:25,164 INFO L226 Difference]: Without dead ends: 209 [2019-09-10 08:22:25,167 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 08:22:25,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-09-10 08:22:25,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2019-09-10 08:22:25,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2019-09-10 08:22:25,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2019-09-10 08:22:25,237 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 90 [2019-09-10 08:22:25,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:25,238 INFO L475 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2019-09-10 08:22:25,238 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:25,239 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2019-09-10 08:22:25,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-09-10 08:22:25,242 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:25,243 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:25,243 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:25,246 INFO L82 PathProgramCache]: Analyzing trace with hash 2032484070, now seen corresponding path program 1 times [2019-09-10 08:22:25,246 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:25,248 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,248 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:25,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:25,386 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 08:22:25,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:25,386 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:25,388 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:25,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:25,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:25,389 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand 3 states. [2019-09-10 08:22:25,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:25,421 INFO L93 Difference]: Finished difference Result 341 states and 507 transitions. [2019-09-10 08:22:25,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:25,422 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 91 [2019-09-10 08:22:25,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:25,425 INFO L225 Difference]: With dead ends: 341 [2019-09-10 08:22:25,425 INFO L226 Difference]: Without dead ends: 341 [2019-09-10 08:22:25,426 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 08:22:25,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-09-10 08:22:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2019-09-10 08:22:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2019-09-10 08:22:25,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 506 transitions. [2019-09-10 08:22:25,452 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 506 transitions. Word has length 91 [2019-09-10 08:22:25,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:25,453 INFO L475 AbstractCegarLoop]: Abstraction has 339 states and 506 transitions. [2019-09-10 08:22:25,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 506 transitions. [2019-09-10 08:22:25,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-09-10 08:22:25,455 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:25,455 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:25,456 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:25,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:25,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1593427600, now seen corresponding path program 1 times [2019-09-10 08:22:25,456 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:25,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,458 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:25,458 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,458 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:25,632 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 08:22:25,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:25,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:25,633 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:25,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:25,635 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:25,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:25,639 INFO L87 Difference]: Start difference. First operand 339 states and 506 transitions. Second operand 3 states. [2019-09-10 08:22:25,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:25,672 INFO L93 Difference]: Finished difference Result 589 states and 899 transitions. [2019-09-10 08:22:25,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:25,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-09-10 08:22:25,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:25,683 INFO L225 Difference]: With dead ends: 589 [2019-09-10 08:22:25,683 INFO L226 Difference]: Without dead ends: 589 [2019-09-10 08:22:25,684 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 08:22:25,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2019-09-10 08:22:25,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 587. [2019-09-10 08:22:25,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-09-10 08:22:25,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 898 transitions. [2019-09-10 08:22:25,740 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 898 transitions. Word has length 92 [2019-09-10 08:22:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:25,740 INFO L475 AbstractCegarLoop]: Abstraction has 587 states and 898 transitions. [2019-09-10 08:22:25,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 898 transitions. [2019-09-10 08:22:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-09-10 08:22:25,743 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:25,743 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:25,744 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:25,748 INFO L82 PathProgramCache]: Analyzing trace with hash -304306673, now seen corresponding path program 1 times [2019-09-10 08:22:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,750 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:25,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:25,750 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:25,914 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 08:22:25,915 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:25,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:25,916 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:25,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:25,917 INFO L87 Difference]: Start difference. First operand 587 states and 898 transitions. Second operand 3 states. [2019-09-10 08:22:25,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:25,946 INFO L93 Difference]: Finished difference Result 1053 states and 1627 transitions. [2019-09-10 08:22:25,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:25,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-09-10 08:22:25,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:25,962 INFO L225 Difference]: With dead ends: 1053 [2019-09-10 08:22:25,962 INFO L226 Difference]: Without dead ends: 1053 [2019-09-10 08:22:25,963 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:25,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-09-10 08:22:25,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 1051. [2019-09-10 08:22:25,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-10 08:22:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1626 transitions. [2019-09-10 08:22:25,996 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1626 transitions. Word has length 93 [2019-09-10 08:22:25,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:25,997 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1626 transitions. [2019-09-10 08:22:25,997 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:25,997 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1626 transitions. [2019-09-10 08:22:26,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-09-10 08:22:26,004 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:26,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:26,005 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:26,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:26,005 INFO L82 PathProgramCache]: Analyzing trace with hash 22614474, now seen corresponding path program 1 times [2019-09-10 08:22:26,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:26,007 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:26,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,008 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:26,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:26,117 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 08:22:26,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:26,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:26,117 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:26,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:26,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:26,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:26,119 INFO L87 Difference]: Start difference. First operand 1051 states and 1626 transitions. Second operand 3 states. [2019-09-10 08:22:26,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:26,158 INFO L93 Difference]: Finished difference Result 1917 states and 2971 transitions. [2019-09-10 08:22:26,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:26,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-09-10 08:22:26,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:26,169 INFO L225 Difference]: With dead ends: 1917 [2019-09-10 08:22:26,170 INFO L226 Difference]: Without dead ends: 1917 [2019-09-10 08:22:26,170 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 08:22:26,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2019-09-10 08:22:26,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1915. [2019-09-10 08:22:26,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1915 states. [2019-09-10 08:22:26,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1915 states to 1915 states and 2970 transitions. [2019-09-10 08:22:26,230 INFO L78 Accepts]: Start accepts. Automaton has 1915 states and 2970 transitions. Word has length 94 [2019-09-10 08:22:26,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:26,233 INFO L475 AbstractCegarLoop]: Abstraction has 1915 states and 2970 transitions. [2019-09-10 08:22:26,233 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:26,233 INFO L276 IsEmpty]: Start isEmpty. Operand 1915 states and 2970 transitions. [2019-09-10 08:22:26,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-10 08:22:26,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:26,238 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:26,239 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:26,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:26,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1677889525, now seen corresponding path program 1 times [2019-09-10 08:22:26,239 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,243 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:26,243 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,244 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:26,346 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 08:22:26,346 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:26,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:26,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:26,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:26,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:26,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:26,350 INFO L87 Difference]: Start difference. First operand 1915 states and 2970 transitions. Second operand 3 states. [2019-09-10 08:22:26,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:26,391 INFO L93 Difference]: Finished difference Result 3517 states and 5435 transitions. [2019-09-10 08:22:26,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:26,392 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-10 08:22:26,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:26,411 INFO L225 Difference]: With dead ends: 3517 [2019-09-10 08:22:26,411 INFO L226 Difference]: Without dead ends: 3517 [2019-09-10 08:22:26,412 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 08:22:26,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3517 states. [2019-09-10 08:22:26,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3517 to 3515. [2019-09-10 08:22:26,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3515 states. [2019-09-10 08:22:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3515 states to 3515 states and 5434 transitions. [2019-09-10 08:22:26,546 INFO L78 Accepts]: Start accepts. Automaton has 3515 states and 5434 transitions. Word has length 95 [2019-09-10 08:22:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:26,547 INFO L475 AbstractCegarLoop]: Abstraction has 3515 states and 5434 transitions. [2019-09-10 08:22:26,547 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 3515 states and 5434 transitions. [2019-09-10 08:22:26,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-09-10 08:22:26,548 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:26,548 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:26,549 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:26,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:26,549 INFO L82 PathProgramCache]: Analyzing trace with hash 2079777372, now seen corresponding path program 1 times [2019-09-10 08:22:26,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:26,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,551 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:26,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,551 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:26,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:26,633 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 08:22:26,633 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:26,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:26,634 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:26,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:26,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:26,635 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:26,635 INFO L87 Difference]: Start difference. First operand 3515 states and 5434 transitions. Second operand 3 states. [2019-09-10 08:22:26,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:26,687 INFO L93 Difference]: Finished difference Result 6461 states and 9915 transitions. [2019-09-10 08:22:26,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:26,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 96 [2019-09-10 08:22:26,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:26,720 INFO L225 Difference]: With dead ends: 6461 [2019-09-10 08:22:26,721 INFO L226 Difference]: Without dead ends: 6461 [2019-09-10 08:22:26,721 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 08:22:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6461 states. [2019-09-10 08:22:26,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6461 to 6459. [2019-09-10 08:22:26,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6459 states. [2019-09-10 08:22:26,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6459 states to 6459 states and 9914 transitions. [2019-09-10 08:22:26,895 INFO L78 Accepts]: Start accepts. Automaton has 6459 states and 9914 transitions. Word has length 96 [2019-09-10 08:22:26,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:26,895 INFO L475 AbstractCegarLoop]: Abstraction has 6459 states and 9914 transitions. [2019-09-10 08:22:26,896 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:26,896 INFO L276 IsEmpty]: Start isEmpty. Operand 6459 states and 9914 transitions. [2019-09-10 08:22:26,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:22:26,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:26,897 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:26,897 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:26,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:26,898 INFO L82 PathProgramCache]: Analyzing trace with hash -447256609, now seen corresponding path program 1 times [2019-09-10 08:22:26,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:26,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:26,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:26,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:26,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:27,001 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 08:22:27,002 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:27,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:27,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:27,003 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:27,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:27,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:27,004 INFO L87 Difference]: Start difference. First operand 6459 states and 9914 transitions. Second operand 5 states. [2019-09-10 08:22:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:27,384 INFO L93 Difference]: Finished difference Result 12861 states and 19707 transitions. [2019-09-10 08:22:27,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:27,384 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:22:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:27,460 INFO L225 Difference]: With dead ends: 12861 [2019-09-10 08:22:27,461 INFO L226 Difference]: Without dead ends: 12861 [2019-09-10 08:22:27,461 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 08:22:27,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-09-10 08:22:27,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 12859. [2019-09-10 08:22:27,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-10 08:22:27,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19706 transitions. [2019-09-10 08:22:27,746 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19706 transitions. Word has length 97 [2019-09-10 08:22:27,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:27,747 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19706 transitions. [2019-09-10 08:22:27,747 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:27,747 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19706 transitions. [2019-09-10 08:22:27,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:22:27,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:27,749 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:27,750 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:27,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1088141316, now seen corresponding path program 1 times [2019-09-10 08:22:27,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:27,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:27,753 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:27,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:27,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:27,886 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:27,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:27,886 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:27,887 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:27,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:27,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:27,888 INFO L87 Difference]: Start difference. First operand 12859 states and 19706 transitions. Second operand 5 states. [2019-09-10 08:22:28,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:28,186 INFO L93 Difference]: Finished difference Result 12859 states and 19578 transitions. [2019-09-10 08:22:28,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:28,187 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:22:28,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:28,219 INFO L225 Difference]: With dead ends: 12859 [2019-09-10 08:22:28,220 INFO L226 Difference]: Without dead ends: 12859 [2019-09-10 08:22:28,221 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 08:22:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-10 08:22:28,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-10 08:22:28,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-10 08:22:28,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19578 transitions. [2019-09-10 08:22:28,463 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19578 transitions. Word has length 97 [2019-09-10 08:22:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:28,464 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19578 transitions. [2019-09-10 08:22:28,464 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19578 transitions. [2019-09-10 08:22:28,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:22:28,465 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:28,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:28,465 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:28,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:28,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1485495105, now seen corresponding path program 1 times [2019-09-10 08:22:28,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:28,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:28,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:28,589 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 08:22:28,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:28,590 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:28,590 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:28,591 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:28,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:28,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:28,595 INFO L87 Difference]: Start difference. First operand 12859 states and 19578 transitions. Second operand 5 states. [2019-09-10 08:22:28,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:28,847 INFO L93 Difference]: Finished difference Result 12859 states and 19450 transitions. [2019-09-10 08:22:28,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:28,849 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:22:28,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:28,876 INFO L225 Difference]: With dead ends: 12859 [2019-09-10 08:22:28,876 INFO L226 Difference]: Without dead ends: 12859 [2019-09-10 08:22:28,877 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 08:22:28,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-10 08:22:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-10 08:22:29,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-10 08:22:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19450 transitions. [2019-09-10 08:22:29,065 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19450 transitions. Word has length 97 [2019-09-10 08:22:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:29,066 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19450 transitions. [2019-09-10 08:22:29,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19450 transitions. [2019-09-10 08:22:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:22:29,067 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:29,068 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:29,069 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:29,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:29,070 INFO L82 PathProgramCache]: Analyzing trace with hash -211627100, now seen corresponding path program 1 times [2019-09-10 08:22:29,070 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:29,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:29,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:29,073 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:29,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:29,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:29,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:29,200 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:29,201 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:29,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:29,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:29,202 INFO L87 Difference]: Start difference. First operand 12859 states and 19450 transitions. Second operand 5 states. [2019-09-10 08:22:29,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:29,374 INFO L93 Difference]: Finished difference Result 12859 states and 19322 transitions. [2019-09-10 08:22:29,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:29,375 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:22:29,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:29,403 INFO L225 Difference]: With dead ends: 12859 [2019-09-10 08:22:29,404 INFO L226 Difference]: Without dead ends: 12859 [2019-09-10 08:22:29,404 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 08:22:29,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-10 08:22:29,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-10 08:22:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-10 08:22:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19322 transitions. [2019-09-10 08:22:29,717 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19322 transitions. Word has length 97 [2019-09-10 08:22:29,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:29,717 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19322 transitions. [2019-09-10 08:22:29,717 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:29,718 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19322 transitions. [2019-09-10 08:22:29,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:22:29,718 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:29,719 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:29,719 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:29,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:29,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1658656695, now seen corresponding path program 1 times [2019-09-10 08:22:29,720 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:29,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:29,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:29,724 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:29,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:29,825 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 08:22:29,826 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:29,826 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:29,826 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:29,827 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:29,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:29,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:29,827 INFO L87 Difference]: Start difference. First operand 12859 states and 19322 transitions. Second operand 5 states. [2019-09-10 08:22:29,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:29,994 INFO L93 Difference]: Finished difference Result 12859 states and 19194 transitions. [2019-09-10 08:22:29,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 08:22:29,994 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-09-10 08:22:29,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:30,024 INFO L225 Difference]: With dead ends: 12859 [2019-09-10 08:22:30,024 INFO L226 Difference]: Without dead ends: 12859 [2019-09-10 08:22:30,025 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 08:22:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12859 states. [2019-09-10 08:22:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12859 to 12859. [2019-09-10 08:22:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12859 states. [2019-09-10 08:22:30,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12859 states to 12859 states and 19194 transitions. [2019-09-10 08:22:30,241 INFO L78 Accepts]: Start accepts. Automaton has 12859 states and 19194 transitions. Word has length 97 [2019-09-10 08:22:30,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:30,242 INFO L475 AbstractCegarLoop]: Abstraction has 12859 states and 19194 transitions. [2019-09-10 08:22:30,242 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:30,242 INFO L276 IsEmpty]: Start isEmpty. Operand 12859 states and 19194 transitions. [2019-09-10 08:22:30,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-10 08:22:30,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:30,244 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:30,244 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:30,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:30,245 INFO L82 PathProgramCache]: Analyzing trace with hash -331271506, now seen corresponding path program 1 times [2019-09-10 08:22:30,245 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:30,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:30,249 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:30,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:30,451 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 08:22:30,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:30,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:30,452 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:30,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:30,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:30,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:30,453 INFO L87 Difference]: Start difference. First operand 12859 states and 19194 transitions. Second operand 9 states. [2019-09-10 08:22:31,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:31,576 INFO L93 Difference]: Finished difference Result 179285 states and 264391 transitions. [2019-09-10 08:22:31,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-09-10 08:22:31,576 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 97 [2019-09-10 08:22:31,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:32,441 INFO L225 Difference]: With dead ends: 179285 [2019-09-10 08:22:32,441 INFO L226 Difference]: Without dead ends: 179285 [2019-09-10 08:22:32,442 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2019-09-10 08:22:32,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179285 states. [2019-09-10 08:22:35,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179285 to 25659. [2019-09-10 08:22:35,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25659 states. [2019-09-10 08:22:35,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25659 states to 25659 states and 37818 transitions. [2019-09-10 08:22:35,198 INFO L78 Accepts]: Start accepts. Automaton has 25659 states and 37818 transitions. Word has length 97 [2019-09-10 08:22:35,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:35,199 INFO L475 AbstractCegarLoop]: Abstraction has 25659 states and 37818 transitions. [2019-09-10 08:22:35,199 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:35,199 INFO L276 IsEmpty]: Start isEmpty. Operand 25659 states and 37818 transitions. [2019-09-10 08:22:35,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:22:35,200 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:35,201 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:35,201 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:35,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:35,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1397477208, now seen corresponding path program 1 times [2019-09-10 08:22:35,201 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:35,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:35,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:35,203 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:35,566 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 08:22:35,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:35,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:35,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:35,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:35,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:35,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:35,568 INFO L87 Difference]: Start difference. First operand 25659 states and 37818 transitions. Second operand 9 states. [2019-09-10 08:22:36,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:36,287 INFO L93 Difference]: Finished difference Result 76865 states and 113085 transitions. [2019-09-10 08:22:36,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:22:36,288 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 99 [2019-09-10 08:22:36,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:36,430 INFO L225 Difference]: With dead ends: 76865 [2019-09-10 08:22:36,430 INFO L226 Difference]: Without dead ends: 76865 [2019-09-10 08:22:36,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2019-09-10 08:22:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76865 states. [2019-09-10 08:22:37,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76865 to 51259. [2019-09-10 08:22:37,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51259 states. [2019-09-10 08:22:37,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51259 states to 51259 states and 75322 transitions. [2019-09-10 08:22:37,330 INFO L78 Accepts]: Start accepts. Automaton has 51259 states and 75322 transitions. Word has length 99 [2019-09-10 08:22:37,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:37,330 INFO L475 AbstractCegarLoop]: Abstraction has 51259 states and 75322 transitions. [2019-09-10 08:22:37,330 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:37,330 INFO L276 IsEmpty]: Start isEmpty. Operand 51259 states and 75322 transitions. [2019-09-10 08:22:37,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-10 08:22:37,331 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:37,331 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:37,332 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:37,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:37,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1417526551, now seen corresponding path program 1 times [2019-09-10 08:22:37,332 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:37,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:37,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:37,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:37,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:37,410 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 08:22:37,410 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:37,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 08:22:37,411 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:37,411 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 08:22:37,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 08:22:37,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 08:22:37,412 INFO L87 Difference]: Start difference. First operand 51259 states and 75322 transitions. Second operand 3 states. [2019-09-10 08:22:38,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:38,674 INFO L93 Difference]: Finished difference Result 63679 states and 92925 transitions. [2019-09-10 08:22:38,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 08:22:38,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-10 08:22:38,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:38,767 INFO L225 Difference]: With dead ends: 63679 [2019-09-10 08:22:38,768 INFO L226 Difference]: Without dead ends: 63679 [2019-09-10 08:22:38,770 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 08:22:38,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63679 states. [2019-09-10 08:22:39,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63679 to 63677. [2019-09-10 08:22:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63677 states. [2019-09-10 08:22:39,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63677 states to 63677 states and 92924 transitions. [2019-09-10 08:22:39,540 INFO L78 Accepts]: Start accepts. Automaton has 63677 states and 92924 transitions. Word has length 99 [2019-09-10 08:22:39,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:39,541 INFO L475 AbstractCegarLoop]: Abstraction has 63677 states and 92924 transitions. [2019-09-10 08:22:39,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 08:22:39,541 INFO L276 IsEmpty]: Start isEmpty. Operand 63677 states and 92924 transitions. [2019-09-10 08:22:39,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-09-10 08:22:39,542 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:39,542 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:39,542 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:39,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash -374029762, now seen corresponding path program 1 times [2019-09-10 08:22:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:39,544 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:39,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:39,545 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:39,645 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 08:22:39,648 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:39,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 08:22:39,648 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:39,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 08:22:39,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 08:22:39,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 08:22:39,649 INFO L87 Difference]: Start difference. First operand 63677 states and 92924 transitions. Second operand 5 states. [2019-09-10 08:22:40,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:40,379 INFO L93 Difference]: Finished difference Result 123835 states and 178766 transitions. [2019-09-10 08:22:40,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 08:22:40,379 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 100 [2019-09-10 08:22:40,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:40,588 INFO L225 Difference]: With dead ends: 123835 [2019-09-10 08:22:40,588 INFO L226 Difference]: Without dead ends: 123835 [2019-09-10 08:22:40,589 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 08:22:40,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123835 states. [2019-09-10 08:22:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123835 to 65853. [2019-09-10 08:22:43,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65853 states. [2019-09-10 08:22:43,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65853 states to 65853 states and 95036 transitions. [2019-09-10 08:22:43,307 INFO L78 Accepts]: Start accepts. Automaton has 65853 states and 95036 transitions. Word has length 100 [2019-09-10 08:22:43,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:43,307 INFO L475 AbstractCegarLoop]: Abstraction has 65853 states and 95036 transitions. [2019-09-10 08:22:43,308 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 08:22:43,308 INFO L276 IsEmpty]: Start isEmpty. Operand 65853 states and 95036 transitions. [2019-09-10 08:22:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:22:43,324 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:43,324 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:43,324 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:43,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:43,325 INFO L82 PathProgramCache]: Analyzing trace with hash 928377095, now seen corresponding path program 1 times [2019-09-10 08:22:43,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:43,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:43,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:43,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:43,327 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:43,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:43,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:22:43,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:22:43,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:22:43,539 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:43,540 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:43,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:43,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:22:43,541 INFO L87 Difference]: Start difference. First operand 65853 states and 95036 transitions. Second operand 9 states. [2019-09-10 08:22:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:44,494 INFO L93 Difference]: Finished difference Result 373387 states and 539587 transitions. [2019-09-10 08:22:44,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:22:44,494 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:22:44,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:45,101 INFO L225 Difference]: With dead ends: 373387 [2019-09-10 08:22:45,101 INFO L226 Difference]: Without dead ends: 373387 [2019-09-10 08:22:45,102 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-09-10 08:22:45,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373387 states. [2019-09-10 08:22:50,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373387 to 108925. [2019-09-10 08:22:50,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108925 states. [2019-09-10 08:22:50,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108925 states to 108925 states and 156732 transitions. [2019-09-10 08:22:50,397 INFO L78 Accepts]: Start accepts. Automaton has 108925 states and 156732 transitions. Word has length 134 [2019-09-10 08:22:50,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:22:50,398 INFO L475 AbstractCegarLoop]: Abstraction has 108925 states and 156732 transitions. [2019-09-10 08:22:50,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:22:50,398 INFO L276 IsEmpty]: Start isEmpty. Operand 108925 states and 156732 transitions. [2019-09-10 08:22:50,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:22:50,415 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:22:50,415 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:22:50,416 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:22:50,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:50,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1520560563, now seen corresponding path program 1 times [2019-09-10 08:22:50,416 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:22:50,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:50,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:50,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:22:50,418 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:22:50,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:22:50,539 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:22:50,539 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:22:50,540 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 08:22:50,542 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], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [168], [170], [173], [176], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [246], [248], [251], [258], [260], [263], [264], [266], [275], [278], [282], [291], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [409], [412], [418], [421], [424], [426], [441], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:22:50,598 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:22:50,598 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:22:50,857 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:22:52,319 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:22:52,322 INFO L272 AbstractInterpreter]: Visited 125 different actions 1202 times. Merged at 68 different actions 931 times. Widened at 30 different actions 165 times. Performed 4457 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4457 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 124 fixpoints after 26 different actions. Largest state had 178 variables. [2019-09-10 08:22:52,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:22:52,329 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:22:52,329 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:22:52,329 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 08:22:52,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:22:52,354 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 08:22:52,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:22:52,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:22:52,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:22:53,071 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:22:53,071 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:22:53,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-10 08:22:53,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:22:53,222 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:22:53,222 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:22:53,223 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:22:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:22:53,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:22:53,224 INFO L87 Difference]: Start difference. First operand 108925 states and 156732 transitions. Second operand 9 states. [2019-09-10 08:22:54,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:22:54,252 INFO L93 Difference]: Finished difference Result 431691 states and 622851 transitions. [2019-09-10 08:22:54,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:22:54,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:22:54,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:22:55,208 INFO L225 Difference]: With dead ends: 431691 [2019-09-10 08:22:55,208 INFO L226 Difference]: Without dead ends: 431691 [2019-09-10 08:22:55,209 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:22:55,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431691 states. [2019-09-10 08:23:02,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431691 to 141885. [2019-09-10 08:23:02,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141885 states. [2019-09-10 08:23:02,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141885 states to 141885 states and 204156 transitions. [2019-09-10 08:23:02,876 INFO L78 Accepts]: Start accepts. Automaton has 141885 states and 204156 transitions. Word has length 134 [2019-09-10 08:23:02,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:02,876 INFO L475 AbstractCegarLoop]: Abstraction has 141885 states and 204156 transitions. [2019-09-10 08:23:02,876 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 141885 states and 204156 transitions. [2019-09-10 08:23:02,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:23:02,897 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:02,897 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:02,897 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:02,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -402225319, now seen corresponding path program 1 times [2019-09-10 08:23:02,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:02,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:02,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:02,900 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:02,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:03,144 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-10 08:23:03,144 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:03,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:03,144 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:03,145 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:03,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:03,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:03,146 INFO L87 Difference]: Start difference. First operand 141885 states and 204156 transitions. Second operand 9 states. [2019-09-10 08:23:04,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:04,393 INFO L93 Difference]: Finished difference Result 299851 states and 431555 transitions. [2019-09-10 08:23:04,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:04,394 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:23:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:04,918 INFO L225 Difference]: With dead ends: 299851 [2019-09-10 08:23:04,919 INFO L226 Difference]: Without dead ends: 299851 [2019-09-10 08:23:04,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:06,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299851 states. [2019-09-10 08:23:11,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299851 to 174717. [2019-09-10 08:23:11,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174717 states. [2019-09-10 08:23:11,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174717 states to 174717 states and 251068 transitions. [2019-09-10 08:23:11,577 INFO L78 Accepts]: Start accepts. Automaton has 174717 states and 251068 transitions. Word has length 134 [2019-09-10 08:23:11,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:11,577 INFO L475 AbstractCegarLoop]: Abstraction has 174717 states and 251068 transitions. [2019-09-10 08:23:11,577 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:11,577 INFO L276 IsEmpty]: Start isEmpty. Operand 174717 states and 251068 transitions. [2019-09-10 08:23:11,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:23:11,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:11,596 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:11,596 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:11,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:11,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1882658405, now seen corresponding path program 1 times [2019-09-10 08:23:11,597 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:11,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:11,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:11,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:11,599 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:11,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:11,828 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-10 08:23:11,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:11,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:11,829 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:11,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:11,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:11,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:11,831 INFO L87 Difference]: Start difference. First operand 174717 states and 251068 transitions. Second operand 9 states. [2019-09-10 08:23:12,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:12,966 INFO L93 Difference]: Finished difference Result 332683 states and 478467 transitions. [2019-09-10 08:23:12,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:12,967 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:23:12,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:13,388 INFO L225 Difference]: With dead ends: 332683 [2019-09-10 08:23:13,388 INFO L226 Difference]: Without dead ends: 332683 [2019-09-10 08:23:13,388 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:13,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332683 states. [2019-09-10 08:23:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332683 to 207549. [2019-09-10 08:23:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207549 states. [2019-09-10 08:23:20,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207549 states to 207549 states and 297980 transitions. [2019-09-10 08:23:20,917 INFO L78 Accepts]: Start accepts. Automaton has 207549 states and 297980 transitions. Word has length 134 [2019-09-10 08:23:20,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:20,918 INFO L475 AbstractCegarLoop]: Abstraction has 207549 states and 297980 transitions. [2019-09-10 08:23:20,918 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:20,918 INFO L276 IsEmpty]: Start isEmpty. Operand 207549 states and 297980 transitions. [2019-09-10 08:23:20,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:23:20,931 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:20,931 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:20,931 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:20,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:20,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1906403627, now seen corresponding path program 1 times [2019-09-10 08:23:20,932 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:20,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:20,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:20,933 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:20,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:21,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:21,044 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:21,045 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 135 with the following transitions: [2019-09-10 08:23:21,045 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], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [168], [170], [173], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [241], [246], [248], [251], [258], [260], [263], [264], [266], [275], [278], [282], [284], [287], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [416], [418], [421], [424], [426], [441], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:23:21,050 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:21,050 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:21,085 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:22,004 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:22,004 INFO L272 AbstractInterpreter]: Visited 125 different actions 1372 times. Merged at 68 different actions 1078 times. Widened at 30 different actions 174 times. Performed 5040 root evaluator evaluations with a maximum evaluation depth of 7. Performed 5040 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 143 fixpoints after 28 different actions. Largest state had 178 variables. [2019-09-10 08:23:22,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:22,005 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:22,005 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:22,005 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 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:23:22,027 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:22,027 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:22,164 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-10 08:23:22,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:22,383 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:23:22,383 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:22,506 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-09-10 08:23:22,511 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-10 08:23:22,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [5, 9] total 17 [2019-09-10 08:23:22,511 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:22,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:22,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:22,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:22,514 INFO L87 Difference]: Start difference. First operand 207549 states and 297980 transitions. Second operand 9 states. [2019-09-10 08:23:24,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:24,145 INFO L93 Difference]: Finished difference Result 365513 states and 525378 transitions. [2019-09-10 08:23:24,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:24,145 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:23:24,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:24,556 INFO L225 Difference]: With dead ends: 365513 [2019-09-10 08:23:24,556 INFO L226 Difference]: Without dead ends: 365513 [2019-09-10 08:23:24,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 255 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2019-09-10 08:23:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365513 states. [2019-09-10 08:23:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365513 to 240381. [2019-09-10 08:23:27,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240381 states. [2019-09-10 08:23:28,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240381 states to 240381 states and 344892 transitions. [2019-09-10 08:23:28,060 INFO L78 Accepts]: Start accepts. Automaton has 240381 states and 344892 transitions. Word has length 134 [2019-09-10 08:23:28,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:28,060 INFO L475 AbstractCegarLoop]: Abstraction has 240381 states and 344892 transitions. [2019-09-10 08:23:28,060 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:28,060 INFO L276 IsEmpty]: Start isEmpty. Operand 240381 states and 344892 transitions. [2019-09-10 08:23:28,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:23:28,073 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:28,073 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:28,074 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:28,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:28,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1510132511, now seen corresponding path program 1 times [2019-09-10 08:23:28,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:28,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:28,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:28,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:28,075 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:28,278 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-09-10 08:23:28,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:28,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:28,278 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:28,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:28,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:28,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:28,279 INFO L87 Difference]: Start difference. First operand 240381 states and 344892 transitions. Second operand 9 states. [2019-09-10 08:23:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:33,531 INFO L93 Difference]: Finished difference Result 398347 states and 572291 transitions. [2019-09-10 08:23:33,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:33,533 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:23:33,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:34,014 INFO L225 Difference]: With dead ends: 398347 [2019-09-10 08:23:34,014 INFO L226 Difference]: Without dead ends: 398347 [2019-09-10 08:23:34,015 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:34,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398347 states. [2019-09-10 08:23:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398347 to 273213. [2019-09-10 08:23:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273213 states. [2019-09-10 08:23:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273213 states to 273213 states and 391804 transitions. [2019-09-10 08:23:38,182 INFO L78 Accepts]: Start accepts. Automaton has 273213 states and 391804 transitions. Word has length 134 [2019-09-10 08:23:38,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:38,182 INFO L475 AbstractCegarLoop]: Abstraction has 273213 states and 391804 transitions. [2019-09-10 08:23:38,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 273213 states and 391804 transitions. [2019-09-10 08:23:38,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2019-09-10 08:23:38,197 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:38,198 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:38,198 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:38,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:38,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2090579181, now seen corresponding path program 1 times [2019-09-10 08:23:38,198 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:38,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:38,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:38,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:38,200 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:38,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:38,412 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-10 08:23:38,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 08:23:38,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-10 08:23:38,414 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 08:23:38,414 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-10 08:23:38,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-10 08:23:38,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-09-10 08:23:38,419 INFO L87 Difference]: Start difference. First operand 273213 states and 391804 transitions. Second operand 9 states. [2019-09-10 08:23:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:23:39,532 INFO L93 Difference]: Finished difference Result 431179 states and 619203 transitions. [2019-09-10 08:23:39,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-10 08:23:39,532 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 134 [2019-09-10 08:23:39,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:23:40,150 INFO L225 Difference]: With dead ends: 431179 [2019-09-10 08:23:40,150 INFO L226 Difference]: Without dead ends: 431179 [2019-09-10 08:23:40,150 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2019-09-10 08:23:40,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431179 states. [2019-09-10 08:23:50,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431179 to 306045. [2019-09-10 08:23:50,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306045 states. [2019-09-10 08:23:50,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306045 states to 306045 states and 438716 transitions. [2019-09-10 08:23:50,988 INFO L78 Accepts]: Start accepts. Automaton has 306045 states and 438716 transitions. Word has length 134 [2019-09-10 08:23:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:23:50,988 INFO L475 AbstractCegarLoop]: Abstraction has 306045 states and 438716 transitions. [2019-09-10 08:23:50,988 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-10 08:23:50,988 INFO L276 IsEmpty]: Start isEmpty. Operand 306045 states and 438716 transitions. [2019-09-10 08:23:51,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-10 08:23:51,002 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:23:51,002 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:23:51,002 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:23:51,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:51,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1251322482, now seen corresponding path program 1 times [2019-09-10 08:23:51,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:23:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:51,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:51,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:23:51,004 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:23:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:51,180 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-10 08:23:51,181 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:51,181 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:23:51,181 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 136 with the following transitions: [2019-09-10 08:23:51,183 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], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [168], [170], [173], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [246], [248], [251], [254], [258], [260], [263], [264], [266], [268], [273], [275], [278], [291], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [416], [418], [421], [424], [426], [441], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:23:51,190 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:23:51,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:23:51,235 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:23:52,111 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:23:52,112 INFO L272 AbstractInterpreter]: Visited 125 different actions 1328 times. Merged at 68 different actions 1025 times. Widened at 33 different actions 193 times. Performed 4938 root evaluator evaluations with a maximum evaluation depth of 9. Performed 4938 inverse root evaluator evaluations with a maximum inverse evaluation depth of 9. Found 156 fixpoints after 33 different actions. Largest state had 178 variables. [2019-09-10 08:23:52,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:23:52,113 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:23:52,113 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:23:52,113 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 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:23:52,140 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:23:52,140 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-10 08:23:52,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:23:52,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 16 conjunts are in the unsatisfiable core [2019-09-10 08:23:52,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:23:52,368 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:52,655 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:52,655 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:23:52,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:23:52,986 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:23:52,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:23:52,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 10, 10] total 20 [2019-09-10 08:23:52,991 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:23:52,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-10 08:23:52,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-10 08:23:52,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2019-09-10 08:23:52,992 INFO L87 Difference]: Start difference. First operand 306045 states and 438716 transitions. Second operand 12 states. [2019-09-10 08:24:11,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:24:11,945 INFO L93 Difference]: Finished difference Result 2727479 states and 3821337 transitions. [2019-09-10 08:24:11,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2019-09-10 08:24:11,945 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 135 [2019-09-10 08:24:11,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 08:24:31,224 INFO L225 Difference]: With dead ends: 2727479 [2019-09-10 08:24:31,225 INFO L226 Difference]: Without dead ends: 2727479 [2019-09-10 08:24:31,226 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 335 GetRequests, 256 SyntacticMatches, 1 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1433, Invalid=4887, Unknown=0, NotChecked=0, Total=6320 [2019-09-10 08:24:32,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727479 states. [2019-09-10 08:25:16,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727479 to 1235245. [2019-09-10 08:25:16,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1235245 states. [2019-09-10 08:25:21,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235245 states to 1235245 states and 1740220 transitions. [2019-09-10 08:25:21,339 INFO L78 Accepts]: Start accepts. Automaton has 1235245 states and 1740220 transitions. Word has length 135 [2019-09-10 08:25:21,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 08:25:21,339 INFO L475 AbstractCegarLoop]: Abstraction has 1235245 states and 1740220 transitions. [2019-09-10 08:25:21,340 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-10 08:25:21,340 INFO L276 IsEmpty]: Start isEmpty. Operand 1235245 states and 1740220 transitions. [2019-09-10 08:25:21,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-09-10 08:25:21,363 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 08:25:21,363 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-10 08:25:21,364 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 08:25:21,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:21,364 INFO L82 PathProgramCache]: Analyzing trace with hash 9628056, now seen corresponding path program 1 times [2019-09-10 08:25:21,364 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 08:25:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:21,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:21,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 08:25:21,366 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 08:25:21,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:21,590 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:21,590 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 08:25:21,591 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 137 with the following transitions: [2019-09-10 08:25:21,591 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], [129], [132], [135], [138], [141], [144], [147], [150], [153], [157], [160], [163], [168], [170], [173], [181], [183], [186], [194], [196], [199], [207], [209], [212], [220], [222], [225], [233], [235], [238], [241], [246], [248], [251], [258], [260], [263], [264], [266], [275], [278], [282], [284], [287], [293], [296], [299], [301], [316], [318], [321], [324], [326], [341], [343], [346], [349], [351], [366], [368], [371], [374], [376], [391], [393], [396], [399], [401], [416], [418], [421], [424], [426], [434], [437], [443], [446], [449], [451], [512], [513], [517], [518], [519] [2019-09-10 08:25:21,595 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 08:25:21,595 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 08:25:21,626 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-10 08:25:22,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-10 08:25:22,427 INFO L272 AbstractInterpreter]: Visited 127 different actions 1297 times. Merged at 70 different actions 1019 times. Widened at 29 different actions 183 times. Performed 4666 root evaluator evaluations with a maximum evaluation depth of 7. Performed 4666 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 134 fixpoints after 27 different actions. Largest state had 178 variables. [2019-09-10 08:25:22,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 08:25:22,428 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-10 08:25:22,428 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 08:25:22,428 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 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-10 08:25:22,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 08:25:22,454 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-10 08:25:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 08:25:24,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1009 conjuncts, 17 conjunts are in the unsatisfiable core [2019-09-10 08:25:24,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-10 08:25:24,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:24,911 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-10 08:25:25,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-10 08:25:25,173 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 08:25:25,177 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-10 08:25:25,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 21 [2019-09-10 08:25:25,178 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-10 08:25:25,178 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-09-10 08:25:25,178 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-09-10 08:25:25,179 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2019-09-10 08:25:25,179 INFO L87 Difference]: Start difference. First operand 1235245 states and 1740220 transitions. Second operand 17 states. [2019-09-10 08:26:24,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 08:26:24,268 INFO L93 Difference]: Finished difference Result 5536455 states and 7700545 transitions. [2019-09-10 08:26:24,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-09-10 08:26:24,269 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 136 [2019-09-10 08:26:24,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted.