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/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 02:35:09,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 02:35:09,955 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 02:35:09,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 02:35:09,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 02:35:09,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 02:35:09,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 02:35:09,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 02:35:09,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 02:35:09,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 02:35:09,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 02:35:09,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 02:35:09,979 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 02:35:09,980 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 02:35:09,981 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 02:35:09,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 02:35:09,983 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 02:35:09,984 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 02:35:09,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 02:35:09,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 02:35:09,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 02:35:09,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 02:35:09,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 02:35:09,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 02:35:09,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 02:35:09,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 02:35:09,995 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 02:35:09,996 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 02:35:09,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 02:35:09,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 02:35:09,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 02:35:09,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 02:35:09,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 02:35:10,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 02:35:10,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 02:35:10,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 02:35:10,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 02:35:10,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 02:35:10,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 02:35:10,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 02:35:10,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 02:35:10,005 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-10-03 02:35:10,021 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 02:35:10,021 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 02:35:10,022 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 02:35:10,022 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 02:35:10,023 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 02:35:10,023 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 02:35:10,023 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 02:35:10,023 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 02:35:10,024 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 02:35:10,024 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 02:35:10,025 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 02:35:10,025 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 02:35:10,025 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 02:35:10,025 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 02:35:10,026 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 02:35:10,026 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 02:35:10,026 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 02:35:10,026 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 02:35:10,026 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 02:35:10,027 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 02:35:10,027 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 02:35:10,027 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 02:35:10,027 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 02:35:10,027 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 02:35:10,028 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 02:35:10,028 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 02:35:10,028 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 02:35:10,028 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 02:35:10,029 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 02:35:10,029 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 02:35:10,058 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 02:35:10,078 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 02:35:10,085 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 02:35:10,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 02:35:10,087 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 02:35:10,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2019-10-03 02:35:10,172 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebc01c9f/1bd198d6178b488a9c7374ee885f4e6c/FLAG609fc8858 [2019-10-03 02:35:10,660 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 02:35:10,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2019-10-03 02:35:10,668 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebc01c9f/1bd198d6178b488a9c7374ee885f4e6c/FLAG609fc8858 [2019-10-03 02:35:11,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cebc01c9f/1bd198d6178b488a9c7374ee885f4e6c [2019-10-03 02:35:11,034 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 02:35:11,036 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 02:35:11,037 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 02:35:11,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 02:35:11,041 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 02:35:11,042 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,045 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb1ed1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11, skipping insertion in model container [2019-10-03 02:35:11,045 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,053 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 02:35:11,070 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 02:35:11,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:35:11,271 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 02:35:11,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 02:35:11,302 INFO L192 MainTranslator]: Completed translation [2019-10-03 02:35:11,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11 WrapperNode [2019-10-03 02:35:11,303 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 02:35:11,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 02:35:11,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 02:35:11,305 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 02:35:11,405 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,416 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,420 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,422 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (1/1) ... [2019-10-03 02:35:11,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 02:35:11,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 02:35:11,424 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 02:35:11,424 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 02:35:11,425 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (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-10-03 02:35:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 02:35:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 02:35:11,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-03 02:35:11,492 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 02:35:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 02:35:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-03 02:35:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-03 02:35:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 02:35:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 02:35:11,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 02:35:11,663 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 02:35:11,663 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-03 02:35:11,664 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:35:11 BoogieIcfgContainer [2019-10-03 02:35:11,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 02:35:11,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 02:35:11,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 02:35:11,669 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 02:35:11,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 02:35:11" (1/3) ... [2019-10-03 02:35:11,670 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270b80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:35:11, skipping insertion in model container [2019-10-03 02:35:11,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 02:35:11" (2/3) ... [2019-10-03 02:35:11,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@270b80b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 02:35:11, skipping insertion in model container [2019-10-03 02:35:11,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 02:35:11" (3/3) ... [2019-10-03 02:35:11,673 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2019-10-03 02:35:11,682 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 02:35:11,690 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 02:35:11,707 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 02:35:11,743 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 02:35:11,743 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 02:35:11,743 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 02:35:11,743 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 02:35:11,743 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 02:35:11,744 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 02:35:11,744 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 02:35:11,744 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 02:35:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2019-10-03 02:35:11,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:35:11,776 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:11,777 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:11,779 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2019-10-03 02:35:11,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:11,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:11,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:11,846 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:11,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:11,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:11,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:11,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-03 02:35:11,931 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:11,935 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 02:35:11,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 02:35:11,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:35:11,950 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2019-10-03 02:35:11,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:11,967 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2019-10-03 02:35:11,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 02:35:11,968 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-03 02:35:11,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:11,978 INFO L225 Difference]: With dead ends: 20 [2019-10-03 02:35:11,978 INFO L226 Difference]: Without dead ends: 14 [2019-10-03 02:35:11,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 02:35:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-10-03 02:35:12,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-10-03 02:35:12,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-03 02:35:12,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2019-10-03 02:35:12,016 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2019-10-03 02:35:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:12,016 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2019-10-03 02:35:12,016 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 02:35:12,017 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2019-10-03 02:35:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-03 02:35:12,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:12,017 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:12,018 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:12,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:12,018 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2019-10-03 02:35:12,019 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:12,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:12,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:12,021 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:12,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:12,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:12,124 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:12,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 02:35:12,124 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:12,126 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 02:35:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 02:35:12,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 02:35:12,127 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2019-10-03 02:35:12,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:12,191 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2019-10-03 02:35:12,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:12,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2019-10-03 02:35:12,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:12,192 INFO L225 Difference]: With dead ends: 21 [2019-10-03 02:35:12,192 INFO L226 Difference]: Without dead ends: 18 [2019-10-03 02:35:12,193 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-03 02:35:12,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-03 02:35:12,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-03 02:35:12,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-03 02:35:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2019-10-03 02:35:12,198 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2019-10-03 02:35:12,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:12,198 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2019-10-03 02:35:12,198 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 02:35:12,198 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2019-10-03 02:35:12,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-03 02:35:12,199 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:12,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:12,199 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:12,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:12,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2019-10-03 02:35:12,200 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:12,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:12,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:12,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:12,202 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:12,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:12,480 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:12,480 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:12,481 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2019-10-03 02:35:12,483 INFO L207 CegarAbsIntRunner]: [0], [4], [10], [12], [15], [19], [21], [27], [30], [32], [38], [39], [40], [42] [2019-10-03 02:35:12,514 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 02:35:12,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 02:35:12,573 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-10-03 02:35:12,708 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-10-03 02:35:12,714 INFO L272 AbstractInterpreter]: Visited 14 different actions 68 times. Merged at 5 different actions 30 times. Widened at 1 different actions 4 times. Performed 117 root evaluator evaluations with a maximum evaluation depth of 6. Performed 117 inverse root evaluator evaluations with a maximum inverse evaluation depth of 6. Found 1 fixpoints after 1 different actions. Largest state had 7 variables. [2019-10-03 02:35:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:12,719 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-03 02:35:12,719 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:12,719 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) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:12,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:12,744 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:12,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-03 02:35:12,767 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:12,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:12,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:12,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:13,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:13,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:13,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 21 [2019-10-03 02:35:13,171 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:13,172 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:35:13,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:35:13,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=336, Unknown=0, NotChecked=0, Total=420 [2019-10-03 02:35:13,174 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2019-10-03 02:35:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:13,452 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2019-10-03 02:35:13,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-03 02:35:13,453 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2019-10-03 02:35:13,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:13,456 INFO L225 Difference]: With dead ends: 38 [2019-10-03 02:35:13,456 INFO L226 Difference]: Without dead ends: 34 [2019-10-03 02:35:13,457 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2019-10-03 02:35:13,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-03 02:35:13,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2019-10-03 02:35:13,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-03 02:35:13,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2019-10-03 02:35:13,465 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2019-10-03 02:35:13,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:13,466 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2019-10-03 02:35:13,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:35:13,466 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2019-10-03 02:35:13,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:35:13,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:13,467 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:13,468 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:13,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:13,468 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2019-10-03 02:35:13,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:13,470 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:13,470 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:13,470 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:13,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:13,497 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 02:35:13,498 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 02:35:13,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 02:35:13,498 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 02:35:13,499 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 02:35:13,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 02:35:13,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 02:35:13,500 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2019-10-03 02:35:13,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:13,516 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2019-10-03 02:35:13,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 02:35:13,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-03 02:35:13,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:13,517 INFO L225 Difference]: With dead ends: 23 [2019-10-03 02:35:13,518 INFO L226 Difference]: Without dead ends: 23 [2019-10-03 02:35:13,518 INFO L640 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-10-03 02:35:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-03 02:35:13,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-03 02:35:13,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-03 02:35:13,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-10-03 02:35:13,522 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2019-10-03 02:35:13,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:13,522 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-10-03 02:35:13,522 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 02:35:13,523 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-10-03 02:35:13,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-03 02:35:13,523 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:13,524 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:13,524 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:13,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:13,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2019-10-03 02:35:13,524 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:13,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:13,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:13,526 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:13,566 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:13,566 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:13,566 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:13,566 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:13,566 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:13,567 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:13,567 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) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:13,597 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:13,597 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:13,622 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-03 02:35:13,622 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:13,623 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-03 02:35:13,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:13,666 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:13,666 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:13,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:13,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2019-10-03 02:35:13,724 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:13,724 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 02:35:13,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 02:35:13,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:35:13,725 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2019-10-03 02:35:13,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:13,772 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-10-03 02:35:13,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 02:35:13,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-10-03 02:35:13,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:13,774 INFO L225 Difference]: With dead ends: 23 [2019-10-03 02:35:13,774 INFO L226 Difference]: Without dead ends: 23 [2019-10-03 02:35:13,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=58, Unknown=0, NotChecked=0, Total=110 [2019-10-03 02:35:13,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-03 02:35:13,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-03 02:35:13,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-03 02:35:13,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-03 02:35:13,779 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2019-10-03 02:35:13,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:13,779 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-03 02:35:13,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 02:35:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-03 02:35:13,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:35:13,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:13,781 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:13,781 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:13,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:13,782 INFO L82 PathProgramCache]: Analyzing trace with hash -1780946716, now seen corresponding path program 3 times [2019-10-03 02:35:13,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:13,784 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:13,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:13,784 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:13,851 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:13,851 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:13,852 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:13,852 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:13,855 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:13,856 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:13,856 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) [2019-10-03 02:35:13,879 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-03 02:35:13,880 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:13,899 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-03 02:35:13,899 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:13,900 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-03 02:35:13,902 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:13,974 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:13,974 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:14,043 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:14,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:14,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2019-10-03 02:35:14,048 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:14,049 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-03 02:35:14,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-03 02:35:14,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:35:14,050 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2019-10-03 02:35:14,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:14,122 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-10-03 02:35:14,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 02:35:14,124 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2019-10-03 02:35:14,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:14,125 INFO L225 Difference]: With dead ends: 25 [2019-10-03 02:35:14,125 INFO L226 Difference]: Without dead ends: 25 [2019-10-03 02:35:14,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=130, Unknown=0, NotChecked=0, Total=240 [2019-10-03 02:35:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-10-03 02:35:14,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-10-03 02:35:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-03 02:35:14,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-10-03 02:35:14,131 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2019-10-03 02:35:14,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:14,132 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-10-03 02:35:14,133 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-03 02:35:14,133 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-10-03 02:35:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-03 02:35:14,134 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:14,134 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:14,135 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:14,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:14,136 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2019-10-03 02:35:14,136 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:14,140 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:14,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:14,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:14,390 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-03 02:35:14,390 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:14,390 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:14,391 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:14,391 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:14,391 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:14,391 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-10-03 02:35:14,410 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:14,410 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:14,424 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-10-03 02:35:14,424 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:14,426 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-03 02:35:14,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:14,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-03 02:35:14,674 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:14,674 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:14,964 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:14,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 13] total 30 [2019-10-03 02:35:14,964 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:14,965 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-03 02:35:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-03 02:35:14,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=745, Unknown=0, NotChecked=0, Total=870 [2019-10-03 02:35:14,967 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2019-10-03 02:35:15,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:15,503 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-10-03 02:35:15,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-03 02:35:15,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2019-10-03 02:35:15,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:15,504 INFO L225 Difference]: With dead ends: 40 [2019-10-03 02:35:15,504 INFO L226 Difference]: Without dead ends: 36 [2019-10-03 02:35:15,505 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 459 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=288, Invalid=1604, Unknown=0, NotChecked=0, Total=1892 [2019-10-03 02:35:15,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-03 02:35:15,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2019-10-03 02:35:15,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-03 02:35:15,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-03 02:35:15,510 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2019-10-03 02:35:15,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:15,510 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-03 02:35:15,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-03 02:35:15,510 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-03 02:35:15,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-03 02:35:15,511 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:15,511 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:15,512 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:15,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:15,512 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 4 times [2019-10-03 02:35:15,512 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:15,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,514 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:15,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,514 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:15,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:15,606 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:15,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:15,607 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:15,607 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:15,607 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:15,607 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:15,607 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 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:15,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:15,633 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-10-03 02:35:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:15,644 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-03 02:35:15,646 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:15,720 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:15,798 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:15,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:15,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2019-10-03 02:35:15,802 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:15,802 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-03 02:35:15,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-03 02:35:15,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:35:15,804 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2019-10-03 02:35:15,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:15,880 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-10-03 02:35:15,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 02:35:15,881 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-03 02:35:15,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:15,882 INFO L225 Difference]: With dead ends: 33 [2019-10-03 02:35:15,882 INFO L226 Difference]: Without dead ends: 33 [2019-10-03 02:35:15,883 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=132, Invalid=174, Unknown=0, NotChecked=0, Total=306 [2019-10-03 02:35:15,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-03 02:35:15,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2019-10-03 02:35:15,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-03 02:35:15,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-03 02:35:15,887 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2019-10-03 02:35:15,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:15,887 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-03 02:35:15,887 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-03 02:35:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-03 02:35:15,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-03 02:35:15,888 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:15,888 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:15,888 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:15,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:15,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1107887526, now seen corresponding path program 5 times [2019-10-03 02:35:15,889 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,890 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 02:35:15,890 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:15,890 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 02:35:16,022 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,023 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 02:35:16,023 INFO L189 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2019-10-03 02:35:16,023 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2019-10-03 02:35:16,023 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 02:35:16,023 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 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-03 02:35:16,042 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-03 02:35:16,043 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2019-10-03 02:35:16,069 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-03 02:35:16,070 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-03 02:35:16,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-03 02:35:16,072 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-03 02:35:16,179 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,179 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-03 02:35:16,260 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 02:35:16,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-10-03 02:35:16,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 20 [2019-10-03 02:35:16,264 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-10-03 02:35:16,265 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-03 02:35:16,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-03 02:35:16,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:35:16,266 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 20 states. [2019-10-03 02:35:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 02:35:16,352 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2019-10-03 02:35:16,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-03 02:35:16,353 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2019-10-03 02:35:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 02:35:16,354 INFO L225 Difference]: With dead ends: 38 [2019-10-03 02:35:16,354 INFO L226 Difference]: Without dead ends: 38 [2019-10-03 02:35:16,354 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 43 SyntacticMatches, 9 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 261 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2019-10-03 02:35:16,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-03 02:35:16,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2019-10-03 02:35:16,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-10-03 02:35:16,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2019-10-03 02:35:16,358 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2019-10-03 02:35:16,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 02:35:16,359 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2019-10-03 02:35:16,359 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-03 02:35:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2019-10-03 02:35:16,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-03 02:35:16,360 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 02:35:16,360 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 02:35:16,360 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 02:35:16,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 02:35:16,361 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 6 times [2019-10-03 02:35:16,361 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 02:35:16,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:16,362 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-03 02:35:16,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 02:35:16,362 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 02:35:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 02:35:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-03 02:35:16,439 INFO L478 BasicCegarLoop]: Counterexample might be feasible [2019-10-03 02:35:16,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 02:35:16 BoogieIcfgContainer [2019-10-03 02:35:16,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 02:35:16,492 INFO L168 Benchmark]: Toolchain (without parser) took 5455.36 ms. Allocated memory was 136.3 MB in the beginning and 289.9 MB in the end (delta: 153.6 MB). Free memory was 92.7 MB in the beginning and 239.9 MB in the end (delta: -147.2 MB). Peak memory consumption was 6.4 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:16,494 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 136.3 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-03 02:35:16,496 INFO L168 Benchmark]: CACSL2BoogieTranslator took 267.21 ms. Allocated memory is still 136.3 MB. Free memory was 92.5 MB in the beginning and 83.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:16,498 INFO L168 Benchmark]: Boogie Preprocessor took 118.54 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 83.1 MB in the beginning and 177.5 MB in the end (delta: -94.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:16,503 INFO L168 Benchmark]: RCFGBuilder took 240.95 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 165.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:16,505 INFO L168 Benchmark]: TraceAbstraction took 4823.91 ms. Allocated memory was 200.3 MB in the beginning and 289.9 MB in the end (delta: 89.7 MB). Free memory was 165.3 MB in the beginning and 239.9 MB in the end (delta: -74.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. [2019-10-03 02:35:16,515 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.28 ms. Allocated memory is still 136.3 MB. Free memory was 110.5 MB in the beginning and 110.3 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 267.21 ms. Allocated memory is still 136.3 MB. Free memory was 92.5 MB in the beginning and 83.3 MB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.54 ms. Allocated memory was 136.3 MB in the beginning and 200.3 MB in the end (delta: 64.0 MB). Free memory was 83.1 MB in the beginning and 177.5 MB in the end (delta: -94.4 MB). Peak memory consumption was 16.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 240.95 ms. Allocated memory is still 200.3 MB. Free memory was 177.5 MB in the beginning and 165.9 MB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4823.91 ms. Allocated memory was 200.3 MB in the beginning and 289.9 MB in the end (delta: 89.7 MB). Free memory was 165.3 MB in the beginning and 239.9 MB in the end (delta: -74.6 MB). Peak memory consumption was 15.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=0, n=6] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i