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/vogal-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:06:25,824 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:06:25,826 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:06:25,838 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:06:25,838 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:06:25,840 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:06:25,841 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:06:25,843 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:06:25,846 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:06:25,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:06:25,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:06:25,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:06:25,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:06:25,852 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:06:25,853 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:06:25,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:06:25,858 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:06:25,859 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:06:25,863 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:06:25,865 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:06:25,870 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:06:25,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:06:25,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:06:25,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:06:25,878 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:06:25,878 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:06:25,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:06:25,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:06:25,880 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:06:25,881 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:06:25,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:06:25,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:06:25,882 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:06:25,883 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:06:25,884 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:06:25,884 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:06:25,885 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:06:25,885 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:06:25,885 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:06:25,886 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:06:25,887 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:06:25,888 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-10-15 01:06:25,902 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:06:25,902 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:06:25,904 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:06:25,904 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:06:25,904 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:06:25,904 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:06:25,905 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:06:25,905 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:06:25,905 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:06:25,905 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:06:25,905 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:06:25,906 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:06:25,906 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:06:25,906 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:06:25,906 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:06:25,907 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:06:25,907 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:06:25,907 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:06:25,907 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:06:25,907 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:06:25,908 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:06:25,908 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:06:25,908 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:06:25,908 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:06:25,909 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:06:25,909 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:06:25,909 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:06:25,909 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:06:25,909 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-10-15 01:06:26,243 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:06:26,266 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:06:26,269 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:06:26,271 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:06:26,271 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:06:26,272 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/vogal-2.i [2019-10-15 01:06:26,348 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86357862/5da3ced1a6fe438693843896b7664fd5/FLAGadf69710e [2019-10-15 01:06:26,768 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:06:26,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/vogal-2.i [2019-10-15 01:06:26,774 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86357862/5da3ced1a6fe438693843896b7664fd5/FLAGadf69710e [2019-10-15 01:06:27,139 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f86357862/5da3ced1a6fe438693843896b7664fd5 [2019-10-15 01:06:27,149 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:06:27,151 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:06:27,152 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:27,153 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:06:27,157 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:06:27,158 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,161 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2c86bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27, skipping insertion in model container [2019-10-15 01:06:27,161 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,170 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:06:27,189 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:06:27,420 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:27,424 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:06:27,460 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:06:27,475 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:06:27,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27 WrapperNode [2019-10-15 01:06:27,476 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:06:27,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:06:27,477 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:06:27,477 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:06:27,577 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,610 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (1/1) ... [2019-10-15 01:06:27,615 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:06:27,616 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:06:27,616 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:06:27,616 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:06:27,622 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (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-15 01:06:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:06:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:06:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-15 01:06:27,681 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:06:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:06:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:06:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:06:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:06:27,682 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:06:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:06:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:06:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:06:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:06:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:06:27,683 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:06:28,014 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:06:28,014 INFO L284 CfgBuilder]: Removed 6 assume(true) statements. [2019-10-15 01:06:28,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:28 BoogieIcfgContainer [2019-10-15 01:06:28,016 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:06:28,023 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:06:28,023 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:06:28,028 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:06:28,029 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:06:27" (1/3) ... [2019-10-15 01:06:28,033 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401a35e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:28, skipping insertion in model container [2019-10-15 01:06:28,033 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:06:27" (2/3) ... [2019-10-15 01:06:28,034 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401a35e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:06:28, skipping insertion in model container [2019-10-15 01:06:28,034 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:06:28" (3/3) ... [2019-10-15 01:06:28,036 INFO L109 eAbstractionObserver]: Analyzing ICFG vogal-2.i [2019-10-15 01:06:28,054 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:06:28,063 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:06:28,074 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:06:28,099 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:06:28,099 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:06:28,099 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:06:28,099 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:06:28,100 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:06:28,100 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:06:28,100 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:06:28,100 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:06:28,119 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-15 01:06:28,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 01:06:28,126 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:28,127 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:28,129 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:28,135 INFO L82 PathProgramCache]: Analyzing trace with hash 907546272, now seen corresponding path program 1 times [2019-10-15 01:06:28,142 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:28,142 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962466587] [2019-10-15 01:06:28,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,143 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:28,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:28,288 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-15 01:06:28,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962466587] [2019-10-15 01:06:28,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:28,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-15 01:06:28,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461929406] [2019-10-15 01:06:28,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:06:28,296 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:28,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:06:28,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:28,312 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 2 states. [2019-10-15 01:06:28,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:28,339 INFO L93 Difference]: Finished difference Result 64 states and 91 transitions. [2019-10-15 01:06:28,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:06:28,341 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-15 01:06:28,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:28,349 INFO L225 Difference]: With dead ends: 64 [2019-10-15 01:06:28,349 INFO L226 Difference]: Without dead ends: 29 [2019-10-15 01:06:28,352 INFO L600 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-15 01:06:28,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-15 01:06:28,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-15 01:06:28,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-15 01:06:28,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-10-15 01:06:28,396 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2019-10-15 01:06:28,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:28,396 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-10-15 01:06:28,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:06:28,397 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2019-10-15 01:06:28,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 01:06:28,398 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:28,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:28,399 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:28,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:28,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1455815888, now seen corresponding path program 1 times [2019-10-15 01:06:28,400 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:28,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67642417] [2019-10-15 01:06:28,400 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,401 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:28,514 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-15 01:06:28,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67642417] [2019-10-15 01:06:28,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:28,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:06:28,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552927037] [2019-10-15 01:06:28,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:06:28,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:28,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:06:28,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:06:28,519 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand 3 states. [2019-10-15 01:06:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:28,609 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2019-10-15 01:06:28,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:06:28,611 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-10-15 01:06:28,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:28,614 INFO L225 Difference]: With dead ends: 65 [2019-10-15 01:06:28,614 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 01:06:28,615 INFO L600 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-15 01:06:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 01:06:28,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2019-10-15 01:06:28,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-15 01:06:28,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-15 01:06:28,625 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 19 [2019-10-15 01:06:28,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:28,626 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-15 01:06:28,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:06:28,626 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-10-15 01:06:28,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 01:06:28,627 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:28,627 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:28,628 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:28,628 INFO L82 PathProgramCache]: Analyzing trace with hash -941161554, now seen corresponding path program 1 times [2019-10-15 01:06:28,628 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:28,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533838123] [2019-10-15 01:06:28,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,629 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:28,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:28,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:28,752 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-15 01:06:28,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533838123] [2019-10-15 01:06:28,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484916044] [2019-10-15 01:06:28,753 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-10-15 01:06:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:28,849 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-15 01:06:28,859 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:28,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:06:28,921 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:28,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:06:28,991 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:06:28,991 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [4] total 12 [2019-10-15 01:06:28,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874306903] [2019-10-15 01:06:28,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:06:28,993 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:28,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:06:28,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:06:28,994 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 10 states. [2019-10-15 01:06:29,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:29,076 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2019-10-15 01:06:29,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:06:29,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-15 01:06:29,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:29,079 INFO L225 Difference]: With dead ends: 54 [2019-10-15 01:06:29,079 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 01:06:29,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:06:29,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 01:06:29,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 42. [2019-10-15 01:06:29,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-15 01:06:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2019-10-15 01:06:29,089 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 54 transitions. Word has length 21 [2019-10-15 01:06:29,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:29,089 INFO L462 AbstractCegarLoop]: Abstraction has 42 states and 54 transitions. [2019-10-15 01:06:29,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:06:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 54 transitions. [2019-10-15 01:06:29,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-15 01:06:29,091 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:29,091 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:29,296 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:29,297 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:29,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:29,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1722235897, now seen corresponding path program 1 times [2019-10-15 01:06:29,298 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:29,298 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511417906] [2019-10-15 01:06:29,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,299 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,299 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:29,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:06:29,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511417906] [2019-10-15 01:06:29,443 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513748744] [2019-10-15 01:06:29,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:29,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-15 01:06:29,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:29,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:06:29,537 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:29,570 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:06:29,571 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-15 01:06:29,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 8 [2019-10-15 01:06:29,571 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50400491] [2019-10-15 01:06:29,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:06:29,573 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:29,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:06:29,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:29,574 INFO L87 Difference]: Start difference. First operand 42 states and 54 transitions. Second operand 6 states. [2019-10-15 01:06:29,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:29,670 INFO L93 Difference]: Finished difference Result 99 states and 132 transitions. [2019-10-15 01:06:29,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:06:29,671 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-10-15 01:06:29,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:29,672 INFO L225 Difference]: With dead ends: 99 [2019-10-15 01:06:29,672 INFO L226 Difference]: Without dead ends: 70 [2019-10-15 01:06:29,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:06:29,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-15 01:06:29,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 46. [2019-10-15 01:06:29,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-15 01:06:29,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2019-10-15 01:06:29,686 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 27 [2019-10-15 01:06:29,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:29,687 INFO L462 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2019-10-15 01:06:29,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:06:29,687 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2019-10-15 01:06:29,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-15 01:06:29,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:29,689 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:29,889 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:29,890 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:29,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:29,891 INFO L82 PathProgramCache]: Analyzing trace with hash 322541692, now seen corresponding path program 1 times [2019-10-15 01:06:29,891 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:29,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680609253] [2019-10-15 01:06:29,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:29,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:29,973 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:06:29,973 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680609253] [2019-10-15 01:06:29,974 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150671203] [2019-10-15 01:06:29,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:30,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-15 01:06:30,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:30,182 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 15 treesize of output 7 [2019-10-15 01:06:30,187 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,191 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:30,191 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,191 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:3 [2019-10-15 01:06:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-15 01:06:30,206 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:30,267 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:30,285 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:06:30,288 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-10-15 01:06:30,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,298 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:30,299 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-15 01:06:30,300 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:30,300 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,311 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-10-15 01:06:30,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:06:30,311 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:53, output treesize:7 [2019-10-15 01:06:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:06:30,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-15 01:06:30,332 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [4, 9] total 15 [2019-10-15 01:06:30,332 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652899625] [2019-10-15 01:06:30,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:06:30,333 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:30,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:06:30,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:06:30,333 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand 7 states. [2019-10-15 01:06:30,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:30,522 INFO L93 Difference]: Finished difference Result 66 states and 83 transitions. [2019-10-15 01:06:30,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:06:30,523 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-10-15 01:06:30,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:30,524 INFO L225 Difference]: With dead ends: 66 [2019-10-15 01:06:30,524 INFO L226 Difference]: Without dead ends: 44 [2019-10-15 01:06:30,525 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:06:30,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-15 01:06:30,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-10-15 01:06:30,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-15 01:06:30,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-15 01:06:30,532 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 28 [2019-10-15 01:06:30,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:30,533 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-15 01:06:30,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:06:30,533 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-15 01:06:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-15 01:06:30,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:30,534 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:06:30,735 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:30,735 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash 739985250, now seen corresponding path program 1 times [2019-10-15 01:06:30,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:30,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108386073] [2019-10-15 01:06:30,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:30,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:30,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,856 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-15 01:06:30,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108386073] [2019-10-15 01:06:30,857 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359628307] [2019-10-15 01:06:30,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:30,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-15 01:06:30,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 01:06:31,019 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 16 treesize of output 8 [2019-10-15 01:06:31,020 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:31,023 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:31,023 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:06:31,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:4 [2019-10-15 01:06:31,035 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-15 01:06:31,036 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 01:06:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:31,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:31,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:31,147 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:31,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 26 [2019-10-15 01:06:31,156 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 01:06:31,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:31,164 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:06:31,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 13 [2019-10-15 01:06:31,168 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:31,175 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-15 01:06:31,178 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-15 01:06:31,182 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-15 01:06:31,183 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 15 [2019-10-15 01:06:31,184 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-10-15 01:06:31,196 INFO L567 ElimStorePlain]: treesize reduction 13, result has 35.0 percent of original size [2019-10-15 01:06:31,196 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-15 01:06:31,197 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:85, output treesize:7 [2019-10-15 01:06:31,218 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-15 01:06:31,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [165799121] [2019-10-15 01:06:31,232 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 30 [2019-10-15 01:06:31,277 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-15 01:06:31,277 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-15 01:06:31,365 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-15 01:06:31,367 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 32 variables. [2019-10-15 01:06:31,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:31,372 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-15 01:06:31,445 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-15 01:06:31,446 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-15 01:06:31,450 INFO L553 sIntCurrentIteration]: We unified 28 AI predicates to 28 [2019-10-15 01:06:31,451 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-15 01:06:31,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-15 01:06:31,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 9, 7] total 15 [2019-10-15 01:06:31,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339504032] [2019-10-15 01:06:31,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-15 01:06:31,454 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:31,454 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-15 01:06:31,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-15 01:06:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-15 01:06:31,455 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 2 states. [2019-10-15 01:06:31,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:31,461 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2019-10-15 01:06:31,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-15 01:06:31,461 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 29 [2019-10-15 01:06:31,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:31,461 INFO L225 Difference]: With dead ends: 44 [2019-10-15 01:06:31,461 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 01:06:31,462 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 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-15 01:06:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 01:06:31,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 01:06:31,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 01:06:31,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 01:06:31,462 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2019-10-15 01:06:31,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:31,463 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 01:06:31,463 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-15 01:06:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 01:06:31,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 01:06:31,663 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 01:06:31,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 01:06:31,793 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,794 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:06:31,794 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,794 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,794 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 01:06:31,794 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 01:06:31,795 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 01:06:31,795 INFO L439 ceAbstractionStarter]: At program point L35-3(lines 35 43) the Hoare annotation is: (let ((.cse0 (select |#memory_int| |main_~#string_entrada~0.base|))) (and (= main_~cont~0 0) (let ((.cse1 (mod main_~i~0 4294967296))) (or (and (= (select .cse0 (+ |main_~#string_entrada~0.offset| .cse1)) 0) (<= .cse1 2147483647)) (and (= (select .cse0 (+ |main_~#string_entrada~0.offset| .cse1 (- 4294967296))) 0) (< 2147483647 .cse1)))) (= 0 main_~cont_aux~0) (= 0 (select .cse0 |main_~#string_entrada~0.offset|)) (= (mod main_~n_caracter~0 4294967296) 0))) [2019-10-15 01:06:31,796 INFO L439 ceAbstractionStarter]: At program point L35-4(lines 35 43) the Hoare annotation is: (and (= main_~cont~0 0) (= 0 main_~cont_aux~0)) [2019-10-15 01:06:31,796 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 13 47) no Hoare annotation was computed. [2019-10-15 01:06:31,796 INFO L443 ceAbstractionStarter]: For program point L44(line 44) no Hoare annotation was computed. [2019-10-15 01:06:31,797 INFO L443 ceAbstractionStarter]: For program point L28-2(lines 28 31) no Hoare annotation was computed. [2019-10-15 01:06:31,797 INFO L439 ceAbstractionStarter]: At program point L28-3(lines 28 31) the Hoare annotation is: (and (= main_~n_caracter~0 0) (= main_~cont~0 0) (= 0 (select (select |#memory_int| |main_~#string_entrada~0.base|) |main_~#string_entrada~0.offset|)) (= main_~i~0 0)) [2019-10-15 01:06:31,797 INFO L443 ceAbstractionStarter]: For program point L28-4(lines 28 31) no Hoare annotation was computed. [2019-10-15 01:06:31,797 INFO L443 ceAbstractionStarter]: For program point L24-1(lines 24 25) no Hoare annotation was computed. [2019-10-15 01:06:31,797 INFO L439 ceAbstractionStarter]: At program point L24-3(lines 24 25) the Hoare annotation is: false [2019-10-15 01:06:31,797 INFO L443 ceAbstractionStarter]: For program point L24-4(lines 24 25) no Hoare annotation was computed. [2019-10-15 01:06:31,798 INFO L443 ceAbstractionStarter]: For program point L37-2(lines 37 41) no Hoare annotation was computed. [2019-10-15 01:06:31,798 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 37 41) the Hoare annotation is: false [2019-10-15 01:06:31,798 INFO L443 ceAbstractionStarter]: For program point L37-4(lines 37 41) no Hoare annotation was computed. [2019-10-15 01:06:31,798 INFO L443 ceAbstractionStarter]: For program point L29-2(lines 29 31) no Hoare annotation was computed. [2019-10-15 01:06:31,803 INFO L439 ceAbstractionStarter]: At program point L29-3(lines 29 31) the Hoare annotation is: false [2019-10-15 01:06:31,803 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 13 47) no Hoare annotation was computed. [2019-10-15 01:06:31,804 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-10-15 01:06:31,804 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 13 47) the Hoare annotation is: true [2019-10-15 01:06:31,804 INFO L443 ceAbstractionStarter]: For program point L18-2(lines 18 19) no Hoare annotation was computed. [2019-10-15 01:06:31,804 INFO L439 ceAbstractionStarter]: At program point L18-3(lines 18 19) the Hoare annotation is: false [2019-10-15 01:06:31,804 INFO L443 ceAbstractionStarter]: For program point L18-4(lines 18 19) no Hoare annotation was computed. [2019-10-15 01:06:31,804 INFO L443 ceAbstractionStarter]: For program point L39(lines 39 40) no Hoare annotation was computed. [2019-10-15 01:06:31,805 INFO L443 ceAbstractionStarter]: For program point L35-1(lines 35 43) no Hoare annotation was computed. [2019-10-15 01:06:31,805 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-15 01:06:31,805 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-15 01:06:31,805 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:06:31,805 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-15 01:06:31,805 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-15 01:06:31,806 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-15 01:06:31,819 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,821 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,828 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,829 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,835 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:06:31 BoogieIcfgContainer [2019-10-15 01:06:31,840 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 01:06:31,843 INFO L168 Benchmark]: Toolchain (without parser) took 4691.39 ms. Allocated memory was 138.9 MB in the beginning and 244.3 MB in the end (delta: 105.4 MB). Free memory was 104.2 MB in the beginning and 163.6 MB in the end (delta: -59.4 MB). Peak memory consumption was 45.9 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,845 INFO L168 Benchmark]: CDTParser took 1.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,846 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.81 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 92.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,850 INFO L168 Benchmark]: Boogie Preprocessor took 138.82 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 180.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,851 INFO L168 Benchmark]: RCFGBuilder took 400.20 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 161.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,855 INFO L168 Benchmark]: TraceAbstraction took 3817.05 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 161.6 MB in the beginning and 163.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. [2019-10-15 01:06:31,862 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.23 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 323.81 ms. Allocated memory is still 138.9 MB. Free memory was 104.0 MB in the beginning and 92.7 MB in the end (delta: 11.3 MB). Peak memory consumption was 11.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 138.82 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 180.5 MB in the end (delta: -87.9 MB). Peak memory consumption was 13.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 400.20 ms. Allocated memory is still 202.9 MB. Free memory was 180.5 MB in the beginning and 161.6 MB in the end (delta: 19.0 MB). Peak memory consumption was 19.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 3817.05 ms. Allocated memory was 202.9 MB in the beginning and 244.3 MB in the end (delta: 41.4 MB). Free memory was 161.6 MB in the beginning and 163.6 MB in the end (delta: -2.0 MB). Peak memory consumption was 39.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * 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: 37]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 28]: Loop Invariant [2019-10-15 01:06:31,880 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,881 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((n_caracter == 0 && cont == 0) && 0 == unknown-#memory_int-unknown[string_entrada][string_entrada]) && i == 0 - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 35]: Loop Invariant [2019-10-15 01:06:31,882 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-15 01:06:31,887 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((cont == 0 && ((unknown-#memory_int-unknown[string_entrada][string_entrada + i % 4294967296] == 0 && i % 4294967296 <= 2147483647) || (unknown-#memory_int-unknown[string_entrada][string_entrada + i % 4294967296 + -4294967296] == 0 && 2147483647 < i % 4294967296))) && 0 == cont_aux) && 0 == unknown-#memory_int-unknown[string_entrada][string_entrada]) && n_caracter % 4294967296 == 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 3.7s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 171 SDtfs, 86 SDslu, 416 SDs, 0 SdLazy, 141 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 199 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=4, 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, 6 MinimizatonAttempts, 45 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 17 PreInvPairs, 20 NumberOfFragments, 88 HoareAnnotationTreeSize, 17 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 41 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 246 NumberOfCodeBlocks, 246 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 337 ConstructedInterpolants, 0 QuantifiedInterpolants, 23942 SizeOfPredicates, 22 NumberOfNonLiveVariables, 462 ConjunctsInSsa, 51 ConjunctsInUnsatCore, 14 InterpolantComputations, 7 PerfectInterpolantSequences, 30/39 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 141, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9196428571428571, AVG_VARS_REMOVED_DURING_WEAKENING: 1.0357142857142858, AVG_WEAKENED_CONJUNCTS: 0.21428571428571427, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...