/usr/bin/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 00:35:35,726 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 00:35:35,728 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 00:35:35,741 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 00:35:35,741 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 00:35:35,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 00:35:35,744 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 00:35:35,746 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 00:35:35,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 00:35:35,748 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 00:35:35,749 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 00:35:35,750 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 00:35:35,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 00:35:35,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 00:35:35,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 00:35:35,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 00:35:35,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 00:35:35,756 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 00:35:35,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 00:35:35,759 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 00:35:35,761 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 00:35:35,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 00:35:35,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 00:35:35,764 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 00:35:35,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 00:35:35,767 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 00:35:35,767 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 00:35:35,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 00:35:35,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 00:35:35,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 00:35:35,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 00:35:35,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 00:35:35,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 00:35:35,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 00:35:35,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 00:35:35,773 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 00:35:35,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 00:35:35,774 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 00:35:35,774 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 00:35:35,775 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 00:35:35,776 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 00:35:35,777 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 00:35:35,790 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 00:35:35,791 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 00:35:35,792 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 00:35:35,792 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 00:35:35,793 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 00:35:35,793 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 00:35:35,793 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 00:35:35,793 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 00:35:35,793 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 00:35:35,794 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 00:35:35,794 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 00:35:35,794 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 00:35:35,794 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 00:35:35,794 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 00:35:35,795 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 00:35:35,795 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 00:35:35,795 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 00:35:35,795 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 00:35:35,795 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 00:35:35,796 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 00:35:35,796 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 00:35:35,796 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 00:35:35,796 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 00:35:35,796 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 00:35:35,797 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 00:35:35,797 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 00:35:35,797 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 00:35:35,797 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 00:35:35,797 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-11-07 00:35:36,064 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 00:35:36,077 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 00:35:36,080 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 00:35:36,082 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 00:35:36,082 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 00:35:36,083 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2019-11-07 00:35:36,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099da99f5/eae975ce576f46e0a5659660271d1c88/FLAG7f179344b [2019-11-07 00:35:36,571 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 00:35:36,572 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2019-11-07 00:35:36,579 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099da99f5/eae975ce576f46e0a5659660271d1c88/FLAG7f179344b [2019-11-07 00:35:37,003 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099da99f5/eae975ce576f46e0a5659660271d1c88 [2019-11-07 00:35:37,020 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 00:35:37,023 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 00:35:37,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 00:35:37,037 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 00:35:37,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 00:35:37,050 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,061 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d77e53a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37, skipping insertion in model container [2019-11-07 00:35:37,062 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,080 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 00:35:37,126 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 00:35:37,434 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:35:37,446 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 00:35:37,475 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 00:35:37,576 INFO L192 MainTranslator]: Completed translation [2019-11-07 00:35:37,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37 WrapperNode [2019-11-07 00:35:37,577 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 00:35:37,578 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 00:35:37,578 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 00:35:37,578 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 00:35:37,594 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,594 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,601 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,608 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,616 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,618 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (1/1) ... [2019-11-07 00:35:37,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 00:35:37,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 00:35:37,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 00:35:37,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 00:35:37,623 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (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-11-07 00:35:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 00:35:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 00:35:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-11-07 00:35:37,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 00:35:37,681 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-07 00:35:37,682 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-07 00:35:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 00:35:37,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 00:35:37,972 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 00:35:37,972 INFO L284 CfgBuilder]: Removed 3 assume(true) statements. [2019-11-07 00:35:37,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:35:37 BoogieIcfgContainer [2019-11-07 00:35:37,973 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 00:35:37,978 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 00:35:37,978 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 00:35:37,984 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 00:35:37,984 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:35:37" (1/3) ... [2019-11-07 00:35:37,985 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57812ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:35:37, skipping insertion in model container [2019-11-07 00:35:37,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:35:37" (2/3) ... [2019-11-07 00:35:37,986 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57812ad1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:35:37, skipping insertion in model container [2019-11-07 00:35:37,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:35:37" (3/3) ... [2019-11-07 00:35:37,988 INFO L109 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2019-11-07 00:35:37,996 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 00:35:38,002 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 00:35:38,012 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 00:35:38,034 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 00:35:38,034 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 00:35:38,035 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 00:35:38,035 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 00:35:38,035 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 00:35:38,035 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 00:35:38,035 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 00:35:38,035 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 00:35:38,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-11-07 00:35:38,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:35:38,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:38,058 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:35:38,059 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:38,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:38,064 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-11-07 00:35:38,071 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:38,072 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060629008] [2019-11-07 00:35:38,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:38,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:38,256 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060629008] [2019-11-07 00:35:38,257 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:38,257 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-07 00:35:38,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554298549] [2019-11-07 00:35:38,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:35:38,265 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:38,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-07 00:35:38,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-07 00:35:38,279 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-11-07 00:35:38,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:38,305 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-11-07 00:35:38,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:35:38,306 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-07 00:35:38,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:38,315 INFO L225 Difference]: With dead ends: 46 [2019-11-07 00:35:38,316 INFO L226 Difference]: Without dead ends: 22 [2019-11-07 00:35:38,319 INFO L630 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-11-07 00:35:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-07 00:35:38,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-11-07 00:35:38,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-11-07 00:35:38,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-11-07 00:35:38,359 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-11-07 00:35:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:38,360 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-11-07 00:35:38,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:35:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-11-07 00:35:38,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 00:35:38,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:38,362 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:35:38,363 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:38,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:38,363 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-11-07 00:35:38,364 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:38,364 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120207210] [2019-11-07 00:35:38,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:38,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:38,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 00:35:38,607 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120207210] [2019-11-07 00:35:38,608 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:38,608 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 00:35:38,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501480047] [2019-11-07 00:35:38,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 00:35:38,610 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:38,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:35:38,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-07 00:35:38,611 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 4 states. [2019-11-07 00:35:38,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:38,678 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-11-07 00:35:38,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 00:35:38,679 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 00:35:38,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:38,680 INFO L225 Difference]: With dead ends: 34 [2019-11-07 00:35:38,680 INFO L226 Difference]: Without dead ends: 23 [2019-11-07 00:35:38,681 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-07 00:35:38,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-11-07 00:35:38,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-07 00:35:38,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-07 00:35:38,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2019-11-07 00:35:38,689 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2019-11-07 00:35:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:38,689 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2019-11-07 00:35:38,689 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 00:35:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2019-11-07 00:35:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 00:35:38,690 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:38,691 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:35:38,691 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:38,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:38,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1485613060, now seen corresponding path program 1 times [2019-11-07 00:35:38,692 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:38,692 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905263659] [2019-11-07 00:35:38,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:38,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:38,851 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:35:38,852 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905263659] [2019-11-07 00:35:38,852 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 00:35:38,852 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 00:35:38,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173564506] [2019-11-07 00:35:38,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 00:35:38,854 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:38,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 00:35:38,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:35:38,854 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 3 states. [2019-11-07 00:35:38,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:38,886 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-11-07 00:35:38,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 00:35:38,887 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-07 00:35:38,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:38,888 INFO L225 Difference]: With dead ends: 40 [2019-11-07 00:35:38,888 INFO L226 Difference]: Without dead ends: 25 [2019-11-07 00:35:38,888 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 00:35:38,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-07 00:35:38,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-11-07 00:35:38,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-07 00:35:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-11-07 00:35:38,895 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2019-11-07 00:35:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:38,895 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-11-07 00:35:38,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 00:35:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-11-07 00:35:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 00:35:38,896 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 00:35:38,896 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 00:35:38,897 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 00:35:38,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:38,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-11-07 00:35:38,897 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-07 00:35:38,898 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604996570] [2019-11-07 00:35:38,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 00:35:38,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:39,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:35:39,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604996570] [2019-11-07 00:35:39,066 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135085270] [2019-11-07 00:35:39,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:35:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 00:35:39,134 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 29 conjunts are in the unsatisfiable core [2019-11-07 00:35:39,141 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-07 00:35:39,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-07 00:35:39,203 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,213 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:35:39,214 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,215 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-11-07 00:35:39,253 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2019-11-07 00:35:39,254 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,306 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:35:39,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2019-11-07 00:35:39,341 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,389 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:35:39,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-07 00:35:39,390 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:95, output treesize:87 [2019-11-07 00:35:39,460 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:39,484 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-11-07 00:35:39,485 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,526 INFO L567 ElimStorePlain]: treesize reduction 3, result has 94.8 percent of original size [2019-11-07 00:35:39,544 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 00:35:39,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 20 [2019-11-07 00:35:39,547 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-07 00:35:39,568 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,569 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:120, output treesize:41 [2019-11-07 00:35:39,707 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:39,851 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 00:35:39,854 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 13 [2019-11-07 00:35:39,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,876 INFO L567 ElimStorePlain]: treesize reduction 7, result has 72.0 percent of original size [2019-11-07 00:35:39,878 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:35:39,878 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:55, output treesize:7 [2019-11-07 00:35:39,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:35:39,932 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-07 00:35:40,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,260 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,261 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,262 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,268 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-07 00:35:40,282 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 00:35:40,283 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-07 00:35:40,287 WARN L225 Elim1Store]: Array PQE input equivalent to true [2019-11-07 00:35:40,287 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-07 00:35:40,295 INFO L567 ElimStorePlain]: treesize reduction 202, result has 0.5 percent of original size [2019-11-07 00:35:40,296 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-11-07 00:35:40,296 INFO L464 ElimStorePlain]: Eliminatee |#memory_int| vanished before elimination [2019-11-07 00:35:40,297 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-07 00:35:40,297 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:299, output treesize:1 [2019-11-07 00:35:40,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-07 00:35:40,311 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1445133911] [2019-11-07 00:35:40,321 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 20 [2019-11-07 00:35:40,373 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-07 00:35:40,374 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-07 00:35:40,473 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-07 00:35:40,475 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 16 root evaluator evaluations with a maximum evaluation depth of 0. Performed 16 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 26 variables. [2019-11-07 00:35:40,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 00:35:40,479 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-07 00:35:40,526 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-07 00:35:40,526 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-07 00:35:40,528 INFO L553 sIntCurrentIteration]: We unified 18 AI predicates to 18 [2019-11-07 00:35:40,528 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-07 00:35:40,529 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-07 00:35:40,529 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 11, 10] total 22 [2019-11-07 00:35:40,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416811752] [2019-11-07 00:35:40,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-07 00:35:40,530 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-07 00:35:40,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 00:35:40,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-11-07 00:35:40,533 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 2 states. [2019-11-07 00:35:40,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 00:35:40,536 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2019-11-07 00:35:40,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-07 00:35:40,536 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 19 [2019-11-07 00:35:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 00:35:40,536 INFO L225 Difference]: With dead ends: 24 [2019-11-07 00:35:40,537 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 00:35:40,538 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=71, Invalid=391, Unknown=0, NotChecked=0, Total=462 [2019-11-07 00:35:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 00:35:40,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 00:35:40,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 00:35:40,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 00:35:40,540 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-07 00:35:40,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 00:35:40,540 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 00:35:40,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-07 00:35:40,540 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 00:35:40,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 00:35:40,744 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-07 00:35:40,749 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 00:35:40,775 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:35:40,775 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:35:40,775 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:35:40,776 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 00:35:40,776 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 00:35:40,776 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 00:35:40,776 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 00:35:40,776 INFO L439 ceAbstractionStarter]: At program point L31(line 31) the Hoare annotation is: false [2019-11-07 00:35:40,776 INFO L443 ceAbstractionStarter]: For program point L31-1(line 31) no Hoare annotation was computed. [2019-11-07 00:35:40,776 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 34) no Hoare annotation was computed. [2019-11-07 00:35:40,777 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 34) no Hoare annotation was computed. [2019-11-07 00:35:40,777 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 11 34) the Hoare annotation is: true [2019-11-07 00:35:40,777 INFO L443 ceAbstractionStarter]: For program point L30-2(lines 30 33) no Hoare annotation was computed. [2019-11-07 00:35:40,777 INFO L439 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: false [2019-11-07 00:35:40,777 INFO L443 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2019-11-07 00:35:40,778 INFO L443 ceAbstractionStarter]: For program point L24-2(lines 24 27) no Hoare annotation was computed. [2019-11-07 00:35:40,778 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 27) the Hoare annotation is: false [2019-11-07 00:35:40,778 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 24 27) no Hoare annotation was computed. [2019-11-07 00:35:40,778 INFO L443 ceAbstractionStarter]: For program point L16-2(lines 16 18) no Hoare annotation was computed. [2019-11-07 00:35:40,778 INFO L439 ceAbstractionStarter]: At program point L16-3(lines 16 18) the Hoare annotation is: false [2019-11-07 00:35:40,778 INFO L443 ceAbstractionStarter]: For program point L16-4(lines 16 18) no Hoare annotation was computed. [2019-11-07 00:35:40,779 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-11-07 00:35:40,779 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-11-07 00:35:40,779 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:35:40,779 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-11-07 00:35:40,779 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-11-07 00:35:40,780 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-11-07 00:35:40,788 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:35:40 BoogieIcfgContainer [2019-11-07 00:35:40,788 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 00:35:40,790 INFO L168 Benchmark]: Toolchain (without parser) took 3767.18 ms. Allocated memory was 135.3 MB in the beginning and 225.4 MB in the end (delta: 90.2 MB). Free memory was 100.0 MB in the beginning and 79.1 MB in the end (delta: 20.9 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:40,791 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 00:35:40,795 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.98 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 178.0 MB in the end (delta: -78.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:40,796 INFO L168 Benchmark]: Boogie Preprocessor took 43.62 ms. Allocated memory is still 198.2 MB. Free memory was 177.0 MB in the beginning and 175.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:40,796 INFO L168 Benchmark]: RCFGBuilder took 351.92 ms. Allocated memory is still 198.2 MB. Free memory was 175.2 MB in the beginning and 159.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:40,800 INFO L168 Benchmark]: TraceAbstraction took 2810.17 ms. Allocated memory was 198.2 MB in the beginning and 225.4 MB in the end (delta: 27.3 MB). Free memory was 159.4 MB in the beginning and 79.1 MB in the end (delta: 80.2 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. [2019-11-07 00:35:40,805 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.21 ms. Allocated memory is still 135.3 MB. Free memory was 118.5 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 540.98 ms. Allocated memory was 135.3 MB in the beginning and 198.2 MB in the end (delta: 62.9 MB). Free memory was 99.8 MB in the beginning and 178.0 MB in the end (delta: -78.2 MB). Peak memory consumption was 23.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.62 ms. Allocated memory is still 198.2 MB. Free memory was 177.0 MB in the beginning and 175.2 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 351.92 ms. Allocated memory is still 198.2 MB. Free memory was 175.2 MB in the beginning and 159.4 MB in the end (delta: 15.8 MB). Peak memory consumption was 15.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2810.17 ms. Allocated memory was 198.2 MB in the beginning and 225.4 MB in the end (delta: 27.3 MB). Free memory was 159.4 MB in the beginning and 79.1 MB in the end (delta: 80.2 MB). Peak memory consumption was 107.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 16]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 27 locations, 1 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 71 SDtfs, 13 SDslu, 35 SDs, 0 SdLazy, 23 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 12 PreInvPairs, 12 NumberOfFragments, 9 HoareAnnotationTreeSize, 12 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 85 NumberOfCodeBlocks, 85 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 98 ConstructedInterpolants, 1 QuantifiedInterpolants, 13674 SizeOfPredicates, 13 NumberOfNonLiveVariables, 82 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 6 InterpolantComputations, 3 PerfectInterpolantSequences, 4/7 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 161, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9027777777777778, AVG_VARS_REMOVED_DURING_WEAKENING: 1.1666666666666667, AVG_WEAKENED_CONJUNCTS: 0.3333333333333333, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...